Abstract
A method for constructing binary self-dual codes having an automorphism of order p 2 for an odd prime p is presented in (S. Bouyuklieva et al. IEEE. Trans. Inform. Theory, 51, 3678–3686, 2005). Using this method, we investigate the optimal self-dual codes of lengths 60 ≤ n ≤ 66 having an automorphism of order 9 with six 9-cycles, t cycles of length 3 and f fixed points. We classify all self-dual [60,30,12] and [62,31,12] codes possessing such an automorphism, and we construct many doubly-even [64,32,12] and singly-even [66,33,12] codes. Some of the constructed codes of lengths 62 and 66 are with weight enumerators for which the existence of codes was not known until now.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bouyukliev I.: An algorithm for finding isomorphisms of codes. In: Proceedings of Third Workshop OCRT’2001, pp. 35–40. Sunny Beach, Bulgaria (2001).
Bouyuklieva S., Russeva R., Yankov N. (2005). Binary self-dual codes having an automorphism of order p 2. Mathematica Balkanica, New Series 19, 25–31
Bouyuklieva S., Russeva R., Yankov N. (2005). On the structure of binary self-dual codes having an automorphism of order a square of an odd prime. IEEE Trans. Inform. Theory 51, 3678–3686
Conway J.H., Sloane N.J.A. (1990). A new upper bound on the minimal distance of self-dual codes. IEEE Trans. Inform. Theory 36, 1319–1333
Dontcheva R.A., Harada M. (2002). New extremal self-dual codes of length 62 and related extremal self-dual codes. IEEE Trans. Inform. Theory 48, 2060–2064
Dontcheva R.A., van Zanten A.J., Dodunekov S.M. (2004). Binary self-dual codes with automorphisms of composite order. IEEE Trans. Inform. Theory 50, 311–318
Dougherty S.T., Gulliver T.A., Harada M. (1997). Extremal binary self-dual codes. IEEE Trans. Inform. Theory 43, 2036–2047
Gulliver T.A., Harada M. (1996). Weight enumerators of extremal singly-even [60,30,12] codes. IEEE Trans. Inform. Theory 42, 658–659
Gulliver T.A., Harada M. (1998). Classification of extremal double circulant self-dual codes of lengths 64 to 72. Des. Codes Cryptogr. 13, 257–269
Harada M. (1999). Construction of an extremal self-dual codes of length 62. IEEE Trans. Inform. Theory 45, 1232–1233
Harada M., Gulliver T.A., Kaneta H. (1998). Classification of extremal double circulant self-dual codes of length up to 62. Discrete Math. 188, 127–136
Harada M., Nishimura T., Yorgova R. (2007). New extremal self-dual codes of length 66. Mathematika Balkanica 21, 113–121
Huffman W.C. (1982). Automorphisms of codes with application to extremal doubly-even codes of length 48. IEEE Trans. Inform. Theory 28, 511–521
Huffman W.C. (2005). On the classification and enumeration of self-dual codes. Finite Fields and Their Applications 11, 451–490
Ling S., Sole P. (2001). On the algebraic structure of quasi-cyclic codes I: Finite fields. IEEE Trans. Inform. Theory 47, 2751–2760
Tsai H.P. (1992). Existence of certain extremal self-dual codes. IEEE Trans. Inform. Theory 38, 501–504
Tsai H.P. (1999). Extremal self-dual codes of length 66 and 68. IEEE Trans. Inform. Theory 45, 2129–2133
Tsai H.P., Shih P.Y., Su W.K., Chen C.H.: Cosets of Self-Dual Codes. Des. Codes Cryptogr. (Submitted).
Yorgov V.Y. (1987). A method for constructing inequivalent self-dual codes with applications to length 56. IEEE Trans. Inform. Theory 33, 77–82
Yorgov V.Y. (1983). Binary self-dual codes with an automorphism of odd order. Problems Inform.Transm. 4, 13–24 (in Russian)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Q. Xiang.
Rights and permissions
About this article
Cite this article
Russeva, R., Yankov, N. On binary self-dual codes of lengths 60, 62, 64 and 66 having an automorphism of order 9. Des. Codes Cryptogr. 45, 335–346 (2007). https://doi.org/10.1007/s10623-007-9127-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-007-9127-9