Generating generalized necklaces and new quasi-cyclic codes
DOI:
https://doi.org/10.13069/jacodesmath.784999Keywords:
Finite field, Quasi-cyclic linear codes, NecklacesAbstract
In many cases there is a need of exhaustive lists of combinatorial objects of a given type. We consider generation of all inequivalent polynomials from which defining polynomials for constructing quasi-cyclic (QC) codes are to be chosen. Using these defining polynomials we construct 34 new good QC codes over GF(11) and 36 such codes over GF(13).
Received: 23 May 2019 | Accepted: 25 March 2020Downloads
References
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.
N. Aydin and J. Murphree, New linear codes from constacyclic codes, J. Franklin Inst. 351(3) (2014) 1691–1699.
N. Aydin, N. Connolly, and M. Grassl, Some results on the structure of constacyclic codes and new linear codes over $GF(7)$ from QT codes, Adv. Math. Commun. 11(1) (2017) 245–258.
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, 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(10) (2019) 2199–2212.
N. Aydin and D. Foret, New linear codes over $GF(3)$, $GF(11)$, and $GF(13)$, J. Algebra Comb. Discrete Struct. Appl. 6(1) (2019) 13–20.
S. Ball, Table of bounds on three dimensional linear codes or $(n,r)$ Arcs in $PG(2, q)$, available online at https://web.mat.upc.edu/simeon.michael.ball/codebounds.html.
E. Z. Chen, Database of Quasi-twisted codes, available online at http://www.tec.hkr.se/~chen/research/codes/.
E. Z. Chen, A new iterative computer search algorithm for good quasi-twisted codes, Des. Codes Cryptogr. 76(2) (2015) 307–323.
E. Z. Chen, Some new binary linear codes with improved minimum distances, J. Algebra Comb. Discrete Struct. Appl. 5(2) (2018) 65–70.
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 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.
R. Daskalov and E. Metodieva, The nonexistence of some $5$-dimensional quaternary linear codes, IEEE Trans. Inform. Theory 41(2) (1995) 581–583.
R. N. Daskalov and T. A. Gulliver, New good quasi-cyclic ternary and quaternary linear codes, IEEE Trans. Inform. Theory 43(5) (1997) 1647–1650.
R. Daskalov and T. A. Gulliver, Bounds on minimum distance for linear codes over $GF(5)$, Appl. Algebra Engrg. Comm. Comput. 9(6) (1999) 547–558.
R. Daskalov and P. Hristov, New one-generator quasi-cyclic codes over $GF(7)$, Probl. Inf. Transm. 38(1) (2002) 50–54.
R. Daskalov and P. Hristov, Some new quasi-twisted ternary linear codes, J. Algebra Comb. Discrete Struct. Appl. 2(3) (2016) 211–216.
R. Daskalov and P. Hristov, Some new ternary linear codes, J. Algebra Comb. Discrete Struct. Appl. 4(3) (2017) 227–234.
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.
R. Daskalov and E. Metodieva, The nonexistence of ternary $[105,6,68]$ and $[230,6,152]$ codes, Discrete Math. 286(3) (2004) 225–232.
H. Fredricksen and J. Maiorana, Necklaces of beads in $k$ colors and $k$-ary de Bruijn sequences, Discrete Math. 23(3) (1978) 207–210.
H. Fredricksen and I. J. Kessler, An algorithm for generating necklaces of beads in two colors, Discrete Math. 61(2-3) (1986) 181–188.
P. P. Greenough and R. Hill, Optimal ternary quasi-cyclic codes, Des. Codes Cryptogr. 2(1) (1992) 81–91.
T. A. Gulliver, Quasi-twisted codes over $\mathbb{F}_{11}$, Ars Combin. 99 (2011) 3–17.
T. A. Gulliver, Quasi-cyclic codes over $\mathbb{F}_{13}$, in: Combinatorial Algorithms, Lecture Notes in Comput. Sci., vol. 7056, Springer, Heidelberg (2011) 236–246.
T. A. Gulliver and P. R. J. Östergård, Improved bounds for ternary linear codes of dimension $7$, IEEE Trans. Inform. Theory 43(5) (1997) 1377–1388.
M. Grassl, Bounds on the minimum distances of linear codes, available online at http://www.codetables.de.
F. Ruskey, C. Savage, and T. M. Y. Wang, Generating necklaces, J. Algorithms 13(3) (1992) 414–430.
A. Vardy, The intractability of computing the minimum distance of a code, IEEE Trans. Inform. Theory 43(6) (1997) 1757–1766.
V. Ch. Venkaiah and T. A. Gulliver, Quasi-cyclic codes over $\mathbb{F}_{13}$ and enumeration of defining polynomials, J. Discrete Algorithms 16 (2012) 249–257.
T. A. Gulliver and V. Ch. Venkaiah, Construction of quasi-twisted codes and enumeration of defining polynomials, J. Algebra Comb. Discrete Appl. 7(1) (2020) 3–20.
