On the covering radius of Reed-Solomon codes
From MaRDI portal
Publication:1318799
DOI10.1016/0012-365X(94)90256-9zbMath0790.94019OpenAlexW1975963044MaRDI QIDQ1318799
Publication date: 4 April 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)90256-9
covering radiusminimum distancenormal rational curvedoubly-extended Reed-Solomon codessphere packing in Hamming spacesyndromes
Cites Work
- Curve razionali normali e \(k\)-archi negli spazi finiti
- The decoding of extended Reed-Solomon codes
- Some optimal codes from algebraic geometry and their covering radii
- The automorphism groups of Reed-Solomon codes
- On linear MDS codes of length \(q+1\) over GF(q) for even q
- On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre
- Cyclic and pseudo-cyclic MDS codes of length \(q + 1\)
- 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
- Pseudocyclic maximum-distance-separable codes
- Covering radius---Survey and recent results
- On MDS extensions of generalized Reed- Solomon codes
- An elementary proof and an extension of Thas' theorem on k-arcs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
