A1 Refereed original research article in a scientific journal
On covering radius and discrete Chebyshev polynomials
Authors: Honkala I, Laihonen T, Litsyn S
Publisher: SPRINGER VERLAG
Publication year: 1997
Journal: Applicable Algebra in Engineering, Communication and Computing
Journal name in source: APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING
Journal acronym: APPL ALGEBR ENG COMM
Volume: 8
Issue: 5
First page : 395
Last page: 401
Number of pages: 7
ISSN: 0938-1279
DOI: https://doi.org/10.1007/s002000050077
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-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.
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.
UTU Research Portal