New lower bounds on q-ary error-correcting codes

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

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

145 Downloads (Pure)


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.

Original languageEnglish
Pages (from-to)881-889
Number of pages9
JournalCryptography and Communications
Issue number5
Publication statusPublished - 15 Sept 2019
MoE publication typeA1 Journal article-refereed


  • Automorphism groups
  • Bounds on codes
  • Error-correcting codes
  • Transitive groups


Dive into the research topics of 'New lower bounds on q-ary error-correcting codes'. Together they form a unique fingerprint.

Cite this