The covering radius of cyclic codes of length up to 31 (Corresp.)
From MaRDI portal
Publication:3686630
DOI10.1109/TIT.1985.1057033zbMath0568.94027MaRDI QIDQ3686630
N. J. A. Sloane, Diane E. Downie
Publication date: 1985
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (2)
The solution to Berlekamp's switching game ⋮ On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right\) shortened Hamming codes and their dual-codes]
This page was built for publication: The covering radius of cyclic codes of length up to 31 (Corresp.)
