On linear codes and distinct weights
classification
🧮 math.CO
cs.ITmath.IT
keywords
codesdistinctlinearweightsnumberarbitraryattainingbinary
read the original abstract
We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct non-zero weights, and we completely determine a solution in the binary case.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.