On Covering Radius and Discrete Chebyshev Polynomials |
| |
| Authors: | I Honkala T Laihonen S Litsyn |
| |
| Affiliation: | (1) Department of Mathematics, University of Turku, Fin-20014 Turku, Finland, FI;(2) Department of Electrical Engineering-Systems, Tel-Aviv University, Ramat-Aviv, 69978, Israel, IL |
| |
| Abstract: | We derive a new upper bound on the covering radius of a code as a function of its dual distance. This bound improves on the
Honkala-Litsyn-Tiet?v?inen bound and in a certain interval it is also better than Tiet?v?inen’s bound. Upper bounds on even-weight
codes are considered as well.
Received: November 4, 1996; revised version: February 1, 1997 |
| |
| Keywords: | : Code Covering radius Dual distance Discrete Chebyshev polynomials |
| 本文献已被 SpringerLink 等数据库收录！ |
|
