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 combine the polynomial approach with estimates of the distance distribution of codes to derive new results for linear codes.