On the covering radius of binary, linear codes meeting the Griesmer bound

Let g(k, d) = \sum_{i=0}^{k-1} \lceil d / 2^{i} \rceil . By the Griesmer bound, n \geq g(k, d) for any binary, linear [n, k, d] code. Let s = \lceil d / 2^{k-1} \rceil . Then, s can be interpreted as the maximum number of occurrences of a column in the generator matrix of any code with parameters [g...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on information theory 1985-07, Vol.31 (4), p.465-468
Hauptverfasser:	Busschbach, P., Gerretzen, M., van Tilborg, H.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Coding, codes Exact sciences and technology Information, signal and communications theory Signal and communications theory Telecommunications and information theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!