New minimum distance bounds for certain binary linear codes

Let an (n, k, d)-code denote a binary linear code of length n, dimension k, and minimum distance at least d. Define d(n, k) as the maximum value of d for which there exists a binary linear (n, k, d)-code. T. Verhoeff (1989) has provided an updated table of bounds on d(n, k) for 1

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 1992-11, Vol.38 (6), p.1795-1796
Hauptverfasser:	Daskalov, R.N., Kapralov, S.N.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Coding, codes Exact sciences and technology Hamming weight Information, signal and communications theory Linear code Mathematics Signal and communications theory Telecommunications and information theory Upper bound Vectors
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Let an (n, k, d)-code denote a binary linear code of length n, dimension k, and minimum distance at least d. Define d(n, k) as the maximum value of d for which there exists a binary linear (n, k, d)-code. T. Verhoeff (1989) has provided an updated table of bounds on d(n, k) for 1
ISSN:	0018-9448 1557-9654
DOI:	10.1109/18.165453