Asymptotic bounds on the covering radius of binary codes
From MaRDI portal
Publication:3199338
DOI10.1109/18.59948zbMath0713.94024MaRDI QIDQ3199338
Publication date: 1990
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.59948
BCH codes; Reed-Muller codes; covering radius; binary codes; weight distribution; asymptotic bounds; quadratic residue codes; asymptotically perfect codes
Related Items
Covering radius and dual distance, The covering radius of spherical designs, On the covering radius of Reed-Muller codes, Weight distribution and dual distance