WorksMathematics
On -designs supported by self-orthogonal codes
Abstract
We study self-orthogonal - designs satisfying the condition that the codes generated by the designs are self-orthogonal codes whose codewords of minimum weight correspond to the blocks. A classification of such designs is given under the conditions that and . This yields a classification of self-orthogonal codes of minimum weight whose codewords of minimum weight form a -design under the same conditions.
Introduction
A - design is a pair of a set of points and a collection of -element subsets of (called blocks) such that every -element subset of is contained in exactly blocks, where is a positive integer. As usual, we assume that , throughout this paper. Hereafter, all designs are assumed to have no repeated blocks. Often a - design is simply called a -design. A -design can be represented by its (block-point) incidence matrix , where if the th point is contained in the th block and otherwise. Two designs with the same parameters are isomorphic if there is a bijection between their point sets that maps the blocks of the first design into blocks of the second design.
A - design is called self-orthogonal if the block intersection numbers have the same parity as the block size (see [19]). The term self-orthogonal is due to a natural connection between such designs and self-orthogonal codes. If is a self-orthogonal - design with even, then the code generated by the rows of an incidence matrix of is self-orthogonal. Throughout this paper, we assume that is even for a self-orthogonal - design, unless otherwise specified.
We define a saturated design to be a self-orthogonal - design with even, satisfying the following conditions:
where denotes the dual code of . A self-orthogonal - design with even failing at least one of (1), (2) and (3) is called unsaturated. It is well known that the Witt system on 24 points, that is, the - design is saturated, where is the extended Golay code .
The only known extremal doubly even self-dual codes of length are the extended Golay code and the extended quadratic residue code of length 48. In addition, it is known that (resp. ) is the unique extremal doubly even self-dual code of length 24 (resp. 48). The existence of an extremal doubly even self-dual code of length 72 is a long-standing open question. By the Assmus–Mattson theorem [1], the supports of the codewords of minimum weight in an extremal doubly even self-dual code of length form a self-orthogonal - design [15]. As described above, it is well known that the Witt system on 24 points is saturated. For , 3 and 4, every self-orthogonal - design is saturated [13], [11] and [10], respectively. A powerful tool used in [11] and [13] is the system of fundamental equations, sometimes called the Mendelsohn equations [8] (see also [16] and [19]).
The purpose of this paper is to begin a systematic study of the family of saturated self-orthogonal designs. We show that self-orthogonal designs with certain parameters are saturated, by proving the nonexistence of unsaturated designs with the same parameters. As a typical example, we have the following:
Theorem A. For , 2 and 3, every self-orthogonal - design is a saturated - design.
Remark 1.1. (i) Every self-orthogonal - design is isomorphic to the Witt system on points. Every self-orthogonal - design is isomorphic to the unique self-orthogonal - design.
(ii) The divisibility condition shows that none of the - designs for and is a -design. We refer to the proof of Theorem 5 in [2] for general .
In Table 1, we give some necessary notation for codes, which is used throughout this paper.
| Notation | Codes |
| the Hamming code | |
| the extended Hamming code | |
| the first order Reed–Muller code | |
| the unique (singly even) self-dual code ([18]) | |
| the Golay code | |
| the extended Golay code | |
| the unique (singly even) self-dual code ([18]) | |
| the five doubly even self-dual codes ([7]) | |
| the unique (singly even) self-dual code ([13]) | |
| the quadratic residue code | |
| the extended quadratic residue code | |
| a putative doubly even self-dual code |
Table 1. Notation for some codes
Lalaude-Labayle [14] gave a classification of self-orthogonal codes of minimum weight whose codewords of minimum weight form a -design for the case with and the case with .
Theorem 1.2 (Lalaude-Labayle [14]). Let be a self-orthogonal code of minimum weight whose codewords of minimum weight form a -design.
(i) If and , then is equivalent to one of , , , , , , , , , and , where is the doubly even subcode of .
(ii) If and , then is equivalent to one of , and .
:::`
The following theorem extends the above theorem, which is one of the main results of this paper.
Theorem B. Suppose that . Let be a self-orthogonal code of minimum weight whose codewords of minimum weight form a -design.
(i) If , then is equivalent to one of , , the unique self-orthogonal code, the unique shortened code of and .
(ii) If , then is equivalent to one of , , , , , , , , , and , where is the doubly even subcode of .
(iii) If , then is equivalent to one of , , and .
(iv) If , then is equivalent to one of , and .
(v) If , then there is no such code .
This paper is organized as follows. In § 2, we give definitions, notation and basic results, and derive lower bounds on the minimum weight of using the Mendelsohn equations for a - design . In § 3, we examine the existence of self-orthogonal - designs for even , and . We give strong restrictions on the parameters of self-orthogonal designs and we establish the nonexistence of self-orthogonal designs for many parameters (Table 2 and Table 3). In § 4, we give possible parameters of unsaturated self-orthogonal - designs satisfying for and (Table 4). This is used to show that self-orthogonal designs with certain parameters are saturated. As a typical example, we have a proof of Theorem A. In addition, the nonexistence of self-orthogonal designs is also established for many parameters. In § 5, we study self-orthogonal designs satisfying (3). We give strong restrictions on the parameters of self-orthogonal designs satisfying (3) and . This determines possible parameters of self-orthogonal - designs with even satisfying (3) for (Proposition 5.2). By investigating self-orthogonal - designs with parameters listed in Proposition 5.2, we give a classification of self-orthogonal - designs with even satisfying (2), (3), and in § 6. Theorem B is obtained as a consequence of this classification. As the other consequence, a classification of saturated self-orthogonal designs under the same condition is also obtained (Corollary 6.4).
| 3 | 6 | 4 | 198 ([17]) | ||
| 6 | 2 | 6 | 330 ([18]) | 1 | |
| 21 | 1 | 6, 8 | 759 ([18]) | ||
| 7 | 1 | 6 | 390 ([7]) | 1 | |
| 42 | 0 | 6 | 442 ([7]) | ||
| 6 | 0 | 6 | 393 ([7]) | ||
| 4 | 13 | 4 | 512 ([17]) | 1, 2, 3, 5, 6, 7, 9, 10, 11, 13 | |
| 6 | 9 | 4, 6 | 700 ([18]) | 1, 3, 5, 7, 9 | |
| 180 | 0 | 4, 6, 8 | 960 ([18]) | ||
| 3 | 20 | 4, 6 | 1313 ([7]) | ||
| 20 | 2 | 6 | 1624 ([7]) | 1, 2 | |
| 18 | 3 | 6 | 1848 ([7]) | 1, 3 | |
| 15 | 8 | 6, 8 | 2576 ([18]) | 1, 2, ..., 7 | |
| 495 | 0 | 6 | 2340 ([7]) | ||
| 99 | 0 | 6 | 3717 ([7]) | ||
| 55 | 1 | 6 | 5320 ([7]) | 1 | |
| 66 | 3 | 6 | 5020 ([7]) | 1, 2, 3 | |
| 143 | 2 | 6 | 8931 ([7]) |
Table 2. Self-orthogonal - designs
| (Section 4) | ||||
| ([22]) | ||||
| (Section 4) | ||||
| (Section 4) |
Table 3. Self-orthogonal - designs
| 8 | (16, 4), (16, 6), (22, 6), (22, 7), (23, 7) |
| 10 | (20, 4), (22, 6), (26, 6) |
| 12 | (23, 7), (23, 8), (24, 8), (36, 8), (47, 11), (68, 16), (156, 36), (311, 71) |
| 14 | (27, 7), (80, 16), (159, 31) |
| 16 | (22, 3), (24, 8), (27, 4), (32, 8), (43, 8), (43, 11), (48, 12), (56, 12), (58, 13) |
| 18 | (36, 8) |
| 20 | (39, 11) |
| 22 | (43, 11) |
| 24 | (48, 12), (72, 16), (96, 20) |
| 26 | (52, 12) |
| 28 | (55, 15) |
| 30 | (59, 15) |
Table 4. Solutions of (11)
Preliminaries
In this section, we give definitions, notation and basic results used throughout this paper.
Self-orthogonal codes
A (binary) code is a -dimensional vector subspace of , where denotes the finite field of order 2. Throughout this paper, all codes are assumed to be binary. The parameters and are called the length and dimension of , respectively. The support of a vector is and the weight of is . A vector of is called a codeword. The minimum nonzero weight of all codewords in 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 are equivalent if one can be obtained from the other by permuting the coordinates.
The dual code of a code of length is defined as
where is the standard inner product. A code is called self-orthogonal if , and is called self-dual if . A code is called doubly even if all codewords have weight divisible by 4. A doubly even code is self-orthogonal. It is known that there is a doubly even self-dual code of length if and only if . A self-dual code is called singly even if there is at least one codeword of weight .
Let be a self-orthogonal - design with even. Let denote the code generated by the rows of an incidence matrix of . Then is self-orthogonal. In addition, if , then is doubly even.
A binomial identity
Although the following lemma may be known, we give a proof for completeness.
Lemma 2.1. Let and be nonnegative integers. Then
Proof. The assertion is immediate for . We proceed by induction on . If , both sides are equal to . Suppose that and that the assertion holds for . For , Pascal’s identity gives
Using this identity and the induction hypothesis, we obtain
This completes the proof.
By putting , the above lemma gives the following identity:
which is used in the proof of Lemma 2.2.
Mendelsohn equations
Let be a - design. It follows that every -element subset of points () is contained in exactly blocks, where
The number is traditionally denoted by , and the total number of blocks is .
Assume that is even. We denote the code generated by the rows of an incidence matrix of by . Let be a vector of and let be the support. Suppose that . Counting the number of pairs with , , , we have
Let
Note that we often simply denote it by . Then we have the following system of equations:
These fundamental equations, which are sometimes called Mendelsohn equations [8] (see also [16] and [19]), are a powerful tool used throughout this paper.
The following lemma gives a necessary condition for the solvability of systems of the same form as the Mendelsohn equations (7).
Lemma 2.2. Let be nonnegative integers. If the following system of equations
has a solution , then
where
Proof. Using the given equations and (4), we have
The result follows.
Bounds on minimum weights of
Throughout this subsection, let be a - design with even. We give bounds on the minimum weight of the dual code of . The assertions (i) and (ii) in the following lemma were first proved in [19] for and in [13] for , respectively. Our proof is similar to those in [13] and [19]$.
Lemma 2.3. (i) If is even with , then .
(ii) If is odd with , then .
Proof. The system of equations (7) has a solution if we take . It follows from [13 (3.2)] that
Suppose that , where is a positive integer. From (9), we have . Hence, the Mendelsohn equations (7) yield the following:
Hence, we have
where equality holds if and only if . Thus, . This completes the proof of the assertion (i).
Now suppose that , where is a positive integer. Since a - design is a - design, the above discussion given in the proof of the assertion (i) can be applied. Thus, it follows that , where equality holds if and only if . It follows from (9) that . The assertion (ii) follows.
Self-orthogonal - designs with even
Throughout this section, we assume that is even with . We examine the existence of self-orthogonal - designs for and .
Lemma 3.1. Let be a self-orthogonal 3- design such that is even and . If there is a vector of weight 4 in , then .
Proof. Let be a vector of weight 4 in . From the Mendelsohn equations (7), we have
and
This implies that . The result follows.
Let denote the largest minimum weight among all self-dual codes of length (see [6 Table I] for ()).
Proposition 3.2. There is no self-orthogonal 3- design for and .
Proof. Suppose that is a self-orthogonal 3- design with or . By Lemma 2.3 (ii) and , is contained in some self-dual code with parameters and , respectively. Thus, there is a vector of weight 4 in . The result follows from Lemma 3.1.
Let be a self-orthogonal - design with even. Then is a self-orthogonal code containing at least codewords of weight . If is even, then is contained in some self-dual code containing at least codewords of weight . The possible minimum weights are determined by Lemma 2.3 and . We denote by the set of the possible minimum weights . Let denote the largest number of codewords of weight among self-dual codes. Let
Since , we have . Let be the least positive integer such that
is an integer for every . Then (5) implies that divides . Let
Of course, if there is a self-orthogonal - design, then . In Table 2, we list , and for , and , except and . We also list along with references. The column “” is explained below.
Let be a self-orthogonal - design with even. Let be a block of . Let
From the Mendelsohn equations (7), we have the following system of equations:
Since each counts blocks, (10) must have a solution in nonnegative integers. For each in Table 2, we consider with . The column “” lists the values of for which (10) has no solution in nonnegative integers. Thus, no self-orthogonal - design exists for any value of listed in this column. For example, when , we have and . From (10) we have , so is excluded by the condition . Hence, the only possible is 12.
Proposition 3.3. There is no self-orthogonal - design for
Proof. For each of the listed parameter sets, Table 2 gives . However, the existence of such a design requires for a positive integer satisfying , a contradiction.
Proposition 3.4. There is no self-orthogonal - design for and .
Proof. For each of the listed parameter sets, Table 2 shows that (10) has no nonnegative integer solution for any with . Since these are all possible values of , the result follows.
Proposition 3.5. (i) There is a self-orthogonal - design if and only if .
(ii) There is a self-orthogonal - design if and only if .
(iii) There is a self-orthogonal - design if and only if .
In each case, the design is unique, up to isomorphism.
Proof. From Table 2, the only possible values of are , and in (i), (ii) and (iii), respectively. The existence and uniqueness up to isomorphism of the designs with these parameters follow from [19], Remark 1.1 and [22], respectively.
Proposition 3.6. There is a self-orthogonal - design if and only if . The design is unique, up to isomorphism.
Proof. Up to isomorphism, there is a unique self-orthogonal - design [22]. From Table 2, it is sufficient to show that there is no self-orthogonal - design for .
Suppose that is a self-orthogonal - design with . By Lemma 2.3 (ii) and Lemma 3.1, contains no vectors of weight 2 or 4. Since , two disjoint blocks yield a vector of weight 2 in , where denotes the all-one vector. Similarly, two blocks intersecting in 8 points yield a vector of weight 4. Hence, we have in (10). Multiplying these equations in (10) for by , , , , respectively, and adding, we obtain
Thus, , a contradiction.
Proposition 3.7. There is no self-orthogonal - design for any positive integer .
Proof. Let be a self-orthogonal - design. By Lemma 2.3 (ii) and , is contained in a self-dual code . Up to equivalence, there are such codes [17].
We verified by Magma [4] that only one of these codes has the property that every -subset of the coordinate set is contained in the support of a codeword of weight . This is the unique self-dual code with weight enumerator
Since , must be this code, up to equivalence. We also verified that some -subset is contained in exactly supports of codewords of weight . Hence, and .
Choose a codeword of weight with . Since , the Mendelsohn equations (7) apply to and give
Adding to the incidence vectors of the blocks counted by gives distinct codewords of weight in . Thus, we have . Since and are nonnegative integers, we have
Therefore, we have , that is, is a - design.
We now show that no such design exists. For a fixed block , (10) gives
Since and , we have and . Thus, is closed under complementation and for any distinct . Let be the graph with vertex set
where two distinct vertices and are adjacent if . This definition is independent of the choice of representatives, since replacing either representative by its complement interchanges weights 4 and 16. The following set
is an independent set of of size . However, we verified by Magma [4] that has independence number 70, a contradiction.
For given in Table 2 (except the cases with ), we summarize in Table 3 the existence and nonexistence results discussed in this paper for self-orthogonal - designs. Some of these results are established in § 4, as indicated in the table. In the column “”, indicates that the existence of a self-orthogonal - design is known, and in the column “”, indicates that the nonexistence of a self-orthogonal - design is known.
Unsaturated self-orthogonal designs
In this section, in order to show that self-orthogonal designs with certain parameters are saturated, we establish the nonexistence of unsaturated designs with the parameters.
Lemma 4.1. Let be a self-orthogonal - design with even. Suppose that is unsaturated. Then there is a nonzero vector such that for every block , where .
Proof. If , then choose a vector of minimum weight in a nontrivial coset of in . Otherwise, since is unsaturated, (2) or (3) fails. Hence, there is a nonzero codeword of minimum weight in whose support is not a block.
In either case, is a nonzero vector and is not a block. For any block , let denote its incidence vector. Then is nonzero and lies in the same coset of as . By the choice of , we have
Thus, we conclude that .
Proposition 4.2. Let be a self-orthogonal - design with even. Suppose that is unsaturated. Let and let , where is given as in Lemma 4.1. Assume . Then
Proof. Since is the support of a vector in , each block meets in an even number of points. By Lemma 4.1, this number is at most . Hence, the Mendelsohn equations (7) give
Applying Lemma 2.2 to (12) with and , we obtain
From (5), we have
Substituting these expressions into the sum above and dividing by gives (11).
For or , (11) reduces to
Under the conditions and , the integer solutions are
For , all integer solutions of (11) satisfying and are listed in Table 4. This was found by Magma [4].
We are now in a position to give a proof of Theorem A.
Proof of Theorem A. Suppose that , or . Since these are not in Table 4, a self-orthogonal - design is saturated by Proposition 4.2. This means that is an extremal doubly even self-dual code of length . Hence, by (2) and the Assmus–Mattson theorem [1], is a - design. This completes a proof of Theorem A. □
We also apply Proposition 4.2 to have the following:
Proposition 4.3. There is no self-orthogonal - design for and .
Proof. Suppose that is a self-orthogonal - design with or . If is unsaturated, then Proposition 4.2 gives an integer solution of (11) with . However, Table 4 contains no such solution for or . Thus, is saturated. Hence, is a self-dual code of length 30 and minimum weight . This contradicts .
Next we consider the parameter pairs given in Table 4. For the cases with even not included in Table 2, the corresponding bounds are given in Table 5. Note that the numbers are known for . The column “” lists the values of for which the system (10) with has no solution in nonnegative integers. The column “” lists the values of for which the existence of a self-orthogonal - design is unknown. From Table 5, we have the following:
| - | ||||||
| 15 | 5 | 8 | 10387 ([12]) | |||
| 728 | 0 | 6 | 77 ([18]) | |||
| 78 | 1 | 6, 8 | 759 ([18]) | |||
| 39 | 20 | 6, 8 | 36518 ([3], [7]) | 1, 2, , 20 | ||
| 35 | 46 | 6, 8 | 71232 ([12]) | 1, 2, , 31; 33, , 46 | 32 |
Table 5. - designs with parameters in Table 4 ( even)
Proposition 4.4. (i) There is no self-orthogonal 5- design.
(ii) There is a self-orthogonal 5- design if and only if .
(iii) If there is a self-orthogonal 5- design, then .
The existence of a self-orthogonal 5- design in (ii) follows by taking the complementary design of the Witt system on 24 points.
Proposition 4.5. There is no self-orthogonal - design for any positive integer .
Proof. Let be a self-orthogonal - design. From Table 5, we have . Since is self-orthogonal, there is a self-dual code containing . Since , is not doubly even. Hence, there is a vector of weight , where is odd.
We apply the Mendelsohn equations (7) to the vector with . Multiplying these equations for by , respectively, adding them, and dividing by , we obtain
Since is odd, is odd. Thus, we have , a contradiction.
Now we examine the existence of self-orthogonal - designs for given in Table 4, where is odd or is even with . Let be a self-orthogonal - design. Then is a self-orthogonal code containing at least codewords. Since , we have . Let be as defined in § 3. Let
Of course, if there is a self-orthogonal - design, then . For these parameter pairs, Table 6 lists and , except for and . For these three parameters, we have
| 8 | 8 | 52 | 9841 | ||
| 9 | 12 | 120 | 51 | ||
| 9 | 2586 | 561 | 45 | ||
| 9 | 1160253 | 285 | 276 | ||
| 77 | 6 | 1995 | 8092 | ||
| 2 | 347946717 | 209 | 39106891 | ||
| 2184 | 0 | 2310 | 142 | ||
| 56 | 169 | 1771 | 193 | ||
| 273 | 156 | 3450 | 410 | ||
| 42 | 7308 |
Table 6. - designs with parameters in Table 4
Thus, the bound gives no additional restriction beyond .
Proposition 4.6. There is no self-orthogonal - design for any positive integer .
Proof. For , Table 6 gives and . However, such a design has for a positive integer , a contradiction.
Now let be a self-orthogonal - design with odd. Let be the self-orthogonal code obtained from by appending a zero coordinate. Then is contained in a self-dual code of length containing at least codewords of weight . Let denote the largest number of codewords of weight among self-dual codes of length . Let
Of course, if there is a self-orthogonal - design, then . In the case , we have , which improves the result in Table 6, where .
For the cases in Table 6 with odd and , we give further restrictions in Table 7. For , we use the improved bound in the column “”. The column “” has the same meaning as in Table 2. From Table 7, we have the following:
| 8 | 3 | 1 | |
| 9 | 12 | ||
| 77 | 6 | ||
| 120 | 51 | ||
| 561 | 45 |
Table 7. - designs with parameters in Table 4 ( odd)
Proposition 4.7. (i) There is a self-orthogonal - design if and only if .
(ii) There is no self-orthogonal - design for and .
(iii) If there is a self-orthogonal - design, then .
The existence of a self-orthogonal - design in (i) is established in [22].
Proposition 4.8. There is a self-orthogonal - design if and only if . The design is unique, up to isomorphism.
Proof. Up to isomorphism, there is a unique self-orthogonal - design [19]. From Table 7, it is sufficient to show that there is no self-orthogonal - design.
Let be a self-orthogonal - design. Fix a block . From (10), we have . Thus, there is a block with . The sum of the incidence vectors of and is a vector of weight in . This contradicts Lemma 2.3 (ii), which gives . □
Proposition 4.9. There is no self-orthogonal - design for any positive integer .
Proof. By Proposition 4.7 (iii), it is sufficient to show that there is no self-orthogonal - design. Let be such a design. Since and is self-orthogonal, the dimension of is . In addition, the following code
is a doubly even self-dual code of length .
Puncturing in the last coordinate gives . By Lemma 2.3 (i), we have
Thus, is an extremal doubly even self-dual code of length 40. In addition, has exactly 525504 codewords of weight 20 [15]. Since , these codewords occur in pairs , with exactly one member of each pair having last coordinate 0. Hence, exactly 262752 codewords of weight 20 have last coordinate 0. The incidence vectors of the blocks, with a zero coordinate appended, are among these codewords. This contradicts .
For some cases given in Table 4, we mention the existence of an unsaturated self-orthogonal - design such that contains a vector of weight given in Lemma 4.1.
and : There are exactly five nonisomorphic 3- designs. Since these designs are Hadamard 3-designs, these are self-orthogonal. We denote the design corresponding to the Sylvester Hadamard matrix by . It is known that the code is , which is a self-orthogonal code. In addition, we verified by Magma [4] that 63 nontrivial cosets of in have minimum weights 4 and 6.
We constructed by Magma [4] a self-orthogonal 3- design as follows. Let be the permutation group of order 96 on generated by
The block set is the union of the -orbits of the following base blocks:
There are two inequivalent doubly even self-dual codes of length 16 and the two codes are denoted by and (see [6 Table I]). We verified by Magma [4] that is equivalent to .
These designs are unsaturated, failing (1) for and (3) for .
and : We denote by the unique self-orthogonal - design given in [19]. We verified by MAGMA [4] that the code is a self-orthogonal code. In addition, we verified by MAGMA [4] that three nontrivial cosets of in have minimum weights 6 and 7. Hence, is unsaturated, failing (1).
: We denote by the unique self-orthogonal - design given in [19]. The code is a self-orthogonal code, which is equivalent to . In addition, we verified by MAGMA [4] that the unique nontrivial coset of in has minimum weight 7. Hence, is unsaturated, failing (1).
: Up to isomorphism, there is a unique self-orthogonal - design and the code is equivalent to [22]. Since has minimum weight 6, this design is unsaturated, failing (3).
and : We denote by the unique self-orthogonal - design [22]. We verified by MAGMA [4] that the code is equivalent to . As described above, the unique nontrivial coset of in has minimum weight 7. Since has parameters , is unsaturated, failing both (1) and (3).
: Up to isomorphism, there is a unique self-orthogonal - design and the code is equivalent to [22]. Since has minimum weight 8, this design is unsaturated, failing (3).
: We denote by the unique self-orthogonal - design [13]. We verified by MAGMA [4] that the code is equivalent to , which is a self-orthogonal code. In addition, we verified by MAGMA [4] that the unique nontrivial coset of in has minimum weight 11. Hence, is unsaturated, failing (1).
: A self-orthogonal - design is obtained as the complementary design of the Witt system on 24 points. Thus, the code is equivalent to . Since has minimum weight 8, is unsaturated, failing (3).
: We denote by the self-orthogonal - design, whose blocks are the supports of the codewords of weight 16 in . We verified by Magma [4] that the code is the same as . Since has minimum weight 12, is unsaturated, failing (3).
Self-orthogonal designs satisfying (3)
In this section, we work with a slightly weaker hypothesis than the assumption that is saturated. We assume that has minimum weight .
Proposition 5.1. Let be a self-orthogonal - design with even, and let . If has minimum weight and
then
is an integer for .
Proof. Fix a block of . Note that is a -design. Since has minimum weight , for any block we have unless . Thus, we have
and obviously . From (6), we have
By Lemma 2.2, we have
where is given in (8) with . From (5), we have
By Lemma 2.1 with and , we have
Thus, the coefficient of is nonzero. Solving for and applying (5) gives (14).
As a special case of (14), we have
Proposition 5.2. Let be a self-orthogonal - design with even and let . If has minimum weight and
then
Proof. For each even with , we verified by MAGMA [4] that whenever and in (15) is a positive integer, where is given in Table 8. Then we determined by MAGMA [4] the set of integers with for which are positive integers. The values of and are listed in Table 8. To illustrate our approach, we give details for . If , then
| 4 | 10 | 24 | 151 | ||
| 6 | 26 | 26 | 195 | ||
| 8 | 45 | 28 | 139 | ||
| 10 | 75 | 30 | 158 | ||
| 12 | 52 | 32 | 224 | ||
| 14 | 70 | 34 | 256 | ||
| 16 | 104 | 36 | 183 | ||
| 18 | 1 | 38 | 202 | ||
| 20 | 95 | 40 | 284 | ||
| 22 | 114 |
Table 8. and in the proof of Proposition 5.2
Since , . Thus, we may take . Checking all integers with , we verified by MAGMA [4] that .
Remark 5.3. The following cases
in (16) are excluded by Propositions 3.4, 3.3 and 4.5, respectively.
Self-orthogonal codes and designs satisfying (2) and (3)
The aim of this section is to give a proof of Theorem B. Since is even and , the assumptions and imply . For , we have . We verified by Magma [4] that in (15) is not a positive integer for any integer with . Write , where is the numerator and is the denominator in (15). We also verified by Magma [4] that all coefficients of are positive. Hence, for all , and therefore . Thus, Proposition 5.1 excludes the case . The cases are covered by Theorem 1.2. Therefore, we classify self-orthogonal - designs satisfying (2) and (3) for the remaining even values of with .
Lemma 6.1. Let be a self-orthogonal - design with even. Then satisfies (2) and (3) if and only if has minimum weight and the supports of its codewords of weight are precisely the blocks of .
Proof. This follows directly from (2) and (3).
Remark 6.2. Let be a self-orthogonal code of minimum weight whose codewords of minimum weight form a -design . Then satisfies (2) and (3), and , but the inclusion may be strict. Thus, to classify such codes , we must also determine whether there are self-orthogonal codes properly containing with minimum weight and exactly the same codewords of weight .
Let be a self-orthogonal - design satisfying (2) and (3), where is even with . Set . By Proposition 5.2, is listed in (16). For and , it follows from (13) and Table 4 that (11) has no integer solution with . By Proposition 4.2, must be saturated, which is impossible since is odd. The following cases
are excluded by Propositions 3.4, 3.3 and 4.5, respectively. We consider the remaining cases in (16) below.
: The remaining parameters are and , for which and , respectively. Since
has parameters and , respectively. These codes are unique up to equivalence and are and , respectively. From (2), is therefore isomorphic to the unique - design or the unique - design, respectively. Both codes are maximal self-orthogonal.
: Distinct blocks meet in 0 or 2 points, since an intersection of size 4 yields a codeword of weight 4, contrary to (3). Thus, is symmetric when and quasi-symmetric otherwise.
For , let , and denote the three nonisomorphic symmetric - designs listed in [9 Section 15.8].2 We verified by MAGMA [4] that only satisfies (2) and (3), and that has parameters . This self-orthogonal code is unique up to equivalence, and no self-orthogonal code exists [5]. Hence, no self-orthogonal code of minimum weight 6 properly contains .
For , there is a unique quasi-symmetric - design, up to isomorphism. It satisfies (2) and (3), and its code is equivalent to a code obtained by shortening in one coordinate [20]. All such shortened codes are equivalent.
For , every quasi-symmetric - design is isomorphic to the unique - design, which satisfies (2) and (3) and generates a code equivalent to [20]. Both the code and are maximal self-orthogonal.
For , Proposition 4.2 and (13) imply that is saturated. Hence, is equivalent to , which has only 64 codewords of weight 6 [18], contradicting .
: For and , there is a unique self-orthogonal - design, up to isomorphism. These designs satisfy (2) and (3), and their codes are equivalent to and , respectively [13]. Both codes are maximal self-orthogonal.
and : These cases are covered by Theorem 1.2.
Proposition 6.3. There is no self-orthogonal - design.
Proof. Let be a self-orthogonal - design. By Proposition 4.2 and Table 4, is saturated. Thus, is an extremal doubly even self-dual code whose codewords of minimum weight have supports forming . This contradicts [2 Theorem 5], since is also a -design.
We are now in a position to give a proof of Theorem B.
Proof of Theorem B. Let be as in Theorem B, and suppose that . Then . By Lemma 6.1 and the above arguments, we obtain a classification of self-orthogonal codes of minimum weight whose codewords of minimum weight form a -design, for . For and , the assertions of Theorem B follow from this classification, the known design properties of these codes and the integrality conditions in (5).
Suppose that . The above classification gives . Since a -design is also a -design, Theorem 1.2 (ii) implies that is equivalent to one of , and . However, the supports of their minimum-weight codewords do not form -designs by Remark 1.1 (ii). This completes the proof of Theorem B.
In addition, as a consequence of Theorem B, we have the following classification of certain saturated designs.
Corollary 6.4. Let be a self-orthogonal - design, where is even, and . Then is saturated if and only if is isomorphic to one of the following:
the unique - design,
the unique - design,
the unique - design,
the five nonisomorphic self-orthogonal - designs,
the unique self-orthogonal - design,
the unique self-orthogonal - design and
a putative self-orthogonal - design.
Proof. If is saturated, then is self-dual and has minimum weight . Applying Theorem B with and using (2) gives the designs listed above. Conversely, every listed design satisfies (1), (2) and (3) (see [11], [13], [20] and [21]).
Acknowledgments. This work was supported by JSPS KAKENHI Grant Number 23K25784. The results presented in this paper were mainly obtained during discussions with Akihiro Munemasa around 2014 and 2015. The author is deeply grateful to him for his useful suggestions, continuous discussions and for allowing the author to publish this paper as a single author.
Use of generative AI. In October 2026, while preparing this paper for submission, the author used OpenAI’s ChatGPT (GPT-6 Astra) to assist in checking the proofs, simplifying arguments and improving the exposition.
References
- [1]E.F. Assmus, Jr. and H.F. Mattson, Jr., New 5-designs, J. Combin. Theory 6 (1969), 122–151.DOI
- [2]E. Bannai, M. Koike, M. Shinohara and M. Tagami, Spherical designs attached to extremal lattices and the modulo p property of Fourier coefficients of extremal modular forms, Mosc. Math. J. 6 (2006), 225–264.DOI
- [4]W. Bosma, J. Cannon and C. Playoust, The Magma algebra system I: The user language, J. Symbolic Comput. 24 (1997), 235–265.DOI
- [5]I. Bouyukliev, S. Bouyuklieva, T.A. Gulliver and P.R.J. Östergård, Classification of optimal binary self-orthogonal codes, J. Combin. Math. Combin. Comput. 59 (2006), 33–87.
- [6]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
- [7]J.H. Conway, V. Pless and N.J.A. Sloane, The binary self-dual codes of length up to 32: a revised enumeration, J. Combin. Theory Ser. A 60 (1992), 183–195.DOI
- [8]J. de la Cruz and W. Willems, 5-designs related to binary extremal self-dual codes of length 24m, Theory and applications of finite fields, 75–80, Contemp. Math., 579, Amer. Math. Soc., Providence, RI, 2012.DOI
- [9]M. Hall, Jr., Combinatorial Theory (second edition), John Wiley & Sons, New York, 1986.
- [10]M. Harada, Remark on a 5-design related to a putative extremal doubly-even self-dual [96, 48, 20] code, Des. Codes Cryptogr. 37 (2005), 355–358.DOI
- [11]M. Harada, M. Kitazume and A. Munemasa, On a 5-design related to an extremal doubly even self-dual code of length 72, J. Combin. Theory Ser. A 107 (2004), 143–146.DOI
- [13]M. Harada, A. Munemasa and V.D. Tonchev, A characterization of designs related to an extremal doubly-even self-dual code of length 48, Ann. Comb. 9 (2005), 189–198.DOI
- [14]M. Lalaude-Labayle, On binary linear codes supporting t-designs, IEEE Trans. Inform. Theory 47 (2001), 2249–2255.
- [15]C.L. Mallows and N.J.A. Sloane, An upper bound for self-dual codes, Inform. Control 22 (1973), 188–200.DOI
- [16]N.S. Mendelsohn, Intersection numbers of t-designs, In: Studies in Pure Mathematics (presented to Richard Rado), Academic Press, London 1971, 145–150.
- [17]V. Pless, A classification of self-orthogonal codes over GF (2), Discrete Math. 3 (1972), 209–246.DOI
- [18]V. Pless and N.J.A. Sloane, On the classification and enumeration of self-dual codes, J. Combin. Theory Ser. A 18 (1975), 313–335.DOI
- [19]V.D. Tonchev, A characterization of designs related to the Witt system S(5, 8, 24), Math. Z. 191 (1986), 225–230.
- [20]V.D. Tonchev, Quasi-symmetric designs and self-dual codes, Europ. J. Combin. 7 (1986), 67–73.DOI
- [21]V.D. Tonchev, Quasi-symmetric 2-(31, 7, 7) designs and a revision of Hamada’s conjecture, J. Combin. Theory Ser. A 42 (1986), 104–110.DOI
- [22]V.D. Tonchev, A characterization of designs related to dodecads in the Witt system S(5, 8, 24), J. Combin. Theory Ser. A 43 (1986), 219–227.DOI