Minimum distance bounds for linear codes over GF(11)
DOI:
https://doi.org/10.13069/jacodesmath.v13i1.368Keywords:
Linear codes, Quasi-cyclic codes, Minimum distance boundsAbstract
Let $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $d$ over $GF(q)$. One of the most important problems in coding theory is to construct codes with best possible minimum distances. In this paper 36 new cyclic and quasi-cyclic (QC) codes over GF(11) are presented and the table from [4] is enlarged by adding three new dimensions.
Accepted: 20 September 2025
Downloads
References
N. Aydin, I. Siap, D. K. Ray-Chaudhuri, The structure of 1-generator quasi-twisted codes and new linear codes, Des. Codes Cryptogr. 24 (2001) 313–326.
E. Z. Chen, Online database of quasi-twisted codes.
E. Z. Chen, A new iterative computer search algorithm for good quasi-twisted codes, Des. Codes Cryptogr. (2014).
E. Z. Chen, N. Aydin, New quasi-twisted codes over F11 - minimum distance bounds and a new database, Journal of Information and Optimization Sciences 36(1–2) (2015) 129–157.
E. Z. Chen, N. Aydin, A database of linear codes over F13 with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm, Journal of Algebra Combinatorics Discrete Structures and Applications 2(1) (2015) 1–16.
E. Z. Chen, N. Aydin, F. Jönsson, K. Klonowska, New results and bounds on codes over F17, Journal of Algebra Combinatorics Discrete Structures and Applications 11(1) (2024) 27–39.
R. Daskalov, P. Hristov, New One-Generator Quasi-Cyclic Codes over GF(7), Problemi Peredachi Informatsii 38(1) (2002) 59–63. English translation: Problems of Information Transmission 38(1) (2002) 50–54.
R. Daskalov, P. Hristov, E. Metodieva, New minimum distance bounds for linear codes over GF(5), Discrete Mathematics 275(1–3) (2004) 97–110.
R. Daskalov, P. Hristov, Some new quasi-twisted ternary linear codes, Journal of Algebra Combinatorics Discrete Structures and Applications 2(3) (2016) 211–216.
R. Daskalov, P. Hristov, Some new ternary linear codes, Journal of Algebra Combinatorics Discrete Structures and Applications 4(3) (2017) 227–234.
R. Daskalov, E. Metodieva, Generating generalized necklaces and new quasi-cyclic codes, Journal of Algebra Combinatorics Discrete Structures and Applications 7(3) (2020) 237–245.
S. Dougherty, J. Kim, P. Solé, Open problems in coding theory, Contemporary Mathematics 634 (2015).
M. Grassl, Bounds on the minimum distance of linear codes [electronic table; online].
P. P. Greenough, R. Hill, Optimal ternary quasi-cyclic codes, Des. Codes Cryptogr. 2 (1992) 81–91.
T. A. Gulliver, Quasi-twisted codes over F11, Ars Combinatoria 99 (2011) 3–17.
R. Hill, A first course in coding theory, Oxford Applied Mathematics and Computing Sciences Series, 1992.
F. J. MacWilliams, N. J. A. Sloane, The theory of error-correcting codes, Amsterdam: North-Holland, 1977.
A. Vardy, The intractability of computing the minimum distance of a code, IEEE Trans. Inform. Theory 43 (1997) 1757–1766.
