Title :
Bounds on the covering radius of linear codes
Author :
Ashikhmin, Alexei ; Bandstra, Mark ; Barg, Alexander
Author_Institution :
Bell Labs., Lucent Technol., Murray Hill, NJ, USA
Abstract :
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We combine the polynomial approach with estimates of the distance distribution of codes to derive new results for linear codes
Keywords :
dual codes; linear codes; polynomials; covering radius bounds; distance distribution; dual distance; linear codes; polynomial approach; Entropy; Hamming weight; Linear code; Polynomials; Virtual colonoscopy;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.935901
