On the [162,8,80] codes

Constructions of [162,8,80] and [159,8,78] codes are given. This solves the open problems of finding the minimum length of binary codes of dimension S and minimum distances 78 and 80, respectively.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 1997-11, Vol.43 (6), p.2055-2057
Hauptverfasser:	Boukliev, I., Dodunekov, S.M., Helleseth, T., Ytrehus, O.
Format:	Artikel
Sprache:	eng
Schlagworte:	Codes Computer aided software engineering Equations Hamming distance Hamming weight Informatics Information technology Linear code Mathematics Polynomials Vectors
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Constructions of [162,8,80] and [159,8,78] codes are given. This solves the open problems of finding the minimum length of binary codes of dimension S and minimum distances 78 and 80, respectively.
ISSN:	0018-9448 1557-9654
DOI:	10.1109/18.641576