Self-dual double cyclic codes over $\mathbb{Z}_2$

Subject Areas : Combinatorics, Graph theory

H. Movahedi ¹ , L. Pourfaraj ²

1 - Department of Mathematics, Faculty of Science, Central Tehran Branch, Islamic Azad University, Tehran, Iran
2 - Department of Mathematics, Faculty of Science, Central Tehran Branch, Islamic Azad University, Tehran, Iran

Received: 2021-08-23 Accepted : 2021-11-09 Published : 2021-12-14

Keywords: Canonical projections, double cyclic codes, self-dual codes, shadow codes,

Abstract :

A double cyclic code (or \emph{DC code}) of length $n=k+l$ over $\mathbb{Z}_2$ is a binary linear code, where any cyclic shift of the first $k$ coordinates and the last $l$ coordinates of a codeword is also a codeword. In this paper, we study the relationship between separability and self-duality of these codes. Also, we obtain the shadow code by determining the generator polynomials of the doubly even subcode of the self-dual code.

References:

[1] T. Abualrub, I. Siap, N. Aydin, Z₂Z₄−additive cyclic codes, IEEE Trans. Inform. Theory. 60 (2014), 1508-1514.

[2] E. Bannai, ST. Dougherty, M. Harada, M. Oura, Type II codes, even unimodular lattices and invariant rings, IEEE Trans. Inform. Theory. 45 (1999), 1194-1205.

[3] J. Borges, C. Fernandez-Córdoba, R. Ten-Valls, Z2Z4−additive cyclic codes, generator polynomials and dual codes, IEEE Trans. Inform. Theory. 62 (2016), 6348-6354.

[4] J. Borges, C. Fernández-Córdoba, R. Ten-Valls, Z₂−double cyclic codes, Des. Codes Cryptogr. 86 (2018), 463-479.

[5] B. Heijne, J. Top, On the minimal distance of binary self-dual cyclic codes, IEEE Trans. Inform. Theory. 55 (2009), 4860-4863.

[6] E. M. Rains, Shadow bounds for self-dual codes, IEEE Trans. Inform. Theory. 44 (1998), 134-139.

[7] N. J. A. Sloane, J. G. Thompson, Cyclic self-dual codes, IEEE Trans. Inform. Theory. 29 (1983), 364-366.