On the covering radius of cyclic linear codes and arithmetic codes (Q1065761)
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: On the covering radius of cyclic linear codes and arithmetic codes |
scientific article; zbMATH DE number 3922531
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the covering radius of cyclic linear codes and arithmetic codes |
scientific article; zbMATH DE number 3922531 |
Statements
On the covering radius of cyclic linear codes and arithmetic codes (English)
0 references
1985
0 references
It is shown that the problem of finding the covering radius of a binary cyclic code with irreducible generator polynomial is equivalent to Waring's problem in \(GF(2^ m)\). An upper bound for the covering radius of some binary codes together with similar results for arithmetic codes is also given.
0 references
finite field
0 references
cyclotomic numbers
0 references
BCH codes
0 references
minimum distance
0 references
covering radius
0 references
binary cyclic code
0 references
irreducible generator polynomial
0 references
binary codes
0 references
0 references
0.8841593265533447
0 references
0.8475086092948914
0 references
0.8395505547523499
0 references
0.8254724144935608
0 references
