Sciweavers

Share
DCC
2002
IEEE

Bounds on the Covering Radius of Linear Codes

9 years 1 months ago
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.
Alexei E. Ashikhmin, Alexander Barg
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2002
Where DCC
Authors Alexei E. Ashikhmin, Alexander Barg
Comments (0)
books