|
|||||
|
|
Bounds on the Covering Radius of Linear Codes |
|
| Authors: | A Ashikhmin A Barg |
| Institution: | (1) Bell Labs, Lucent Technologies, 600 Mountain Avenue, Murray Hill, NJ, 07974 |
| Abstract: | 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. |
| Keywords: | asymptotics of Krawtchouk polynomials Christoffel-Darboux kernel distance distribution dual distance |
| 本文献已被 SpringerLink 等数据库收录！ | |