Sciweavers

DCC
2002
IEEE
15 years 12 days 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 distribu...
Alexei E. Ashikhmin, Alexander Barg