Cyclic and pseudo-cyclic MDS codes of length \(q + 1\)

DOI10.1016/0097-3165(92)90104-3zbMath0744.94014OpenAlexW2065154502MaRDI QIDQ1185890

Jens P. Pedersen, Carsten Dahl

Publication date: 28 June 1992

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(92)90104-3

zbMATH Keywords

cyclic codesgeneralized Reed-Solomon codespseudo-cyclic MDS codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Related Items (5)

Several families of irreducible constacyclic and cyclic codes ⋮ Two classes of constacyclic codes with variable parameters ⋮ BCH cyclic codes ⋮ Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length ⋮ On the covering radius of Reed-Solomon codes

Cites Work

• Unnamed Item
• Unnamed Item
• The automorphism groups of Reed-Solomon codes
• On linear MDS codes of length \(q+1\) over GF(q) for even q
• Maximum distance separable multilevel codes (Corresp.)
• Some long cyclic linear binary codes are not so bad

This page was built for publication: Cyclic and pseudo-cyclic MDS codes of length \(q + 1\)