A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
On covering radius and discrete Chebyshev polynomials
Tekijät: Honkala I, Laihonen T, Litsyn S
Kustantaja: SPRINGER VERLAG
Julkaisuvuosi: 1997
Journal: Applicable Algebra in Engineering, Communication and Computing
Tietokannassa oleva lehden nimi: APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING
Lehden akronyymi: APPL ALGEBR ENG COMM
Vuosikerta: 8
Numero: 5
Aloitussivu: 395
Lopetussivu: 401
Sivujen määrä: 7
ISSN: 0938-1279
DOI: https://doi.org/10.1007/s002000050077
Tiivistelmä
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.
Turun yliopiston Tutkimustietojärjestelmän portaali