How many weights can a linear code have ?
February 01, 2018 Β· Declared Dead Β· π Designs, Codes and Cryptography
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Minjia Shi, Hongwei Zhu, Patrick SolΓ©, GΓ©rard D. Cohen
arXiv ID
1802.00148
Category
cs.IT: Information Theory
Citations
27
Venue
Designs, Codes and Cryptography
Last Checked
3 months ago
Abstract
We study the combinatorial function $L(k,q),$ the maximum number of nonzero weights a linear code of dimension $k$ over $\F_q$ can have. We determine it completely for $q=2,$ and for $k=2,$ and provide upper and lower bounds in the general case when both $k$ and $q$ are $\ge 3.$ A refinement $L(n,k,q),$ as well as nonlinear analogues $N(M,q)$ and $N(n,M,q),$ are also introduced and studied.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Information Theory
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
A Vision of 6G Wireless Systems: Applications, Trends, Technologies, and Open Research Problems
R.I.P.
π»
Ghosted
Towards Smart and Reconfigurable Environment: Intelligent Reflecting Surface Aided Wireless Network
R.I.P.
π»
Ghosted
Wireless Communications with Unmanned Aerial Vehicles: Opportunities and Challenges
R.I.P.
π»
Ghosted
Reconfigurable Intelligent Surfaces for Energy Efficiency in Wireless Communication
R.I.P.
π»
Ghosted
An Overview of Signal Processing Techniques for Millimeter Wave MIMO Systems
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Language Models are Few-Shot Learners
R.I.P.
π»
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
π»
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
π»
Ghosted