Bounds on the Covering Radius of Linear Codes

Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribution of codes to derive new results for linear codes.

• Type: Journal
• Year: 2002
• Where: DCC
• Authors: Alexei E. Ashikhmin, Alexander Barg
• Keywords: Computer Graphics, Covering Radius, DCC 2002, Dual Distance, Well-studied Problem