Some new upper bounds on the covering radius of binary linear codes

DOI10.1109/18.42182zbMath0671.94014OpenAlexW2134298870MaRDI QIDQ3824229

Heeralal Janwa

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

zbMATH Keywords

covering radiusminimum distancegenerator polynomialNorse bounds1-error- correcting quasi-perfect codes

Mathematics Subject Classification ID

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

Related Items (3)

Some optimal codes from algebraic geometry and their covering radii ⋮ A note on the covering radius of optimum codes ⋮ On the covering radius of Simplex codes

This page was built for publication: Some new upper bounds on the covering radius of binary linear codes