All binary linear codes of lengths up to 18 or redundancy up to 10 are normal (Q660087)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: All binary linear codes of lengths up to 18 or redundancy up to 10 are normal |
scientific article; zbMATH DE number 6000193
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All binary linear codes of lengths up to 18 or redundancy up to 10 are normal |
scientific article; zbMATH DE number 6000193 |
Statements
All binary linear codes of lengths up to 18 or redundancy up to 10 are normal (English)
0 references
25 January 2012
0 references
For a survey of covering codes, see for example [\textit{G. Cohen}, \textit{I. Honkala}, \textit{S. Litsyn} and \textit{A. Lobstein}, Covering codes. Amsterdam: Elsevier (1997; Zbl 0874.94001)]. Normality and amalgamated direct sum are used to construct good covering codes, i.e., codes with small covering radius compared to others of the same length and dimension. This kind of approach requires the constituent codes to be normal. Hence, much research has been focused on the question: which codes are normal? The author proves in this paper the normality of the binary linear codes of lengths 16, 17 and 18, or redundancy 10.
0 references
binary linear codes
0 references
normal codes
0 references
covering radius
0 references
least covering radius
0 references
0.8516281247138977
0 references
0.8153091073036194
0 references
0.8142082095146179
0 references
0.8136751055717468
0 references
0.8025106191635132
0 references