On covering radius and discrete Chebyshev polynomials



: Honkala I, Laihonen T, Litsyn S

Publisher: SPRINGER VERLAG

: 1997

 Applicable Algebra in Engineering, Communication and Computing

: APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING

: APPL ALGEBR ENG COMM

: 8

: 5

: 395

: 401

: 7

: 0938-1279

DOI: https://doi.org/10.1007/s002000050077


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-Tietavainen bound and in a certain interval it is also better than Tietavainen's bound. Upper bounds on even-weight codes are considered as well.



Last updated on 26/11/2024 06:25:56 PM