betaFeedback

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 6060 with weight enumerators for which no binary extremal self-dual codes of length 6060 were previously known to exist. This completes the determination of the weight enumerators that occur for binary extremal self-dual codes of length 6060.

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 CC is doubly even if the weights of all codewords of CC are multiples of 4, and singly even if there is at least one codeword of weight ≡2(mod4)\equiv2 \pmod{4}. For a positive integer nn, a binary self-dual code of length nn exists if and only if nn is even, and a doubly even self-dual code of length nn exists if and only if n≡0(mod8)n \equiv0 \pmod{8}. 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 dd of a binary self-dual code of length nn satisfies d≤4⌊n/24⌋+4d \le4\lfloor n/24\rfloor+ 4, unless n≡22(mod24)n \equiv22 \pmod{24}, in which case d≤4⌊n/24⌋+6d \le4\lfloor n/24\rfloor+ 6. 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 nn for which a binary singly even self-dual [n,n/2,12][n,n/2,12] code exists is either 56 or 60 [5 Table I]. It is not known whether a binary singly even self-dual [56,28,12][56,28,12] 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:

W60,1=1+(2555+64β)y12+(33600−384β)y14+⋯ ,W60,2=1+3451y12+24128y14+⋯ .\begin{aligned} W_{60,1} &= 1 + (2555 + 64\beta)y^{12} + (33600 - 384\beta)y^{14} + \cdots,\\ W_{60,2} &= 1 + 3451y^{12} + 24128y^{14} + \cdots. \end{aligned}

where β\beta is an integer. A binary extremal self-dual code with weight enumerator W60,2W_{60,2} was found in [5]. If there exists a binary extremal self-dual [60,30,12][60,30,12] code with weight enumerator W60,1W_{60,1}, then

β∈{0,1,2,…,8,10}\beta\in\{0,1,2,\ldots,8,10\}

[12]. For β=0,1,2,5,6,7\beta= 0,1,2,5,6,7 and 10, a binary extremal self-dual code with weight enumerator W60,1W_{60,1} 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 β∈{3,4,8}\beta\in\{3,4,8\}, there exists a binary extremal self-dual [60,30,12][60,30,12] code with weight enumerator W60,1W_{60,1}.

As a consequence, we have the following:

Corollary 2. There exists a binary extremal self-dual [60,30,12][60,30,12] code with weight enumerator W60,1W_{60,1} if and only if β∈{0,1,2,…,8,10}\beta\in\{0,1,2,\ldots,8,10\}.

This completes the determination of the weight enumerators that occur for binary extremal self-dual codes of length 60.

Preliminaries

Let Fq\mathbb{F}_{q} denote the finite field of order qq, where qq is a prime power. We take F2\mathbb{F}_{2} to be {0,1}\{0,1\}, and we take F4\mathbb{F}_{4} to be {0,1,ω,ω2}\{0,1,\omega,\omega^{2}\}, where ω2=ω+1\omega^{2}=\omega+1. An [n,k][n,k] code CC over Fq\mathbb{F}_{q} is a kk-dimensional vector subspace of Fqn\mathbb{F}_{q}^{n}. Codes over F2\mathbb{F}_{2} and F4\mathbb{F}_{4} are called binary and quaternary, respectively. The parameter nn is called the length of CC. The weight wt⁡(x)\operatorname{wt}(x) of a vector x∈Fqnx\in\mathbb{F}_{q}^{n} is the number of nonzero components of xx. A vector of CC is called a codeword of CC. The minimum weight among the nonzero codewords of CC is called the minimum weight of CC. An [n,k,d][n,k,d] code is an [n,k][n,k] code with minimum weight dd. The weight enumerator of CC is given by the polynomial ∑c∈Cywt⁡(c)\sum_{c\in C} y^{\operatorname{wt}(c)}. Two [n,k][n,k] codes CC and C′C' over Fq\mathbb{F}_{q} are equivalent, denoted C≅C′C\cong C', if there is an n×nn\times n monomial matrix PP over Fq\mathbb{F}_{q} with C′=CPC'=CP, where CP={xP∣x∈C}CP=\{xP\mid x\in C\}. The automorphism group of CC consists of all monomial matrices PP with C=CPC=CP.

The dual code C⊥C^{\perp} of a binary code CC of length nn is defined as follows:

C⊥={x∈F2n∣⟨x,y⟩=0 for all y∈C},C^{\perp}=\{x\in\mathbb{F}_{2}^{n}\mid\langle x,y\rangle=0\text{ for all }y\in C\},

where ⟨x,y⟩=∑i=1nxiyi\langle x,y\rangle=\sum_{i=1}^{n}x_{i}y_{i} for x=(x1,x2,…,xn)x=(x_{1},x_{2},\ldots,x_{n}) and y=(y1,y2,…,yn)∈F2ny=(y_{1},y_{2},\ldots,y_{n})\in\mathbb{F}_{2}^{n}. In addition, the Hermitian dual code C⊥HC^{\perp_{H}} of a quaternary code CC of length nn is defined as follows:

