On the Weights of General MDS Codes
- 2 March 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 66 (9) , 5414-5418
Abstract
The weight spectra of MDS codes of length n and dimension k over arbitrary alphabets are studied. For all q-ary MDS codes of dimension k and length n ≠ q + k – 1 containing the zero codeword, it is shown that all k weights from n to n – k + 1 are realized. The weight spectrum in the remaining case n = q + k–1 is also determined. Additionally, we prove that all binary MDS codes are equivalent to linear MDS codes. The proofs are combinatorial, and self contained.Keywords
All Related Versions
Funding Information
- Natural Sciences and Engineering Research Council of Canada (200572)
This publication has 24 references indexed in Scilit:
- On sets of vectors of a finite vector space in which every subset of basis size is a basis IIDesigns, Codes and Cryptography, 2012
- On sets of vectors of a finite vector space in which every subset of basis size is a basisJournal of the European Mathematical Society, 2012
- Pseudorandom Generators without the XOR LemmaJournal of Computer and System Sciences, 2001
- Nonbinary quantum codesIEEE Transactions on Information Theory, 1999
- On M.D.S. codes, arcs inPG(n, q) withq even, and a solution of three fundamental problems of B. SegreInventiones Mathematicae, 1988
- On the non-existence of certain M.D.S. codes and projective planesMathematische Zeitschrift, 1983
- New 5-designsJournal of Combinatorial Theory, 1969
- A vector-space packing problemJournal of Algebra, 1966
- Orthogonal Arrays of Index UnityThe Annals of Mathematical Statistics, 1952
- Finite Nets, I. Numerical InvariantsCanadian Journal of Mathematics, 1951