New lower bounds on q-ary error-correcting codes

Tutkimustuotos: Lehtiartikkeli

Tutkijat

Organisaatiot

Kuvaus

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.

Yksityiskohdat

AlkuperäiskieliEnglanti
Sivut881-889
Sivumäärä9
JulkaisuCRYPTOGRAPHY AND COMMUNICATIONS
Vuosikerta11
Numero5
TilaJulkaistu - 15 syyskuuta 2019
OKM-julkaisutyyppiA1 Julkaistu artikkeli, soviteltu

ID: 36163392