New lower bounds on q-ary error-correcting codes

Antti Laaksonen; Patric R.J. Östergård

doi:10.1007/s12095-018-0302-9

New lower bounds on q-ary error-correcting codes

Antti Laaksonen^*
, Patric R.J. Östergård

^*Tämän työn vastaava kirjoittaja

Information Theory

Tutkimustuotos: Lehtiartikkeli › Article › Scientific › vertaisarvioitu

1 Sitaatiot (Scopus)

465 Lataukset (Pure)

Abstrakti

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 ∈ {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.

Alkuperäiskieli	Englanti
Sivut	881-889
Sivumäärä	9
Julkaisu	Cryptography and Communications
Vuosikerta	11
Numero	5
DOI - pysyväislinkit	https://doi.org/10.1007/s12095-018-0302-9
Tila	Julkaistu - 15 syysk. 2019
OKM-julkaisutyyppi	A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä

Pääsy asiakirjaan

10.1007/s12095-018-0302-9

ELEC_Laaksonen_New_lower_CryComAccepted author manuscript, 135 KB

Muut tiedostot ja linkit

Link to publication in Scopus

1 Päättynyt

Konstruktion och klassificering av diskreta matematiska strukturer
Östergård, P. (Vastuullinen johtaja), Ganzhinov, M. (Projektin jäsen), Szollosi, F. (Projektin jäsen), Heinlein, D. (Projektin jäsen), Kokkala, J. (Projektin jäsen), Pöllänen, A. (Projektin jäsen), Laaksonen, A. (Projektin jäsen) & Paavola, W. (Projektin jäsen)
01/09/2015 → 31/08/2019
Projekti: Academy of Finland: Other research funding

Siteeraa tätä

@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 = sep,

day = "15",

doi = "10.1007/s12095-018-0302-9",

language = "English",

volume = "11",

pages = "881--889",

journal = "Cryptography and Communications",

issn = "1936-2447",

publisher = "Springer",

number = "5",

}

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 - https://www.scopus.com/pages/publications/85070436923

U2 - 10.1007/s12095-018-0302-9

DO - 10.1007/s12095-018-0302-9

M3 - Article

AN - SCOPUS:85070436923

SN - 1936-2447

VL - 11

SP - 881

EP - 889

JO - Cryptography and Communications

JF - Cryptography and Communications

IS - 5

ER -

New lower bounds on q-ary error-correcting codes

Abstrakti

Pääsy asiakirjaan

Muut tiedostot ja linkit

Sormenjälki

Projektit

Konstruktion och klassificering av diskreta matematiska strukturer

Siteeraa tätä