An upper bound on the covering radius as a function of the dual distance

An upper bound on the covering radius as a function of the dual distance

P. Delsarte (1973) developed a method that gives an upper bound on the cardinality of a code as a function of its minimum distance. It is shown that, using a modification of that method, one gets an upper bound on the covering radius of a code as a function of its dual distance. As an interesting sp...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 1990-11, Vol.36 (6), p.1472-1474
1. Verfasser: Tietavainen, A.A.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Equations
Error correction codes
Exact sciences and technology
Hamming weight
Information theory
Information, signal and communications theory
Linear code
Telecommunications and information theory
Upper bound
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:P. Delsarte (1973) developed a method that gives an upper bound on the cardinality of a code as a function of its minimum distance. It is shown that, using a modification of that method, one gets an upper bound on the covering radius of a code as a function of its dual distance. As an interesting special case, the covering radius of the dual of a BCH code is considered.< >
ISSN:0018-9448
1557-9654
DOI:10.1109/18.59949