C⊥H={x∈F4n∣⟨x,y⟩H=0 for all y∈C},C^{\perp_{H}}=\{x\in\mathbb{F}_{4}^{n}\mid\langle x,y\rangle_{H}=0\text{ for all }y\in C\},

where ⟨x,y⟩H=∑i=1nxiyi2\langle x,y\rangle_{H}=\sum_{i=1}^{n}x_{i}y_{i}^{2} for x=(x1,x2,…,xn)x=(x_{1},x_{2},\ldots,x_{n}) and y=(y1,y2,…,yn)∈F4ny=(y_{1},y_{2},\ldots,y_{n})\in\mathbb{F}_{4}^{n}. A binary code CC is called self-dual if C=C⊥C=C^{\perp}. A quaternary code CC is called Hermitian self-dual if C=C⊥HC=C^{\perp_{H}}.

Let CC be a binary singly even self-dual code. Let C0C_{0} denote the subcode of CC consisting of codewords having weight ≡0(mod4)\equiv0\pmod4. The shadow SS of CC is defined to be C0⊥∖CC_{0}^{\perp}\setminus C. 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 [60,30,12][60,30,12] code with weight enumerator W60,1W_{60,1} for β=3\beta=3, 44 and 88.

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 C2C_{2} be a binary self-dual code of length 20 and let C4C_{4} be a quaternary Hermitian self-dual code of the same length. We define a map ϕ\phi from F4\mathbb{F}_{4} to F23\mathbb{F}_{2}^{3} as follows:

ϕ(0)=(0,0,0), ϕ(1)=(0,1,1), ϕ(ω)=(1,0,1) and ϕ(ω2)=(1,1,0).\phi(0)=(0,0,0),\ \phi(1)=(0,1,1),\ \phi(\omega)=(1,0,1)\ \text{and}\ \phi(\omega^{2})=(1,1,0).

We also define a map Rep⁡3\operatorname{Rep}_{3} from F220\mathbb{F}_{2}^{20} to F260\mathbb{F}_{2}^{60} as follows:

Rep⁡3(x)=(x1,x1,x1,x2,x2,x2,…,x20,x20,x20)\operatorname{Rep}_{3}(x)=(x_{1},x_{1},x_{1},x_{2},x_{2},x_{2},\ldots,x_{20},x_{20},x_{20})

for x=(x1,x2,…,x20)∈F220x=(x_{1},x_{2},\ldots,x_{20})\in\mathbb{F}_{2}^{20}. We extend ϕ\phi coordinatewise to a map from F420\mathbb{F}_{4}^{20} to F260\mathbb{F}_{2}^{60}, also denoted by ϕ\phi, by setting

ϕ(y)=(ϕ(y1),ϕ(y2),…,ϕ(y20))\phi(y)=(\phi(y_{1}),\phi(y_{2}),\ldots,\phi(y_{20}))

for y=(y1,y2,…,y20)∈F420y=(y_{1},y_{2},\ldots,y_{20})\in\mathbb{F}_{4}^{20}. Then

C(C2,C4)={Rep⁡3(x)+ϕ(y)∣x∈C2,y∈C4}C(C_{2},C_{4})=\{\operatorname{Rep}_{3}(x)+\phi(y)\mid x\in C_{2},y\in C_{4}\}

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 C2,iC_{2,i} and C4,jC_{4,j} the ii-th binary self-dual code and the jj-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 [60,30,12][60,30,12] codes with weight enumerators W60,1W_{60,1} for β=3\beta=3, 4 and 8.

We give explicit constructions of these codes. Let S20S_{20} denote the symmetric group of degree 20. For σ∈S20\sigma\in S_{20} and a binary code C2C_{2} of length 20, let σ(C2)\sigma(C_{2}) denote the code obtained from C2C_{2} by moving coordinate ii to position σ(i)\sigma(i). Define the following binary self-dual codes of length 60:

C2,60,3=C(σ3(C2,14),C4,3168),C_{2,60,3}=C(\sigma_{3}(C_{2,14}),C_{4,3168}),
C2,60,4=C(σ4(C2,15),C4,3168) andC_{2,60,4}=C(\sigma_{4}(C_{2,15}),C_{4,3168})\ \text{and}
C2,60,8=C(σ8(C2,12),C4,439),C_{2,60,8}=C(\sigma_8(C_{2,12}),C_{4,439}),

where

σ3=(1,20,4,14,19,17,15,8,10,18)(2,13,16,7,6,9,12)(3,11),\sigma_3=(1,20,4,14,19,17,15,8,10,18)(2,13,16,7,6,9,12)(3,11),
σ4=(1,9)(2,10,14,19,17,18,7,3,6,16,5,12,4,20)(8,15,13,11)\sigma_4=(1,9)(2,10,14,19,17,18,7,3,6,16,5,12,4,20)(8,15,13,11)

and

