On MDS extensions of generalized Reed- Solomon codes

DOI10.1109/TIT.1986.1057188zbMath0594.94017OpenAlexW2081409716MaRDI QIDQ3726007

Ron M. Roth, Gadiel Seroussi

Publication date: 1986

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1986.1057188

zbMATH Keywords

maximum distance separable code

Mathematics Subject Classification ID

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

Related Items

Intersection of arcs and normal rational curves in spaces of even characteristic ⋮ On minimum weight codewords in QR codes ⋮ Space-filling subsets of a normal rational curve ⋮ On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre ⋮ Rational points on complete symmetric hypersurfaces over finite fields ⋮ Optimal quantum error correcting codes from absolutely maximally entangled states ⋮ Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6 ⋮ Small arcs in projective spaces ⋮ Completeness of normal rational curves ⋮ M.D.S. codes and arcs in \(\mathrm{PG}(n,q)\) with \(q\) even: an improvement of the bounds of Bruen, Thas, and Blokhuis ⋮ Toy models of holographic duality between local Hamiltonians ⋮ Inclusion matrices and the MDS conjecture ⋮ Tensor Representation of Rank-Metric Codes ⋮ On 2-level secret sharing ⋮ The decoding of extended Reed-Solomon codes ⋮ On the covering radius of Reed-Solomon codes