New linear codes over $GF(3)$, $GF(11)$, and $GF(13)$
DOI:
https://doi.org/10.13069/jacodesmath.508968Keywords:
Best known codes, Constacyclic codes, Quasi-cyclic codes, Quasi-twisted codesAbstract
Explicit construction of linear codes with best possible parameters is one of the major and challenging problems in coding theory. Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, are known to contain many codes with best known parameters. Despite the fact that these classes of codes have been extensively searched, we have been able to refine existing search algorithms to discover many new linear codes over the alphabets $\mathbb{F}_{3}$, $\mathbb{F}_{11}$, and $\mathbb{F}_{13}$ with better parameters. A total of 38 new linear codes over the three alphabets are presented.
Received: 21 November 2017 Accepted: 11 December 2018Downloads
References
R. Ackerman and N. Aydin, New quinary linear codes from quasi–twisted codes and their duals, Appl. Math. Lett. 24(4) (2011) 512–515.
N. Aydin, N. Connolly, and J. Murphree, New binary linear codes from quasi–cyclic codes and an augmentation algorithm, Appl. Algebra Engrg. Comm. Comput. 28(4) (2017) 339–350.
N. Aydin, N. Connolly, and M. Grassl, Some results on the structure of constacyclic codes and new linear codes over $GF(7)$ from quasi–twisted codes, Adv. Math. Commun. 11(1) (2017) 245–258.
N. Aydin, J. Lambrinos, and O. VandenBerg, On equivalence of cyclic codes, generalization of a quasi–twisted search algorithm, and new linear codes, Des. Codes Cryptogr. 87(9) (2019) 2199–2212.
N. Aydin and J. M. Murphree, New linear codes from constacyclic codes, J. Franklin Inst. 351(3) (2014) 1691–1699.
N. Aydin, I. Siap, and D. K. Ray-Chaudhuri, The structure of 1–generator quasi–twisted codes and new linear codes, Des. Codes Cryptogr. 24(3) (2001) 313–326.
N. Aydin and I. Siap, New quasi–cyclic codes over $\mathbb{F}_5$, Appl. Math. Lett. 15(7) (2002) 833–836.
W. Bosma, J. J. Cannon, and C. Playoust, The Magma algebra system I: The user language, J. Symbolic Comput. 24(3–4) (1997) 235–265.
E. Z. Chen and N. Aydin, A database of linear codes over $\mathbb{F}_{13}$ with minimum distance bounds and new quasi–twisted codes from a heuristic search algorithm, J. Algebra Comb. Discrete Struct. Appl. 2(1) (2015) 1–16.
E. Z. Chen and N. Aydin, New quasi-twisted codes over $\mathbb{F}_{11}$ – minimum distance bounds and a new database, J. Inf. Optim. Sci. 36(1–2) (2015) 129–157.
E. Z. Chen, Six new binary quasi–cyclic codes, IEEE Trans. Inform. Theory 40(5) (1994) 1666–1667.
R. Daskalov and P. Hristov, New binary one–generator quasi–cyclic codes, IEEE Trans. Inform. Theory 49(11) (2003) 3001–3005.
R. Daskalov, P. Hristov, and E. Metodieva, New minimum distance bounds for linear codes over $GF(5)$, Discrete Math. 275(1–3) (2004) 97–110.
M. Grassl, Code Tables: Bounds on the minimum distance of linear codes and quantum codes, online, http://www.codetables.de/.
T. A. Gulliver and V. K. Bhargava, New good rate $(m - 1)/p^m$ ternary and quaternary quasi–cyclic codes, Des. Codes Cryptogr. 7(3) (1996) 223–233.
I. Siap, N. Aydin, and D. K. Ray–Chaudhuri, New ternary quasi–cyclic codes with better minimum distances, IEEE Trans. Inform. Theory 46(4) (2000) 1554–1558.
A. Vardy, The intractability of computing the minimum distance of a code, IEEE Trans. Inform. Theory 43(6) (1997) 1757–1766.
