Results on error-correcting codes

Let Aq(n,d) denote the maximum size of a q-ary code with length n and minimum distance d. We present several new lower bounds on Aq(n,d) where q ∈ {2,3,4,5}.

1. Results on binary codes

Laaksonen, A., Östergård, P. R. J.: Constructing error-correcting binary codes using transitive permutation groups. Discrete Applied Mathematics 233, 65–70 (2017)

Download the codes

2. Results on ternary, quaternary and quinary codes

Laaksonen, A., Östergård, P. R. J.: New lower bounds on error-correcting ternary, quaternary and quinary codes. In: Proceedings of the 5th International Castle Meeting on Coding Theory and Applications, 228–237 (2017)

Download the codes

Additional (unpublished) results on quinary codes:

Download the codes