On linear MDS codes of length \(q+1\) over GF(q) for even q
From MaRDI portal
Publication:1106178
DOI10.1016/0097-3165(88)90032-5zbMath0649.94017OpenAlexW2061948965MaRDI QIDQ1106178
Publication date: 1988
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(88)90032-5
Related Items (5)
BCH cyclic codes ⋮ Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6 ⋮ Cyclic and pseudo-cyclic MDS codes of length \(q + 1\) ⋮ The decoding of extended Reed-Solomon codes ⋮ On the covering radius of Reed-Solomon codes
Cites Work
This page was built for publication: On linear MDS codes of length \(q+1\) over GF(q) for even q
