Korean J. Math. Vol. 32 No. 3 (2024) pp.485-496
DOI: https://doi.org/10.11568/kjm.2024.32.3.485

Quasi-cyclic self-dual codes with four factors

Main Article Content

Hyun Jin Kim
Whanhyuk Choi
Jung Kyung Lee

Abstract

In this study, we examine $\ell$-quasi-cyclic self-dual codes of length $\ell m$ over $\mathbb{F}_2$, provided that the polynomial $X^m-1$ has exactly four distinct irreducible factors in $\mathbb{F}_2[X]$. We find the standard form of generator matrices of codes over the ring $R \cong \mathbb{F}_q[X]/(X^m-1)$ and the conditions for the codes to be self-dual. We explicitly determine the forms of generator matrices of self-dual codes of lengths $2$ and $4$ over $R$.



Article Details

Supporting Agencies

National Research Foundation of Korea (NRF) and Kangwon National University

References

[1] E. F. Assmus and J. D. Key, Designs and Their Codes, Cambridge: Cambridge University Press, 1992. Google Scholar

[2] I. Bouyukliev, D. Bikov and S. Bouyuklieva, S-Boxes from binary quasi-cyclic codes, Electronic Notes in Discrete Mathematics 57 (2017), 67–72. https://doi.org/10.1016/j.endm.2017.02.012 Google Scholar

[3] J. H. Conway and N. J. A. Sloane, Sphere Packing, Lattices and Groups, 3rd ed., New York: Springer-Verlag, 1999. Google Scholar

[4] W. Ebeling, Lattices and Codes: A Course Partially Based on Lectures by F. Hirzebruch, Advanced Lectures in Mathematics, Braunschweig: Vieweg, 1994. Google Scholar

[5] M. Esmaeili, T. A. Gulliver, N. P. Secord and S. A. Mahmoud, A link between quasi-cyclic codes and convolution codes, IEEE Transactions on Information Theory 44 (1998), 431–435. https://doi.org/10.1109/18.651076 Google Scholar

[6] S. Han, J. L. Kim, H. Lee and Y. Lee, Construction of quasi-cyclic self-dual codes, Finite Fields and Their Applications 18 (2012), 612–633. https://doi.org/10.1016/j.ffa.2011.12.006 Google Scholar

[7] W. C. Huffman, Automorphisms of codes with applications to extremal doubly even codes of length 48, IEEE Transactions on Information Theory 28 (1982), 511–521. https://doi.org/10.1109/TIT.1982.1056499 Google Scholar

[8] T. Kasami, A Gilbert–Varshamov bound for quasi-cyclic codes of rate 1/2, IEEE Transactions on Information Theory 20 (1974), 679. https://doi.org/10.1109/TIT.1974.1055262 Google Scholar

[9] H. J. Kim and Y. Lee, Extremal quasi-cyclic self-dual codes over finite fields, Finite Fields and Their Applications 52 (2018), 301–318. https://doi.org/10.1016/j.ffa.2018.04.013 Google Scholar

[10] S. Ling and P. Sole, On the algebraic structure of quasi-cyclic codes I: finite fields, IEEE Transactions on Information Theory 47 (2001), 2751–2760. https://doi.org/10.1109/18.959257 Google Scholar

[11] S. Ling and P. Sole, On the algebraic structure of quasi-cyclic codes II: chain rings, Designs, Codes and Cryptography 30 (2003), 113–130. https://doi.org/10.1023/A:1024715527805 Google Scholar

[12] S. Ling and P. Sole, On the algebraic structure of quasi-cyclic codes III: generator theory, IEEE Transactions on Information Theory 51 (2005), 2692–2700. https://doi.org/10.1109/TIT.2005.850142 Google Scholar

[13] G. Nebe, E. M. Rains and N. J. A. Sloane, Self-Dual Codes and Invariant Theory, Berlin: Springer, 2006. Google Scholar

[14] V. Yorgov, Binary self-dual codes with automorphism of odd order, Problems of Information Transmission 19 (1983), 260–270. Google Scholar

[15] W. Bosma, J. Cannon and C. Playoust, The Magma algebra system I: the user language, Journal of Symbolic Computation 24 (1997), 235–265. Google Scholar