Bounds on the Covering Radius of Linear Codes

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