On the covering radius of binary, linear codes meeting the Griesmer bound
From MaRDI portal
Publication:3705350
DOI10.1109/TIT.1985.1057073zbMath0581.94010MaRDI QIDQ3705350
Henk C. A. van Tilborg, Peter B. Busschbach, Michiel G. L. Gerretzen
Publication date: 1985
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
Some optimal codes from algebraic geometry and their covering radii, A note on the covering radius of optimum codes, The index calculus method using non-smooth polynomials