On the Minimum Distance of Bose-Chaudhuri-Hocquenghem Codes

On the Minimum Distance of Bose-Chaudhuri-Hocquenghem Codes

In this paper the Mattson-Solomon algorithm is generalized in several directions. Based on the generalized algorithm, several classes of Bose-Chaudhuri-Hocquenghem codes are given and shown to possess minimum distance of values greater than those given by the Bose-Chaudhuri-Hocquenghem bound.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on applied mathematics 1968-11, Vol.16 (6), p.1325-1337
Hauptverfasser: Lum, Vincent, Chien, R. T.
Format: Artikel
Sprache:eng
Schlagworte:
Algebra
BCH codes
Codes
Coding theory
Constant coefficients
Cyclic codes
Equivalence relation
Error correction & detection
Integers
Laboratories
Mathematical minima
Polynomials
Recursion
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper the Mattson-Solomon algorithm is generalized in several directions. Based on the generalized algorithm, several classes of Bose-Chaudhuri-Hocquenghem codes are given and shown to possess minimum distance of values greater than those given by the Bose-Chaudhuri-Hocquenghem bound.
ISSN:0036-1399
1095-712X
DOI:10.1137/0116111