Some new upper bounds on the covering radius of binary linear codes
From MaRDI portal
Publication:3824229
DOI10.1109/18.42182zbMath0671.94014MaRDI QIDQ3824229
Publication date: 1989
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.42182
covering radius; minimum distance; generator polynomial; Norse bounds; 1-error- correcting quasi-perfect codes
Related Items
On the covering radius of Simplex codes, Some optimal codes from algebraic geometry and their covering radii, A note on the covering radius of optimum codes