Name
Abstract | ||
|---|---|---|
Let A(q) (n, d) denote the maximum size of a q-ary code with length n and minimum distance d. For most values of n and d, only lower and upper bounds on A(q) (n, d) are known. In this paper new lower bounds on and updated tables of A(q) (n, d) for q is an element of {3, 4, 5} are presented. The new bounds are obtained through an extensive computer search for codes with prescribed groups of automorphisms. Groups that act transitively on the (coordinate,value) pairs as well as groups with certain other closely related actions are considered. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s12095-018-0302-9 | CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES |
Keywords | Field | DocType |
Automorphism groups,Bounds on codes,Error-correcting codes,Transitive groups | Discrete mathematics,Combinatorics,Automorphism,Computer search,Mathematics | Journal |
Volume | Issue | ISSN |
11.0 | 5 | 1936-2447 |
Citations | PageRank | References |
0 | 0.34 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Antti Laaksonen | 1 | 3 | 1.76 |
| Patric R. J. Östergård | 2 | 609 | 70.61 |