σ8=(1,20,9,14,16)(2,8,17)(3,13,5)(4,18,7)(6,11,15)(10,12).\sigma_8=(1,20,9,14,16)(2,8,17)(3,13,5)(4,18,7)(6,11,15)(10,12).

We verified by Magma [2] that C2,60,3C_{2,60,3}, C2,60,4C_{2,60,4} and C2,60,8C_{2,60,8} have minimum weight 12 and weight enumerators W60,1W_{60,1} for β=3,4\beta=3,4 and 8, respectively. By [1 Theorem 5.6], the shadow of C(C2,C4)C(C_2,C_4) is obtained by replacing C2C_2 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 β\beta shadow vectors of weight 6 simultaneously for β∈{3,4,8}\beta\in\{3,4,8\}. We verified by Magma [2] that the automorphism groups of C2,60,3C_{2,60,3}, C2,60,4C_{2,60,4} and C2,60,8C_{2,60,8} have orders 12, 6 and 3, respectively.

For convenience, we give explicit generator matrices in standard form for codes equivalent to C2,60,βC_{2,60,\beta}, where β∈{3,4,8}\beta\in\{3,4,8\}. 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 (I30 Mβ)\left(I_{30}\ M_\beta\right), where the matrices MβM_\beta are listed in Table 1 and I30I_{30} denotes the identity matrix of order 30.

M3M_3M4M_4M8M_8
[binary matrix][binary matrix][binary matrix]

Table 1. Matrices M3M_3, M4M_4 and M8M_8.

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 [10m,5m,2m][10m,5m,2m] codes whose shadows have minimum weight mm, where mm 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

m∈{1,2,3,4,5,6,7,8,10,12}.m\in\{1,2,3,4,5,6,7,8,10,12\}.

For such a code, let β\beta denote the number of vectors of weight mm in its shadow. By [12 Lemmas 2 and 3], we have

β∈{1,2,…,8,10}.\beta\in\{1,2,\ldots,8,10\}.

Moreover, β≤2\beta\le2 if mm is odd. Here β=0\beta= 0 is excluded since the shadow is required to have minimum weight mm.

  • m=1,2,3m = 1, 2, 3: The weight enumerators that occur were determined (see [5]).

  • m=4m = 4: The values of β\beta that occur are exactly 1,2,…,81, 2, \ldots, 8 and 1010 [12].

  • m=5m = 5: The values of β\beta that occur are exactly 11 and 22 (see [8], [12] and [21]).

  • m=6m = 6: Together with the previously known codes, Proposition 1 shows that the values of β\beta that occur are exactly 1,2,…,81, 2, \ldots, 8 and 1010.

  • m=7m = 7: If a binary self-dual [70,35,14][70, 35, 14] code exists, then its shadow has minimum weight 1515 [9]. Hence, no such code has a shadow of minimum weight 77.

  • m=8m = 8: It is not known whether a binary singly even self-dual [80,40,16][80, 40, 16] code exists.

  • m=10m = 10: There is no binary self-dual [100,50,20][100, 50, 20] code [8].

  • m=12m = 12: Every binary extremal self-dual [120,60,24][120, 60, 24] code must be doubly even [17]. Hence, there is no binary singly even self-dual [120,60,24][120, 60, 24] code.

Consequently, the weight enumerators that occur in this family have now been determined for every mm except m=8m = 8. It remains to determine which weight enumerators occur for binary extremal singly even self-dual [80,40,16][80, 40, 16] codes whose shadows have minimum weight 88. In fact, even the existence of a binary extremal singly even self-dual [80,40,16][80, 40, 16] 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. [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. [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. [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. [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. [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. [6]J.H. Conway and N.J.A. Sloane, Sphere Packings, Lattices and Groups (3rd ed.), Springer-Verlag, New York, 1999.
  7. [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. [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. [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. [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. [11]M. Harada, Binary extremal self-dual codes of length 60 and related codes, Des. Codes Cryptogr. 86 (2018), 1085–1094.DOI
  12. [12]M. Harada and A. Munemasa, Some restrictions on weight enumerators, IEEE Trans. Inform. Theory 52 (2006), 1266–1269.
  13. [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. [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. [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. [16]V. Pless, A classification of self-orthogonal codes over GF(2), Discrete Math. 3 (1972), 209–246.DOI
  17. [17]E.M. Rains, Shadow bounds for self-dual codes, IEEE Trans. Inform. Theory 44 (1998), 134–139.DOI
  18. [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. [19]A.M. Roberts, “Weight Enumerator Parameter Database For Binary Self-Dual Codes”, Available online at https://amr-wepd-bsdc.netlify.app/.
  20. [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. [21]N. Yankov and M.H. Lee, New binary self-dual codes of lengths 50–60, Des. Codes Cryptogr. 73 (2014), 983–996.DOI

Paper details

vlnc:W_744kdqzh
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 1

downloads · 2

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT (GPT-6 Astra)

View statement
Looking for related papers…
Contents