New lower bounds on q-ary error-correcting codes

Research output: Contribution to journalArticleScientificpeer-review

Standard

New lower bounds on q-ary error-correcting codes. / Laaksonen, Antti; Östergård, Patric R.J.

In: CRYPTOGRAPHY AND COMMUNICATIONS, Vol. 11, No. 5, 15.09.2019, p. 881-889.

Research output: Contribution to journalArticleScientificpeer-review

Harvard

APA

Vancouver

Author

Bibtex - Download

@article{bee670e4539a45c68612e0990a24065f,
title = "New lower bounds on q-ary error-correcting codes",
abstract = "Let Aq (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 Aq (n, d) are known. In this paper new lower bounds on and updated tables of Aq (n, d) for q ∈ {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.",
keywords = "Automorphism groups, Bounds on codes, Error-correcting codes, Transitive groups",
author = "Antti Laaksonen and {\"O}sterg{\aa}rd, {Patric R.J.}",
year = "2019",
month = "9",
day = "15",
doi = "10.1007/s12095-018-0302-9",
language = "English",
volume = "11",
pages = "881--889",
journal = "CRYPTOGRAPHY AND COMMUNICATIONS",
issn = "1936-2447",
number = "5",

}

RIS - Download

TY - JOUR

T1 - New lower bounds on q-ary error-correcting codes

AU - Laaksonen, Antti

AU - Östergård, Patric R.J.

PY - 2019/9/15

Y1 - 2019/9/15

N2 - Let Aq (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 Aq (n, d) are known. In this paper new lower bounds on and updated tables of Aq (n, d) for q ∈ {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.

AB - Let Aq (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 Aq (n, d) are known. In this paper new lower bounds on and updated tables of Aq (n, d) for q ∈ {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.

KW - Automorphism groups

KW - Bounds on codes

KW - Error-correcting codes

KW - Transitive groups

UR - http://www.scopus.com/inward/record.url?scp=85070436923&partnerID=8YFLogxK

U2 - 10.1007/s12095-018-0302-9

DO - 10.1007/s12095-018-0302-9

M3 - Article

VL - 11

SP - 881

EP - 889

JO - CRYPTOGRAPHY AND COMMUNICATIONS

JF - CRYPTOGRAPHY AND COMMUNICATIONS

SN - 1936-2447

IS - 5

ER -

ID: 36163392