New lower bounds on q-ary error-correcting codes
Loading...
Access rights
openAccess
acceptedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Date
Major/Subject
Mcode
Degree programme
Language
en
Pages
9
Series
Cryptography and Communications, Volume 11, issue 5, pp. 881-889
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.Description
Other note
Citation
Laaksonen, A & Östergård, P R J 2019, 'New lower bounds on q-ary error-correcting codes', Cryptography and Communications, vol. 11, no. 5, pp. 881-889. https://doi.org/10.1007/s12095-018-0302-9