WorksMathematics
Determination of weight enumerators of binary extremal self-dual codes of length 60
Abstract
We construct three binary extremal self-dual codes of length with weight enumerators for which no binary extremal self-dual codes of length were previously known to exist. This completes the determination of the weight enumerators that occur for binary extremal self-dual codes of length .
Introduction
Self-dual codes are one of the most interesting classes of codes. This interest is justified by many combinatorial objects and algebraic objects related to self-dual codes (see, e.g., [6] and [18]).
Binary self-dual codes are divided into two classes. A binary self-dual code is doubly even if the weights of all codewords of are multiples of 4, and singly even if there is at least one codeword of weight . For a positive integer , a binary self-dual code of length exists if and only if is even, and a doubly even self-dual code of length exists if and only if . Shadows for binary self-dual codes were introduced by Conway and Sloane [5] to derive upper bounds on the minimum weight and restrictions on the weight enumerators of binary singly even self-dual codes. They also gave the largest possible minimum weights and the corresponding possible weight enumerators for lengths up to 64 and length 72 (see [5 Table I] for the minimum weights and see also [10] for the weight enumerators at length 60). Subsequently, using shadows, Rains [17] improved the general upper bound on the minimum weight. He showed that the minimum weight of a binary self-dual code of length satisfies , unless , in which case . A binary self-dual code meeting this bound is called extremal.
It is a fundamental problem to determine which of the possible weight enumerators given in [5] actually occur. In this note, we consider this problem for binary extremal self-dual codes of length 60. The length 60 is of particular interest for binary singly even self-dual codes with minimum weight 12. The smallest length for which a binary singly even self-dual code exists is either 56 or 60 [5 Table I]. It is not known whether a binary singly even self-dual code exists. Thus, 60 is currently the smallest length for which binary singly even self-dual codes with minimum weight 12 are known to exist (see § 4 for another reason for our interest in length 60).
The possible weight enumerators of binary extremal self-dual codes of length 60 are known as follows:
where is an integer. A binary extremal self-dual code with weight enumerator was found in [5]. If there exists a binary extremal self-dual code with weight enumerator , then
[12]. For and 10, a binary extremal self-dual code with weight enumerator was found in [20], [3], [11], [21], [11], [7] and [10], respectively (see also [19]).
The main aim of this note is to show the following:
Proposition 1. For each , there exists a binary extremal self-dual code with weight enumerator .
As a consequence, we have the following:
Corollary 2. There exists a binary extremal self-dual code with weight enumerator if and only if .
This completes the determination of the weight enumerators that occur for binary extremal self-dual codes of length 60.
Preliminaries
Let denote the finite field of order , where is a prime power. We take to be , and we take to be , where . An code over is a -dimensional vector subspace of . Codes over and are called binary and quaternary, respectively. The parameter is called the length of . The weight of a vector is the number of nonzero components of . A vector of is called a codeword of . The minimum weight among the nonzero codewords of is called the minimum weight of . An code is an code with minimum weight . The weight enumerator of is given by the polynomial . Two codes and over are equivalent, denoted , if there is an monomial matrix over with , where . The automorphism group of consists of all monomial matrices with .
The dual code of a binary code of length is defined as follows:
where for and . In addition, the Hermitian dual code of a quaternary code of length is defined as follows:
where for and . A binary code is called self-dual if . A quaternary code is called Hermitian self-dual if .
Let be a binary singly even self-dual code. Let denote the subcode of consisting of codewords having weight . The shadow of is defined to be . Shadows for self-dual codes were introduced by Conway and Sloane [5].
Extremal self-dual codes of length 60
In this section, we describe how to construct a binary extremal self-dual code with weight enumerator for , and .
We employ the cubic construction described in [1], [4] and [15]. Our formulation differs from the original construction only in the ordering of coordinates and yields an equivalent code. Let be a binary self-dual code of length 20 and let be a quaternary Hermitian self-dual code of the same length. We define a map from to as follows:
We also define a map from to as follows:
for . We extend coordinatewise to a map from to , also denoted by , by setting
for . Then
is a binary self-dual code of length 60.
The classifications of binary self-dual codes of length 20 and quaternary Hermitian self-dual codes of length 20 were given in [16] and [13], respectively. Namely, there exist 16 inequivalent binary self-dual codes of length 20 and there exist 3427 inequivalent quaternary Hermitian self-dual codes of length 20. Generator matrices of these codes can be obtained electronically from [14]. We denote by and the -th binary self-dual code and the -th quaternary Hermitian self-dual code in [14], respectively. As noted in [1 p. 2254], the cubic construction yields numerous binary self-dual codes of length 60 by varying the constituent codes and coordinate permutations. Among these codes, we found extremal self-dual codes with weight enumerators for , 4 and 8.
We give explicit constructions of these codes. Let denote the symmetric group of degree 20. For and a binary code of length 20, let denote the code obtained from by moving coordinate to position . Define the following binary self-dual codes of length 60:
where
and
We verified by Magma [2] that , and have minimum weight 12 and weight enumerators for and 8, respectively. By [1 Theorem 5.6], the shadow of is obtained by replacing with its shadow in the cubic construction. In searching for these codes, we used this description to guide the choice of constituents and coordinate permutations, seeking minimum weight 12 and exactly shadow vectors of weight 6 simultaneously for . We verified by Magma [2] that the automorphism groups of , and have orders 12, 6 and 3, respectively.
For convenience, we give explicit generator matrices in standard form for codes equivalent to , where . Since in the coordinate ordering used above none of the three codes has a generator matrix in standard form, we apply suitable coordinate permutations. The resulting generator matrices are , where the matrices are listed in Table 1 and denotes the identity matrix of order 30.
| [binary matrix] | [binary matrix] | [binary matrix] |
Table 1. Matrices , and .
Concluding remarks
There is another reason for our interest in length 60. The codes constructed in this note belong to the family of binary singly even self-dual codes whose shadows have minimum weight , where is a positive integer. We consider the weight enumerators that occur for codes in this family.
The general bound of Rains [17] implies that these parameters can occur only for
For such a code, let denote the number of vectors of weight in its shadow. By [12 Lemmas 2 and 3], we have
Moreover, if is odd. Here is excluded since the shadow is required to have minimum weight .
: The weight enumerators that occur were determined (see [5]).
: The values of that occur are exactly and [12].
: The values of that occur are exactly and (see [8], [12] and [21]).
: Together with the previously known codes, Proposition 1 shows that the values of that occur are exactly and .
: If a binary self-dual code exists, then its shadow has minimum weight [9]. Hence, no such code has a shadow of minimum weight .
: It is not known whether a binary singly even self-dual code exists.
: There is no binary self-dual code [8].
: Every binary extremal self-dual code must be doubly even [17]. Hence, there is no binary singly even self-dual code.
Consequently, the weight enumerators that occur in this family have now been determined for every except . It remains to determine which weight enumerators occur for binary extremal singly even self-dual codes whose shadows have minimum weight . In fact, even the existence of a binary extremal singly even self-dual code is not known.
Acknowledgments. This work was supported by JSPS KAKENHI Grant Number 23K25784.
Use of generative AI. The author used OpenAI’s ChatGPT (GPT-6 Astra) to assist in constructing the codes in October 2026. The author independently verified the computational results presented in this note by MAGMA [2].
References
- [1]A. Bonnecaze, A.D. Bracco, S.T. Dougherty, L.R. Nochefranca and P. Solé, Cubic self-dual binary codes, IEEE Trans. Inform. Theory 49 (2003), 2253–2259.DOI
- [2]W. Bosma, J. Cannon and C. Playoust, The Magma algebra system I: The user language, J. Symbolic Comput. 24 (1997), 235–265.DOI
- [3]S. Bouyuklieva, R. Rousseva and N. Yankov, On the structure of binary self-dual codes having an automorphism of order a square of an odd prime, IEEE Trans. Inform. Theory 51 (2005), 3678–3686.DOI
- [4]P. Çomak, J.-L. Kim and F. Özbudak, New cubic self-dual codes of length 54, 60 and 66, Appl. Algebra Engrg. Comm. Comput. 29 (2018), 303–312.arxiv.org/abs/1706.07631
- [5]J.H. Conway and N.J.A. Sloane, A new upper bound on the minimal distance of self-dual codes, IEEE Trans. Inform. Theory 36 (1990), 1319–1333.DOI
- [6]J.H. Conway and N.J.A. Sloane, Sphere Packings, Lattices and Groups (3rd ed.), Springer-Verlag, New York, 1999.
- [7]R. Dontcheva and M. Harada, Some extremal self-dual codes with an automorphism of order 7, Appl. Algebra Engrg. Comm. Comput. 14 (2003), 75–79.DOI
- [8]S.T. Dougherty, T.A. Gulliver and M. Harada, Extremal binary self-dual codes, IEEE Trans. Inform. Theory 43 (1997), 2036–2047.DOI
- [9]S.T. Dougherty and M. Harada, New extremal self-dual codes of length 68, IEEE Trans. Inform. Theory 45 (1999), 2133–2136.DOI
- [10]T.A. Gulliver and M. Harada, Weight enumerators of extremal singly-even [60, 30, 12] codes, IEEE Trans. Inform. Theory 42 (1996), 658–659.DOI
- [11]M. Harada, Binary extremal self-dual codes of length 60 and related codes, Des. Codes Cryptogr. 86 (2018), 1085–1094.DOI
- [12]M. Harada and A. Munemasa, Some restrictions on weight enumerators, IEEE Trans. Inform. Theory 52 (2006), 1266–1269.
- [13]M. Harada and A. Munemasa, Classification of quaternary Hermitian self-dual codes of length 20, IEEE Trans. Inform. Theory 57 (2011), 3758–3762.arxiv.org/abs/1012.0898
- [14]M. Harada and A. Munemasa, “Database of Self-Dual Codes”, Available online at https://www.math.is.tohoku.ac.jp/~mharada/selfdualcodes.htm.
- [15]S. Ling and P. Solé, On the algebraic structure of quasi-cyclic codes I: finite fields, IEEE Trans. Inform. Theory 47 (2001), 2751–2760.DOI
- [16]V. Pless, A classification of self-orthogonal codes over GF(2), Discrete Math. 3 (1972), 209–246.DOI
- [17]E.M. Rains, Shadow bounds for self-dual codes, IEEE Trans. Inform. Theory 44 (1998), 134–139.DOI
- [18]E. Rains and N.J.A. Sloane, “Self-dual codes,” Handbook of Coding Theory, V.S. Pless and W.C. Huffman (Editors), Elsevier, Amsterdam, pp. 177–294, 1998.
- [19]A.M. Roberts, “Weight Enumerator Parameter Database For Binary Self-Dual Codes”, Available online at https://amr-wepd-bsdc.netlify.app/.
- [20]H.-P. Tsai and Y.J. Jiang, Some new extremal self-dual [58, 29, 10] codes, IEEE Trans. Inform. Theory 44 (1998), 813–814.DOI
- [21]N. Yankov and M.H. Lee, New binary self-dual codes of lengths 50–60, Des. Codes Cryptogr. 73 (2014), 983–996.DOI