New Results and bounds on codes over $GF(19)$
DOI:
https://doi.org/10.13069/jacodesmath.v12i3.361Keywords:
Quasi-cyclic codes, Best-known codes, Optimal codes, $GF(19)$Abstract
Explicit construction of linear codes over finite fields is one of the most important and challenging problems in coding theory. Due to the centrality of this problem, databases of best-known linear codes (BKLCs) over small finite fields have been available. Recently, new databases for BKLCs over larger alphabets have been introduced. In this work, a new database of BKLCs over the field $GF(19)$ is introduced, containing lower and upper bounds on the minimum distances for codes with lengths up to 150 and dimensions between 3 and 6. Computer searches were conducted on cyclic, constacyclic, quasi-cyclic, and quasi-twisted codes to establish lower bounds. These searches resulted in many new linear codes over $GF(19)$.
Accepted: 23 February 2025
Downloads
References
D. Akre, N. Aydin, M. Harrington, S. Pandey, New Binary and Ternary Quasi-Cyclic Codes with Good Properties, J. Comput. Appl. Math. 42(2) (2023) 102.
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.
N. Aydin, J. Murphree, New linear codes from constacyclic codes, J. Franklin Inst. 35(3) (2014) 1691–1699.
N. Aydin, J. Lambrinos, O. VanderBerg, On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes, Des. Codes Cryptogr. 87 (2019) 2199–2212.
S. Ball, Table of bounds on three dimensional linear codes or (n,r)-arcs in PG(2,q), 30 March 2024.
E. R. Berlekamp, Algebraic coding theory, Aegean Park Press, Walnut Creek (1984).
K. Betsumiya, S. Georgiou, T. A. Gulliver, M. Harada, C. Koukouvinos, On self-dual codes over some prime fields, Discrete Math. 262(1) (2003) 37–58.
W. Bosma, J. Cannon, C. Playoust, The Magma Algebra System I: The User Language, J. Symb. Comput. 24(3) (1997) 235–265.
E. Z. Chen, Six new binary quasi-cyclic codes, IEEE Trans. Inf. Theory 40(5) (1994) 1666–1667.
E. Z. Chen, A new iterative computer search algorithm for good quasi-twisted codes, Des. Codes Cryptogr. 76(2) (2015) 1–17.
E. Z. Chen, Online Database of Quasi-Twisted Codes, 30 March 2024.
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, J. Algebra Combin. Discrete Struct. Appl. 2(1) (2015) 1–16.
E. Z. Chen, N. Aydin, New quasi-twisted codes over F11—minimum distance bounds and a new database, J. Inform. Optim. Sci. 36 (2015) 129–157.
E. Z. Chen, N. Aydin, F. Jönsson, K. Klonowska, New results and bounds on codes over GF(17), J. Algebra Combin. Discrete Struct. Appl. 11(1) (2023) 27–39.
J. Chen, K. W. Shum, Q. Yu, C. W. Sung, Sector-disk codes and partial MDS codes with up to three global parities, IEEE Int. Symp. Inf. Theory Proc. (ISIT) (2015) 1876–1880.
W. H. Choi, J. L. Kim, An Improved Upper Bound on Self-dual Codes Over Finite Fields GF(11), GF(19), and GF(23), Des. Codes Cryptogr. 90(11) (2022) 2735–2751.
R. Daskalov, E. Metodieva, New (k,r)-arcs in PG(2,17) and the related optimal linear codes, Math. Balkanica 18 (2004) 121–127.
R. Daskalov, E. Metodieva, New (n,r)-arcs in PG(2,17), PG(2,19), and PG(2,23), Probl. Inf. Transm. 47 (2011) 217–223.
R. N. Daskalov, T. A. Gulliver, E. Metodieva, New good quasi-cyclic ternary and quaternary linear codes, IEEE Trans. Inf. Theory 43 (1997) 1647–1650.
R. N. Daskalov, T. A. Gulliver, E. Metodieva, New ternary linear codes, IEEE Trans. Inf. Theory 45 (1999) 1687–1688.
M. Grassl, Bounds on the minimum distance of linear codes and quantum codes, 30 March 2024.
T. A. Gulliver, V. K. Bhargava, Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes, IEEE Trans. Inf. Theory 37(3) (1991) 552–555.
T. A. Gulliver, P. R. J. Östergård, Improved bounds for ternary linear codes of dimension 7, IEEE Trans. Inf. Theory 43 (1997) 1377–1388.
T. A. Gulliver, V. C. Venkaiah, Construction of quasi-twisted codes and enumeration of defining polynomials, Algebra Combin. Discrete Struct. Appl. 7(1) (2019) 3–20.
R. Hill, Optimal linear codes, Cryptography and Coding II, edited by C. Mitchell, Oxford University Press (1991) 75–104.
I. S. Kotsireas, C. Koukouvinos, D. E. Simos, MDS and near-MDS self-dual codes over large prime fields, Adv. Math. Commun. 3(4) (2009) 349–361.
F. MacWilliams, N. Sloane, The Theory of Error-Correcting Codes, 2nd ed., North-Holland Publishing Company (1978).
A. Vardy, The intractability of computing the minimum distance of a code, IEEE Trans. Inf. Theory 43(6) (1997) 1757–1766.
