New Lower Bounds on Error-Correcting Ternary, Quaternary and Quinary Codes

摘要

Let A_q(n,d) denote the maximum size of a q-ary code with size n and minimum distance d. For most values of n and d, only lower and upper bounds on A_q(n,d) axe known. In this paper we present 19 new lower bounds where q ∈ {3,4, 5}. The bounds are based on codes whose automorphisms are prescribed by transitive permutation groups. An exhaustive computer search was carried out to find the new codes.