Constructing covering codes with given automorphisms (Q1283221)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1275104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing covering codes with given automorphisms |
scientific article; zbMATH DE number 1275104 |
Statements
Constructing covering codes with given automorphisms (English)
0 references
17 December 1999
0 references
The authors consider the problem of finding upper bounds on \(K(n,r)\), the minimum number of words in a binary code of length \(n\) and covering radius \(r\). Constructions of covering codes give these bounds on \(K(n,r)\). It is shown how computer searches for covering codes can be speed up by requiring that the code has a given (not necessarily full) automorphism group. The optimization method used is tabu search. A new code is presented which proves a new record \(K(13,1)\leq 704\). This code has a very large full automorphism group and several other interesting properties.
0 references
upper bounds
0 references
binary code
0 references
covering radius
0 references
covering codes
0 references
automorphism group
0 references
tabu search
0 references
0.99384475
0 references
0.8915491
0 references
0.89005256
0 references
0 references
0.88717604
0 references
0.8825867
0 references
0.88054454
0 references
0.8797123
0 references
