New framework and explicit constructions yield non-Reed-Solomon MDS codes with lengths up to roughly q/k, far more flexible than earlier O(q^{1/k}) bounds.
Randriambololona, On Products and Powers of Linear Codes Under Component-wise Multiplication, in AGCT, 2015
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
New families of non-Reed-Solomon MDS codes
New framework and explicit constructions yield non-Reed-Solomon MDS codes with lengths up to roughly q/k, far more flexible than earlier O(q^{1/k}) bounds.