betaFeedback

WorksMathematics

New lower bounds for binary constant-weight codes from prescribed-automorphism search, and two quantum codes meeting their upper bounds

Abstract

We give explicit binary constant-weight codes that raise the lower bounds on A(n,6,w)A(n,6,w) in eight cells of Brouwer's table, all now listed there. The first round (9 October 2026) gave four values: A(27,6,11)≥19305A(27,6,11)\ge 19305, A(27,6,12)≥24453A(27,6,12)\ge 24453, A(28,6,10)≥18642A(28,6,10)\ge 18642 and A(28,6,9)≥11154A(28,6,9)\ge 11154, together with an explicit A(24,6,12)A(24,6,12) code of 5566 words, now in the table's list of lost codes. The second round (14 October 2026) gave seven values, listed in the table since 15 October 2026: A(29,6,10)≥27183A(29,6,10)\ge 27183, A(29,6,11)≥42042A(29,6,11)\ge 42042, A(29,6,9)≥14781A(29,6,9)\ge 14781, A(28,6,10)≥19110A(28,6,10)\ge 19110, A(27,6,12)≥24804A(27,6,12)\ge 24804, A(28,6,9)≥11388A(28,6,9)\ge 11388 and A(27,6,13)≥27783A(27,6,13)\ge 27783, three of which replace first-round values. Every code is a union of orbits of the semilinear affine group AΓL(1,27)\mathrm{AΓL}(1,27), its index-2 subgroup, or AGL(1,23)\mathrm{AGL}(1,23), acting on all but at most two coordinates. The orbits were chosen by maximum-weight independent set search on the orbit conflict graph: branch and bound in the first round, iterated local search in the second. Each code was checked by two separately written programs over all pairs of words and was regenerated from its generators and orbit representatives. We also report two qubit stabilizer codes, [[20,11,4]][[20,11,4]] and [[43,32,4]][[43,32,4]], which raise the lower bounds of 3 listed at codetables.de to the listed upper bound 4.

Introduction

A binary constant-weight code with parameters (n,d,w)(n, d, w) is a set of length-nn binary words of Hamming weight ww at pairwise Hamming distance at least dd; A(n,d,w)A(n, d, w) is the largest size of such a code. Brouwer maintains a table of the best known bounds [4], building on [5, 2]; upper bounds for n≤28n \le28 there are from [1] unless labelled otherwise. Each lower bound carries a label naming its source.

A standard way to find large codes is to prescribe a permutation group GG on the coordinates and look only for GG-invariant codes [13, 3]. A GG-invariant code is a union of GG-orbits of weight-ww words, so the search runs over orbits instead of words. This note reports codes of this kind for d=6d = 6 and 27≤n≤2927 \le n \le29 that raise the lower bound in eight cells: four round-1 values and seven round-2 values, three of which replace round-1 values. All of them are now listed in the table (checked 15 October 2026), where the three replaced round-1 values no longer appear. It also reports one explicit code for a lost-code entry. All are lower bounds from explicit codes; none is claimed to be optimal, and we claim improvement only relative to the table entries as checked, not priority over unpublished work. Bounded literature checks made on 9 October for the round-1 cells found no competing construction in recent heuristic work on the table [15, 12, 7]; such checks are not proofs of absence.

Results

Groups. Coordinates 0,…,260,\ldots,26 are identified with GF⁡(27)=GF⁡(3)[x]/(x3+2x+1)\operatorname{GF}(27)=\operatorname{GF}(3)[x]/(x^3+2x+1), the element c0+c1x+c2x2c_0+c_1x+c_2x^2 being coordinate c0+3c1+9c2c_0+3c_1+9c_2. AΓL⁡(1,27)\operatorname{A\Gamma L}(1,27) is the group of maps z↦az3s+bz\mapsto az^{3^s}+b with a≠0a\ne0, s∈{0,1,2}s\in\{0,1,2\}; it has order 2106. Its index-2 subgroup HH (order 1053) requires aa to be a nonzero square. AGL⁡(1,23)\operatorname{AGL}(1,23) acts on GF⁡(23)\operatorname{GF}(23) (coordinates 0,…,220,\ldots,22) by z↦az+bz\mapsto az+b, order 506. Extra coordinates (27, 28; or 23 for n=24n=24) are fixed. Table 1 lists the six group files; orders and point orbits were recomputed for this note by full closure of the generators.

namegrouporderpoint orbitsfile
G24G_{24}AGL⁡(1,23)\operatorname{AGL}(1,23), ∞\infty fixed50623 + 1group-AGL1-23-plus-fixed.txt
G27G_{27}AΓL⁡(1,27)\operatorname{A\Gamma L}(1,27)210627group-AGammaL1-27-on-27.txt
G28G_{28}AΓL⁡(1,27)\operatorname{A\Gamma L}(1,27), 1 fixed210627 + 1group-AGammaL1-27-plus-fixed.txt
H28H_{28}HH, 1 fixed105327 + 1group-AGammaL1-27-index2-plus-fixed.txt
G29G_{29}AΓL⁡(1,27)\operatorname{A\Gamma L}(1,27), 2 fixed210627 + 1 + 1group-AGammaL1-27-plus-2-fixed.txt
H29H_{29}HH, 2 fixed105327 + 1 + 1group-AGammaL1-27-index2-plus-2-fixed.txt

Table 1. The prescribed groups. Generators are listed in Appendix § 11.§ 1.

Round 1 (codes sent to the table maintainer on 9 October 2026). The previous values are those of the live table as checked on 9 October 2026 between 04:06 and 06:54 UTC. In the table, BoBo is Boisclair (emails of 22 and 30 August 2026), gg denotes a code with a prescribed group, and BJLO¨BJLÖ is [3]. The 18260 entry carried no label; it was marked as first given on the table page.

cellprevious [label]newgaingrouporbitsVVsearch
A(27,6,11)A(27,6,11)18260 [–]19305+1045G27G_{27}132227B&B completed, 95.1 s
A(27,6,12)A(27,6,12)23903 [Bo]24453+550G27G_{27}183648B&B cap 1500 s
A(28,6,10)A(28,6,10)18346 [Bo]18642+296G28G_{28}141217B&B completed, 124.2 s
A(28,6,9)A(28,6,9)10920 [g]11154+234H28H_{28}181918B&B cap 900 s
A(24,6,12)A(24,6,12)5558 [BJLÖ]*5566+8*G24G_{24}121788B&B completed, 754.7 s

Table 2. Round-1 codes. VV is the number of vertices of the orbit conflict graph. *For A(24,6,12)A(24,6,12) the table’s lower bound remains the 5616 of [5], whose code is lost; 5558 was the best explicitly available code, and 5566 replaces it in the table’s list of lost codes. It is not an improved lower bound.

For the three completed runs the branch and bound finished without a time cap being reached, so 19305, 18642 and 5566 are the largest codes invariant under G27G_{27}, G28G_{28} and G24G_{24} respectively, provided the orbit graphs are correct. These completions were reported by the solver and were not repeated independently; for the 5566 run the saved output, graph and witness were checked, but no launch manifest records which binary ran (a later rerun with the repaired solver reached the same 12 orbits in 580.5 s). The 24453 and 11154 runs stopped at their time caps after 1,233,305,600 and 629,970,944 search nodes and are lower bounds only.

Round 2 (codes sent to the table maintainer on 14 October 2026). The previous values are those of the live table at 08:15 EDT on 14 October 2026, which agree with the first fetch of § 3. DzD_z is round 1 above; GiG_i is Gippini (email of 1 October 2026, [14]); gsgs is the Graham–Sloane construction with an S2S_2 set [8]; JXJX is [10].

Later runs reproduced the same values: unseeded ILS2 with other seeds returned 19110, 24804 and 11388 again, and ILS2 restarted from each final code (one or two chains per cell, 600 to 1200 s each) did not exceed any of the seven. Intermediate codes, verified the same way and superseded, were A(29,6,10)≥26247,26598A(29, 6, 10) \ge26247, 26598; A(29,6,11)≥41418,41691A(29, 6, 11) \ge41418, 41691; A(29,6,9)≥14430A(29, 6, 9) \ge14430; and A(28,6,10)≥18993A(28, 6, 10) \ge18993.

Orbit sizes, from regeneration: 27183 has orbits 39+117+17⋅351+20⋅105339 + 117 + 17 \cdot351 + 20 \cdot1053; 42042 has 39+234+2⋅351+6⋅702+1053+17⋅210639 + 234 + 2 \cdot351 + 6 \cdot702 + 1053 + 17 \cdot2106; 14781 has 39+6⋅351+12⋅105339 + 6 \cdot351 + 12 \cdot1053; 19110 has 39+117+12⋅351+14⋅105339 + 117 + 12 \cdot351 + 14 \cdot1053; 24804 has 234+2⋅702+2⋅1053+10⋅2106234 + 2 \cdot702 + 2 \cdot1053 + 10 \cdot2106; 11388 has 39+117+8⋅351+8⋅105339 + 117 + 8 \cdot351 + 8 \cdot1053; 27783 has 54+2⋅351+702+1053+12⋅210654 + 2 \cdot351 + 702 + 1053 + 12 \cdot2106.

SHA-256 of the word lists. Each word list is a text file of 0/1 rows, character ii = coordinate ii, one row per word, terminated by newlines (file names An-6-w-M.txt).

codeSHA-256 of word list
A(24,6,12)≥5566A(24, 6, 12) \ge5566a330246135644f9d1a1a8f2bb46ffa5865eeafa3b1c64bfa03e073495cea4d07
A(27,6,11)≥19305A(27, 6, 11) \ge193050adb0037a0bcb033912eaba346527315b1f4d11f745403c42b2af3d326586943
A(27,6,12)≥24453A(27, 6, 12) \ge244532e2c3e4befc59546b19ba7dcf2693f324bbd2d577e6ed9d646a883b92d91bf57
A(28,6,10)≥18642A(28, 6, 10) \ge18642b23744d89191690ac01eb9d4d122dc3648755e37c0eef4982e45453c027bd28d
A(28,6,9)≥11154A(28, 6, 9) \ge111541a3b1dbbaa5b17a099284ce26b81a41f703f1cb22146416391f8448ebf606a02
A(29,6,10)≥27183A(29, 6, 10) \ge27183436d58bbe6fbf03711a79033c0d3b70210fff53affc74bdb8915e32dd223db39
A(29,6,11)≥42042A(29, 6, 11) \ge4204230a50d6aea7beef477579f79fb9ec09ebd5b8c8dc515dafdcf791b6144347c83
A(29,6,9)≥14781A(29, 6, 9) \ge14781c0cf7c71f59a524b1618a3e2f4dbae7808057ce309698c9141db26fb41a011e5
A(28,6,10)≥19110A(28, 6, 10) \ge19110dcc386f01f9fdcfdb9e4779300f279798a0254f43c56ac100d06744bea8f0c03
A(27,6,12)≥24804A(27, 6, 12) \ge24804817d070244da7316c66b8845b03cb3ea9d84069984b8d4e5619e657c790b9b3c
A(28,6,9)≥11388A(28, 6, 9) \ge113887635db5fa873c47a63af70e77e1b076c0fcd39b5bb44c205d2a33dc64017ea1a
A(27,6,13)≥27783A(27, 6, 13) \ge27783550d7f4f896950d126da3c4b2dfd29a34e8762cec3a919f3b3cbcd950fd1502a

Table 4. Hashes recomputed for this note by check_np.py; they equal the hashes in the packages sent on 9 and 14 October.

Table status

The live table [4] was fetched twice; the author keeps both snapshots.

  • 15 October 2026, 01:50:51 UTC (21:50:51 EDT, 14 October), 127,211 bytes, server Last-Modified 14 October 2026 13:36:17 GMT. The round-1 values were listed with label Dz; the seven round-2 target cells still showed their previous values. The round-2 codes had been emailed to the maintainer at 21:43 EDT on 14 October. SHA-256: 7e2afb60f7237aeb82a1f1e1f46358341408e4ab7b38f3272da201f8aee4b977

  • 15 October 2026, 10:44:13 UTC (06:44:13 EDT), 127,299 bytes, server Last-Modified 15 October 2026 07:27:15 GMT. Its key reads “Dz: Chris Dzoba, email 2026-10-09, 2026-10-15 with 5+7 new codes.” SHA-256: 7c8870a49f4db267162a08d81f35679e95c1f6172dcf0baf3173805dd9e27cfd

cellour valuelive table at 06:44 EDT, 15 Octstatus
A(27,6,11)A(27,6,11)1930519305Dz19305_{\mathrm{Dz}}–66078KKT66078^{\mathrm{KKT}}listed
A(28,6,10)A(28,6,10)1864219110Dz19110_{\mathrm{Dz}}–63756was listed; replaced by 19110
A(27,6,12)A(27,6,12)2445324804Dz24804_{\mathrm{Dz}}–84573KKT84573^{\mathrm{KKT}}was listed; replaced by 24804
A(28,6,9)A(28,6,9)1115411388Dz11388_{\mathrm{Dz}}–31195was listed; replaced by 11388
A(24,6,12)A(24,6,12)5566lost codes: 5616 [BSSS], 5566Dz5566_{\mathrm{Dz}}listed (as explicit code)
A(29,6,10)A(29,6,10)2718327183Dz27183_{\mathrm{Dz}}–. . .listed
A(29,6,11)A(29,6,11)4204242042Dz42042_{\mathrm{Dz}}–. . .listed
A(29,6,9)A(29,6,9)1478114781Dz14781_{\mathrm{Dz}}–. . .listed
A(28,6,10)A(28,6,10)1911019110Dz19110_{\mathrm{Dz}}–63756listed
A(27,6,12)A(27,6,12)2480424804Dz24804_{\mathrm{Dz}}–84573KKT84573^{\mathrm{KKT}}listed
A(28,6,9)A(28,6,9)1138811388Dz11388_{\mathrm{Dz}}–31195listed
A(27,6,13)A(27,6,13)2778327783Dz27783_{\mathrm{Dz}}–91079KKT91079^{\mathrm{KKT}}listed

Table 5. Table status at the second fetch (15 October 2026, 06:44 EDT). KKT is [11]; “. . . ” means no upper bound is listed. In the main d=6d=6 table A(24,6,12)A(24,6,12) still reads 5616–15906, the 5616 marked as lost.

Quantum codes

The two codes below are qubit stabilizer codes [6]. The construction and search details come from the notes of the session that found them. The four stabilizer files in the release match the SHA-256 prefixes recorded there, and the referee re-checked them for this note with a fresh script (qcheck.py; our rerun is in reruns/qcheck.txt): for [[20,11]][[20,11]], rank 9, all generators commuting, no logicals of weight ≤3\le3 and 1,075 of weight 4; for [[43,32]][[43,32]], rank 11, all generators commuting, no logicals of weight ≤3\le3, the weight-4 logical X0X1Z2Y14X_0X_1Z_2Y_{14}, minimum stabilizer weight 22, and g1g_1, g2∣y21−1g_2 \mid y^{21}-1. At codetables.de [9], the cells [[20,11]][[20,11]] and [[43,32]][[43,32]] list lower bound 3 and upper bound 4. Both codes therefore meet the listed upper bound; we do not claim more than that.

Construction. Both codes are additive and invariant under a qubit permutation σ\sigma; the stabilizer is spanned by the σ\sigma-orbits of one or two seed Paulis. Qubits 0, . . . , f−1f-1 are fixed by σ\sigma; the remaining n−fn-f qubits form two blocks of length mm, and σ\sigma shifts position pp to p+1p+1 mod mm in both blocks. Block coordinates are read as polynomials in GF⁡(2)[y]/(ym−1)\operatorname{GF}(2)[y]/(y^m-1), separately for the XX and ZZ parts. For each seed the XX part is chosen first and the ZZ part is any solution of the linear system expressing commutation with the rows already present and with the seed’s own σs\sigma^s-images. To obtain rank exactly n−kn-k, the seed’s block polynomials are forced into the ideal generated by a divisor gg of ym−1y^m-1, so that the seed’s orbit has dimension m−deg⁡gm-\deg g.

  • [[20,11,4]]\left[\left[20,11,4\right]\right]: f=0f=0, m=10m=10, one seed, g=y+1g=y+1; σ\sigma has two 10-cycles. Nine generators. The code is pure, with minimum stabilizer weight 12.

  • [[43,32,4]]\left[\left[43,32,4\right]\right]: f=1f=1, m=21m=21, two seeds, g1=1+y2+y7+y8+y11g_1=1+y^2+y^7+y^8+y^{11} and g2=(y21−1)/(y−1)g_2=(y^{21}-1)/(y-1), both divisors of y21−1y^{21}-1 over GF(2); orbit dimensions 10+1=11=n−k10+1=11=n-k; σ\sigma has one fixed point and two 21-cycles. The code is pure, with minimum stabilizer weight 22.

They were found by random sampling within this family (programs cycsample3 and cycsample5, random seed 1), at sample 376 for [[20,11,4]]\left[\left[20,11,4\right]\right] (11 October) and sample 4378 for [[43,32,4]]\left[\left[43,32,4\right]\right] (12 October), in sweeps over table entries whose bounds differ by one. An overnight search on 13–14 October over 73 such entries with n≤60n\le60 and d≤6d\le6 found no further improvement.

Verification. Each code was checked to have minimum distance exactly 4 by (A) a Brouwer–Zimmermann enumeration on the length-3n3n binary image that tests every low-weight normalizer word for membership in SS, validated against brute force on small and random codes; (B) a second Brouwer–Zimmermann implementation written by a separate agent that had not seen (A), with brute-force and meet-in-the-middle modes, validated on known codes and 200 random codes; and an exhaustive scan of every Pauli of weight 1 to 3 (32,550 for n=20n=20, 341,463 for n=43n=43). The meet-in-the-middle mode of (B) confirmed d=4d=4 for [[20,11,4]]\left[\left[20,11,4\right]\right]; it was not run on [[43,32,4]]\left[\left[43,32,4\right]\right], which exceeds its limit n≤30n\le30. A referee using fresh code found, for [[20,11,4]]\left[\left[20,11,4\right]\right]: rank 9, all generators commuting, no logical of weight ≤3\le3 and 1,075 of weight 4, matching the MacWilliams transform of the stabilizer weight distribution {0:1,12:50,14:220,16:195,18:20,20:26}\{0:1,12:50,14:220,16:195,18:20,20:26\}, and d=3d=3 on the table’s own [[20,11,3]]\left[\left[20,11,3\right]\right] as a negative control. For [[43,32,4]]\left[\left[43,32,4\right]\right]: rank 11, normalizer dimension 75, no logical of weight ≤3\le3, and a full weight-4 scan of 9,996,210 Paulis giving 5,740 logicals, none in SS (witness X0X1Z2Y14X_0X_1Z_2Y_{14}), consistent with MacWilliams; negative controls gave d=3d=3 for [[5,1,3]]\left[\left[5,1,3\right]\right], d=2d=2 with a planted weight-3 logical, and d=1d=1 with a generator dropped. The referee’s scripts are in referee/q20verify/ and referee/q43verify/ of the ancillary files.

Derivability and status. At n=20n=20, [[20,12]]\left[\left[20,12\right]\right] and [[20,13]]\left[\left[20,13\right]\right] have upper bound 3, and the standard propagation rules do not take [[21,11,4]]\left[\left[21,11,4\right]\right] or [[22,12,4]]\left[\left[22,12,4\right]\right] to [[20,11,4]]\left[\left[20,11,4\right]\right]. At n=43n=43, a [[44,33,4]]\left[\left[44,33,4\right]\right] is listed; the referee showed that the stored [[44,33,4]]\left[\left[44,33,4\right]\right] and the stored [[64,53,4]]\left[\left[64,53,4\right]\right] do not shorten to [[43,32,4]]\left[\left[43,32,4\right]\right]. There remains a risk that an inequivalent [[44,33,4]]\left[\left[44,33,4\right]\right], not stored in the table, shortens to a [[43,32,4]]\left[\left[43,32,4\right]\right]. No prior [[20,11,4]]\left[\left[20,11,4\right]\right] or [[43,32,4]]\left[\left[43,32,4\right]\right] was found in the literature searches recorded by that session. Both codes were emailed to [email protected], on 11 and 12 October 2026. No reply had been received by 21:55 EDT on 14 October, and a fetch of both cells at 01:56:21 UTC on 15 October (21:56 EDT, 14 October) shows lower bound 3 and upper bound 4 for each. A further fetch at 03:07 UTC on 16 October 2026 still showed lower bound 3 and upper bound 4 for both cells.

Method

Orbit conflict graph. Fix GG and (n,d,w)(n,d,w). Compute the GG-orbits on weight-ww words, discard every orbit containing two words at distance <d<d, and join two remaining orbits by an edge if some word of one is at distance <d<d from some word of the other. Each vertex is weighted by its orbit size. GG-invariant codes with minimum distance ≥d\ge d are exactly the independent sets, and the code size is the total weight. The builder og stores the orbit of every word in a hash table; the round-2 builder og3 replaces it with an array indexed by colex rank, which needs 4(2914)4\binom{29}{14} bytes (about 310 MB for (2914)\binom{29}{14}) and produced a graph byte-identical to og’s for (29,6,9)(29,6,9) under the twisted group below.

Exact search. wmis is a bitset branch and bound for maximum-weight independent sets with a weighted colouring bound. A completed run gives the maximum over GG-invariant codes, provided the graph is correct; a run stopped by its time cap gives a lower bound. Round 1 used it throughout.

Iterated local search. In round 2 two heuristics were run on the same graphs, giving lower bounds only. ils uses (w,1)(w,1)-swaps (insert a vertex and drop its neighbours in the solution if the weight increases) with forced random insertions as perturbation. ils2 adds (1,2)(1,2)-swaps, accepts a new local optimum if its weight is at least the current weight minus a slack drawn from an exponential distribution (mean 300 in the runs of Table 3; later confirmation runs also used 150 and 800), and periodically restarts from the best solution; ils2s starts it from a verified code. ILS found larger codes than branch and bound on the same graphs. On A(29,6,10)A(29,6,10) under G29G_{29} (V=1579V = 1579), branch and bound reached 26247 in 3000 s, and ILS reached 26598 after 7.6 s. On A(29,6,11)A(29,6,11) under the twisted group described below (V=6085V = 6085), branch and bound reached 37830 in 2400 s and ILS2 reached 41418; ILS2 under G29G_{29} later reached 42042. In a rerun for this note (reruns/ils-repro.txt, ILS seed 1), ILS reached two exact group optima: 58149 (PSL(2,27)(2,27) on 28 points plus one fixed, w=12w = 12) in under 0.1 s and 14430 (the twisted group, w=9w = 9) in 2.6 s. The random seed mattered: on A(27,6,12)A(27,6,12) under G27G_{27}, ILS seed 1 (600 s) and ILS2 seed 1 (150 s) both stopped at 24219, while ILS2 seed 3 reached 24804.

cellprevious [label]newgaingrouporbitsVVfirst run reaching it
A(29,6,10)A(29, 6, 10)25896 [Gi]27183+1287H29H_{29}397174ILS2, seed 2, 900 s
A(29,6,11)A(29, 6, 11)41216 [gs]42042+826G29G_{29}284335ILS2, seed 3, 900 s
A(29,6,9)A(29, 6, 9)14313 [Gi]14781+468H29H_{29}192310ILS2, seed 1, 240 s
A(28,6,10)A(28, 6, 10)18642 [Dz]19110+468H28H_{28}285256ILS2 seeded by 18993, seed 5, 900 s
A(27,6,12)A(27, 6, 12)24453 [Dz]24804+351G27G_{27}153648ILS2, seed 3, 1200 s
A(28,6,9)A(28, 6, 9)11154 [Dz]11388+234H28H_{28}181918ILS, seed 1, 600 s
A(27,6,13)A(27, 6, 13)27600 [JX]27783+183G27G_{27}174332ILS2, seed 1, 240 s

Table 3. Round-2 codes. ILS and ILS2 are the iterated local searches of Section 5; ILS2 used mean acceptance slack 300 in these runs. Three entries (19110, 24804, 11388) supersede round-1 values: 19110 > 18642, 24804 > 24453, 11388 > 11154. All seven values are timed lower bounds, not group optima.

Why the n=29n = 29 cells had not been searched. The round-1 job lists were generated from table cells that have an upper bound (tablejobs.py, tablejobs2.py: if not ub: continue). The cells A(29,6,8…14)A(29,6,8\ldots14) and A(29…32,8,8)A(29\ldots32,8,8) list no upper bound, so round 1 never created jobs for them; they were filtered out, not skipped for memory. The round-1 sweeps of n=29n = 29 to 32 covered only cells that do list an upper bound. In round 2 the first 120-second branch-and-bound run on A(29,6,10)A(29,6,10) under G29G_{29} already exceeded 25896.

The twisted action and the index-2 subgroup. AΓL(1,27)(1,27) also acts on 27 + 2 points with the quadratic character of the multiplier swapping the two extra points, while translations and the Frobenius map fix them. Full closure gives order 2106 and point orbits 27 + 2; this group is not a subgroup of G29G_{29} (file n29_gfagaml_q27_k26tw.txt). Its exact optimum at (29,6,9)(29,6,9) is 14430, above the 14313 then listed, while the optimum under G29G_{29} is exactly 14313. The common subgroup of the plain and twisted actions is HH with both extra points fixed, i.e. H29H_{29} (squares and Frobenius, order 1053); every code invariant under either group is H29H_{29}-invariant, and with ILS2 it gave the largest codes at A(29,6,9)A(29,6,9), A(29,6,10)A(29,6,10), A(28,6,10)A(28,6,10) and A(28,6,9)A(28,6,9). The same subgroup, with one fixed point, had given A(28,6,9)≥11154A(28,6,9) \ge11154 in round 1, where the optimum under G28G_{28} is exactly 10920 (a completed run on a 362-vertex graph), equal to the value then listed.

Verification

Two checkers per code. verify.c (C) reads the 0/1 rows and compares every pair character by character, reporting rows, wrong weights, minimum distance and violations. check_np.py (Python/NumPy, sharing no code with the builders, solvers or verify.c) checks lengths, alphabet, weights and distinctness, computes every pairwise distance as 2(w−⟨x,y⟩)2(w-\langle x,y\rangle) in blocks, counts the pairs, and recounts the closest pair by XOR. Both were re-run for this note on all twelve files in the release folder; both report VALID with minimum distance exactly 6 for every code, and check_np.py checked exactly M(M−1)/2M(M-1)/2 pairs in each case (Table 6). Every word list was also rebuilt from its generator file and orbit-representative file (expand_fast.py) and equals the stored list as a set, with the orbit counts of Tables 2 and 3.

codeMMpairs checkedcodeMMpairs checked
A(24,6,12)A(24,6,12)556615,487,395A(29,6,10)A(29,6,10)27183369,444,153
A(27,6,11)A(27,6,11)19305186,331,860A(29,6,11)A(29,6,11)42042883,743,861
A(27,6,12)A(27,6,12)24453298,962,378A(29,6,9)A(29,6,9)14781109,231,590
A(28,6,10)A(28,6,10)18642173,752,761A(28,6,10)A(28,6,10)19110182,586,495
A(28,6,9)A(28,6,9)1115462,200,281A(27,6,12)A(27,6,12)24804307,606,806
A(28,6,9)A(28,6,9)1138864,837,578
A(27,6,13)A(27,6,13)27783385,933,653

Table 6. Pair counts from check_np.py (round 1 left, round 2 right). Every code: 0 wrong weights, minimum distance 6 and 0 violations from both checkers; all rows distinct (checked by check_np.py, implied by minimum distance 6 in verify.c).

At the time of discovery. In round 1 each code was expanded from its generators (expand.py) and checked by verify.c; Codex then rebuilt each group with its own field arithmetic (all 2106, 1053 or 506 maps, compared with a separate generator closure), regenerated the orbits, and compared every pair character by character, with rejection controls (duplicate, too-close, wrong-weight, wrong-length and wrong-character rows). In round 2 each code was checked by verify.c and check_np.py, the latter validated on the round-1 11154 code (62,200,281 pairs, the same count as Codex’s) and on a too-close negative control.

Referee. A separate Claude session refereed every round-2 code (including the superseded intermediate ones) with code written afresh: a C checker (chk.c) over all pairs with a full distance histogram; three negative controls per code (a second row moved to distance 2 from the first, a duplicated row, a row of wrong weight), each of which must fail; orbit regeneration from the .reps and .gens files by full group closure, with a check of group order, point orbits, orbit sizes and disjointness; a re-fetch of the live table for each cell; and checks that no listed entry yields the new values by shortening or extension. It reported every code confirmed (referee/cw/referee.json).

Limits of these checks. The codes of Jin and Xing for A(28,6,12)≥40237A(28,6,12) \ge40237 and A(28,6,13)≥49510A(28,6,13) \ge49510 were not reconstructed, so their shortenings were not computed; a shortening would have to beat the parent’s average by 7.9% to reach 24804 at A(27,6,12)A(27,6,12) and by 4.8% to reach 27783 at A(27,6,13)A(27,6,13). For A(29,6,11)A(29,6,11) we did not search the Graham–Sloane family [8], which uses a Sidon set in an abelian group of order at least 813=29⋅28+1813 = 29 \cdot28 + 1; since the best class of such a partition can exceed its average, we cannot rule out that some choice beats 42042. Shortenings of the new n=29n=29 codes give at most 10569 at A(28,6,9)A(28,6,9) and at most 18603 at A(28,6,10)A(28,6,10), below the new values there. The branch-and-bound optima depend on the correctness of the graph builders, which were cross-checked (og against og3 on one graph) but not proved correct.

Negative results

Round 2 recorded 1043 jobs. Of these, 848 ran: 666 completed exact, 173 timed lower bounds, 8 vertex-limit skips and 1 deliberately stopped run, with no memory skips. The other 195 were deferred by throttle windows and never run; 82 (cell, group) pairs among them were not rerun.

Table 7 gives the best value for each main target that did not improve, separating group maxima (completed branch and bound; valid for that group only, provided the graph is correct) from timed searches.

celllistedbest completed exact (group)best timed (method)
A(27,6,8)A(27,6,8)48284050 (twisted AGL(1, 25) on 25 + 2)–
A(27,6,9)A(27,6,9)83248112 (G27G_{27} and HH, round 1)8112 (HH, ILS2)
A(27,6,10)A(27,6,10)13026†13026^{\dagger}–12987 (HH, ILS2)
A(27,6,11)A(27,6,11)1930519305 (G27G_{27}, round 1)19305 (HH, ILS2 seeded); 18603 unseeded
A(28,6,8)A(28,6,8)63565105 (twisted AGL(1, 25), 1 fixed)–
A(28,6,11)A(28,6,11)2948424948 (PSU(3, 3) on 28)28782 (G28G_{28}, ILS2, 3 seeds)
A(28,6,12)A(28,6,12)4023737107 (PSU(3, 3) on 28)38259 (G28G_{28}, ILS2)
A(28,6,13)A(28,6,13)4951043344 (PSU(3, 3) on 28)44982 (G28G_{28}, ILS2)
A(28,6,14)A(28,6,14)5304646224 (PSU(3, 3) on 28)47439 (G28G_{28}, ILS2)
A(29,6,8)A(29,6,8)81487488 (AGL(1, 27), 2 fixed)–
A(29,6,12)A(29,6,12)6182058149 (PSL(2, 27), 1 fixed)57447 (H29H_{29}, ILS2)
A(29,6,13)A(29,6,13)8083770434 (PSL(2, 27), 1 fixed)68607 (PSU(3, 3), 1 fixed, 60 s)
A(29,6,14)A(29,6,14)9236671892 (PSL(2, 27), 1 fixed)77076 (PSU(3, 3), 1 fixed, 60 s)
A(29,8,8)A(29,8,8)1060≤505\leq505 (all tested groups)–

Table 7. Main targets not improved. Exact values are group maxima from completed runs (caps 60–120 s in round 2); timed values are lower bounds. †^{\dagger}13026 [Fr] since 13 October; 12987 at the round-2 baseline.

Other round-2 families stayed well below the table and are all completed-exact negatives unless noted: W(E6)W(E_6) on the 27 lines and its rotation subgroup, with fixed or twisted extensions; Sp⁡(6,2)\operatorname{Sp}(6,2) on the 28 bitangents; PSU⁡(3,3)\operatorname{PSU}(3,3) and PΓU⁡(3,3)\operatorname{P\Gamma U}(3,3) on the 28-point Hermitian unital; PSL⁡(2,8)\operatorname{PSL}(2,8) and PΓL⁡(2,8)\operatorname{P\Gamma L}(2,8) on 28 points; twisted affine groups over GF⁡(23)\operatorname{GF}(23) and GF⁡(25)\operatorname{GF}(25) at n=25n=25–29 and d=6,8,10d=6,8,10 (60-second triage, some deferred and not rerun); AGL⁡(1,29)\operatorname{AGL}(1,29) and its order-351 subgroup at n=29n=29 (very large graphs, weak timed values).

Round 1 swept the 186 open cells with n≤28n \leq28 (3105 jobs: 2462 completed exact, 385 timed, 256 skipped, 2 target hits) and the cells with 29≤n≤3229 \leq n \leq32 that list an upper bound (798 completed exact, 779 skipped by memory or vertex gates, 31 timed, no hits), over affine and semilinear groups over prime and prime-power fields with fixed points, PSL⁡/PGL⁡/PΓL⁡(2,q)\operatorname{PSL}/\operatorname{PGL}/\operatorname{P\Gamma L}(2,q), products and diagonal actions. These counts are solver-output classifications, not independently certified exclusions, and early runs with undersized solver arrays are not usable as negatives. Specific round-1 group maxima: A(24,6,11)A(24,6,11), 5106 under G24G_{24} (listed 5376); A(26,6,9)A(26,6,9), 5600 under an affine group over GF⁡(25)\operatorname{GF}(25) with one fixed point (listed 5761); A(28,8,6)A(28,8,6), 81 for codes invariant under a 27-cycle fixing one point (listed 132; two graph reconstructions agree). Timed only: A(27,6,13)A(27,6,13), 26730 under G27G_{27} in 900 s; A(27,6,10)A(27,6,10), 12636 under HH in 900 s; A(23,6,10)A(23,6,10), 2783 under the order-253 subgroup of AGL⁡(1,23)\operatorname{AGL}(1,23) in 900 s (listed 2992).

Data availability

The word lists, orbit representatives, group generators, both checkers, the regeneration script, the checker outputs, the quantum stabilizers, the referee scripts and a SHA256SUMS file are provided as ancillary files with this arXiv submission (codes/, groups/, checkers/, verification/, quantum/, referee/, reruns/). Generators and orbit representatives are also printed in Appendix A, which suffices to rebuild every code. The table snapshots cited above are not redistributed.

Tool and computational resource disclosure

This work was carried out by two AI systems working under the author’s direction, and this note discloses their roles in full. In round 1 (night of 8–9 October 2026) Claude (Anthropic) wrote the orbit-graph builder and the weighted branch and bound, generated the group families, ran the table sweeps and the longer pushes that produced the five codes, and checked each hit with its own expansion and checker. Codex (OpenAI) pinned the live table and parsed it into job targets, traced the provenance of the lost codes, audited the solver (finding a stack-depth defect that was then repaired, and a too-small array that invalidated some early negatives), reconstructed every hit independently with its own field arithmetic and a literal pairwise check, computed shortenings, and reviewed the submission package. In round 2 (night of 13–14 October) a Claude session wrote the array-indexed graph builder, the larger solver, the two iterated local searches, the twisted-group generator and the second checker, and ran all searches; a separate Claude session refereed every new code with freshly written programs. The quantum codes were found by a Claude session; their second distance checker was written by a separate agent that had not seen the first, and they were refereed by another Claude session. This paper was written by Claude from the project’s notes, logs and verification outputs. The author set the goals, approved the runs, decided what to submit, sent the submissions, and is responsible for the content. Computing: one laptop (Apple M4 Max, 128 GB); round 1 shared at most four worker processes between the two agents, and round 2 ran at most three single-threaded processes at a time, all at reduced priority. Software: C and Python 3 with NumPy; C++ for the quantum search and checkers; tectonic for this document.

References

Generators, orbit representatives and stabilizers

Group generators

G24 (group-AGL1-23-plus-fixed.txt): AGL(1,23)(1, 23), coordinate 23 fixed, order 506.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 0 23
0 5 10 15 20 2 7 12 17 22 4 9 14 19 1 6 11 16 21 3 8 13 18 23

G27 (group-AGammaL1-27-on-27.txt): AΓL(1,27)(1, 27) on 0..26, order 2106.

1 2 0 4 5 3 7 8 6 10 11 9 13 14 12 16 17 15 19 20 18 22 23 21 25 26 24
3 4 5 6 7 8 0 1 2 12 13 14 15 16 17 9 10 11 21 22 23 24 25 26 18 19 20
9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 0 1 2 3 4 5 6 7 8
0 3 6 9 12 15 18 21 24 5 8 2 14 17 11 23 26 20 7 1 4 16 10 13 25 19 22
0 1 2 5 3 4 7 8 6 13 14 12 15 16 17 11 9 10 26 24 25 19 20 18 21 22 23

G28 (group-AGammaL1-27-plus-fixed.txt): AΓL(1,27)(1, 27), coordinate 27 fixed, order 2106.

1 2 0 4 5 3 7 8 6 10 11 9 13 14 12 16 17 15 19 20 18 22 23 21 25 26 24 27
3 4 5 6 7 8 0 1 2 12 13 14 15 16 17 9 10 11 21 22 23 24 25 26 18 19 20 27
9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 0 1 2 3 4 5 6 7 8 27
0 3 6 9 12 15 18 21 24 5 8 2 14 17 11 23 26 20 7 1 4 16 10 13 25 19 22 27
0 1 2 5 3 4 7 8 6 13 14 12 15 16 17 11 9 10 26 24 25 19 20 18 21 22 23 27

H28 (group-AGammaL1-27-index2-plus-fixed.txt): index-2 subgroup, coordinate 27 fixed, order 1053.

1 2 0 4 5 3 7 8 6 10 11 9 13 14 12 16 17 15 19 20 18 22 23 21 25 26 24 27
3 4 5 6 7 8 0 1 2 12 13 14 15 16 17 9 10 11 21 22 23 24 25 26 18 19 20 27
9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 0 1 2 3 4 5 6 7 8 27
0 9 18 5 14 23 7 16 25 15 26 6 11 20 2 13 22 4 21 3 12 10 26 8 17 19 1 10 27
0 1 2 5 3 4 7 8 6 13 14 12 15 16 17 11 9 10 26 24 25 19 20 18 21 22 23 27

G29 (group-AGammaL1-27-plus-2-fixed.txt): AΓL(1,27)(1, 27), coordinates 27, 28 fixed, order 2106. 1 2 0 4 5 3 7 8 6 10 11 9 13 14 12 16 17 15 19 20 18 22 23 21 25 26 24 27 28 3 4 5 6 7 8 0 1 2 12 13 14 15 16 17 9 10 11 21 22 23 24 25 26 18 19 20 27 28 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 0 1 2 3 4 5 6 7 8 27 28 0 3 6 9 12 15 18 21 24 5 8 2 14 17 11 23 26 20 7 1 4 16 10 13 25 19 22 27 28 0 1 2 5 3 4 7 8 6 13 14 12 15 16 17 11 9 10 26 24 25 19 20 18 21 22 23 27 28

H29 (group-AGammaL1-27-index2-plus-2-fixed.txt): index-2 subgroup, coordinates 27, 28 fixed, order 1053.

1 2 0 4 5 3 7 8 6 10 11 9 13 14 12 16 17 15 19 20 18 22 23 21 25 26 24 27 28 3 4 5 6 7 8 0 1 2 12 13 14 15 16 17 9 10 11 21 22 23 24 25 26 18 19 20 27 28 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 0 1 2 3 4 5 6 7 8 27 28 0 9 18 5 14 23 7 16 25 15 24 6 11 20 2 13 22 4 21 3 12 26 8 17 19 1 10 27 28 0 1 2 5 3 4 7 8 6 13 14 12 15 16 17 11 9 10 26 24 25 19 20 18 21 22 23 27 28

Orbit representatives

Each entry is mask:size, with bit ii of the mask the value of coordinate ii. A(24,6,12)≥5566A(24, 6, 12) \ge5566, group G24, 12 orbits:

163065:253 8494451:253 93115:506 8429007:506 8447663:506 304631:506 186015:506 8533467:506 180107:506 8433559:506 8426487:506 73691:506

A(27,6,11)≥19305A(27, 6, 11) \ge19305, group G27, 13 orbits:

828029:702 276441:702 16115:702 338663:702 2367379:702 357345:1053 308202:2106 325843:2106 315189:2106 309622:2106 288506:2106 861172:2106 305343:2106

A(27,6,12)≥24453A(27, 6, 12) \ge24453, group G27, 18 orbits:

4095:234 875406:351 2472277:351 834262:351 113885:351 114099:351 866021:702 2432915:702 842343:2106 837500:2106 863732:2106 351730:2106 844509:2106 382649:2106 316405:2106 310899:2106 292787:2106 812007:2106

A(28,6,10)≥18642A(28, 6, 10) \ge18642, group G28, 14 orbits:

134218239:39 134507910:351 804047:702 308124:702 39417:702 29547:702 134255837:702 273393:2106 274150:2106 313579:2106 277619:2106 134485718:2106 134485817:2106 134231924:2106

A(28,6,9)≥11154A(28, 6, 9) \ge11154, group H28, 18 orbits:

511:39 112420:117 37814:117 39416:351 113740:351 134486484:351 134330885:351 134219486:351 134233868:351 134257091:351 40711:1053 283223:1053 286353:1053 281073:1053 287604:1053 265845:1053 134483426:1053 134256356:1053

A(29,6,10)≥27183A(29, 6, 10) \ge27183, group H29, 39 orbits:

29621:351 48310:1053 65161:351 113601:351 267251:1053 269199:1053 276970:1053 286628:1053 289466:1053 293573:1053 351779:351 373644:351 391720:1053 829583:1053 134218239:39 134223535:1053 134256703:351 134330148:117 134331468:351 134481658:1053 134487657:1053 134495043:351 134502571:1053 134563780:351 268443215:1053 268467793:351 268473565:351 268473710:351 268473779:351 268549410:351 268699622:1053 268708651:1053 268716515:1053 268717166:1053 268727573:351 40265517:351 402667203:351 402692834:1053 402918742:1053

A(29,6,11)≥42042A(29, 6, 11) \ge42042, group G29, 28 orbits:

30571:702 48535:2106 272318:2106 285658:2106 292975:2106 304087:2106 312190:2106 805358:2106 830434:702 2427851:702 134257148:702 13442807:2106 134493052:2106 134510937:2106 134531017:2106 268476199:1053 268710646:2106 268711271:2106 268713874:2106 268715479:2106 268729621:702 402653695:39 402667350:2106 402690998:234 402691438:702 402925755:2106 402943366:351 402970826:351

A(29,6,9)≥14781A(29, 6, 9) \ge14781, group H29, 19 orbits:

511:39 13942:1053 40235:1053 113600:351 266029:1053 271226:1053 282561:1053 290182:351 134222819:1053 134233681:351 134258202:1053 134485829:1053 268437214:351 268483160:1053 268548611:351 268707129:1053 268715625:1053 402658005:1053 402692548:351

A(28,6,10)≥19110A(28, 6, 10) \ge19110, group H28, 28 orbits:

29547:351 39417:351 40906:1053 65298:351 113210:351 113747:1053 269235:1053 271739:1053 275417:351
275956:351 285870:1053 289242:351 290630:1053 305779:1053 337836:1053 448145:351 134218239:39
134221555:351 134250065:351 134256342:1053 134256703:351 134330148:117 134481767:1053
134485406:1053 134486844:1053 134494085:1053 134495043:351 134524556:1053

A(27,6,12)≥24804A(27, 6, 12) \ge24804, group G27, 15 orbits:

4095:234 48827:1053 277855:2106 307966:2106 314350:2106 316349:2106 321462:2106 326547:2106
339897:2106 354261:2106 792503:2106 818629:1053 839079:2106 1873117:702 1873262:702

A(28,6,9)≥11388A(28, 6, 9) \ge11388, group H28, 18 orbits:

511:39 38323:351 39416:351 40711:1053 112420:117 113740:351 265845:1053 281073:1053 283223:1053
286353:1053 287604:1053 134219486:351 134233868:351 134256356:1053 134257091:351 134330885:351
134483426:1053 134486484:351

A(27,6,13)≥27783A(27, 6, 13) \ge27783, group G27, 17 orbits:

360093:2106 375479:2106 386989:1053 448221:351 817567:2106 825599:2106 833387:2106 847566:2106
873342:2106 884133:2106 916262:2106 1874922:2106 1895651:351 2407397:2106 2408348:702 2450679:2106
3974005:54

Quantum stabilizers

Pauli strings; character ii acts on qubit ii. Release files quantum/q*-paulis.txt. [[20,11,4]][[20,11,4]], 9 generators:

YZIIZZIZIXZXZXZYZXXX
IYZIIIIZIZYIZYYZZZZI
ZIXZZZZZIXXIZYYIZIXI
ZIIYZIIIIZIZYIZYYZZZ
ZZZIYIZIZYZIYXIIXXYX
ZZZIIYZIIIIZIZYIZYYZ
IIIZIZYIZYYZZZZIIYZI
IIZZIZIXZXZXZYZXXXYZ
ZIIIIZIZYIZYYZZZZIIY

[[43,32,4]][[43,32,4]], 11 generators:

YZIIIIIIIIIXYXYZZZXIXXZYIYYIIZZIYXXIYXXYZYI
IXIZIIIIIIIXYIIYXIYZIXYZZIYYYZZZXXZXZXZZYIZ
ZZXIZZZZZIIZXXXZZXYIYIXIZIIXIYIZYZYXZIZZZII
IIZXIZIIIIIIIXYIIYXIYZIXYZZIYYYZZZXXZXZXZZY
ZIIZXIZZZZZIIZXXXZZXYIYIXIZIIXIYIZYZYXZIZZZ
ZIZIIYZIZIIZXXXYXXYYZIZZZXYYZYYXIIXYYXIYIXZ
ZZZIIZXIZZZZZIIZXXXZZXYIYIXIZIIXIYIZYZYXZIZ
ZIZZZIIYZIZXYZXZIYZYYZXZIZXZIXIXZIZXYZXYYYZ
ZIZZZIIZXIZZZZZIIZXXXZZXYIYIXIZIIXIYIZYZYXZ
ZZZZZZZIIYZXXXYXIZYXZZIIYZYXZIZYXIIXIIXIZYX
ZIZZZZZIIZXXXZZXYIYIXIZIIXIYIZYZYXZIZZZIIZX

References

  1. [1]E. Agrell, A. Vardy, and K. Zeger. Upper bounds for constant-weight codes. IEEE Trans. Inform. Theory, 46:2373–2395, 2000.
  2. [2]M. R. Best, A. E. Brouwer, F. J. MacWilliams, A. M. Odlyzko, and N. J. A. Sloane. Bounds for binary codes of length less than 25. IEEE Trans. Inform. Theory, 24:81–93, 1978.DOI
  3. [3]M. Braun, J. Humpich, A. Laaksonen, and P. R. J. Östergård. New lower bounds on binary constant weight error-correcting codes. J. Combin. Math. Combin. Comput., 111:213–224, 2019.
  4. [4]A. E. Brouwer. Bounds for binary constant weight codes. https://aeb.win.tue.nl/codes/Andw.html. Live table; snapshots fetched 2026-10-15 01:50:51 UTC and 10:44:13 UTC.
  5. [5]A. E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith. A new table of constant weight codes. IEEE Trans. Inform. Theory, 36:1334–1380, 1990.DOI
  6. [6]A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane. Quantum error correction via codes over GF(4). IEEE Trans. Inform. Theory, 44:1369–1387, 1998.
  7. [7]W. Echols. New lower bounds for constant-weight codes via seeded bit-swap tabu search. arXiv:2608.13906, 2026.arxiv.org/abs/2608.13906
  8. [8]R. L. Graham and N. J. A. Sloane. Lower bounds for constant weight codes. IEEE Trans. Inform. Theory, 26:37–43, 1980.DOI
  9. [9]M. Grassl. Bounds on the minimum distance of linear codes and quantum codes. https://codetables.de. Qubit table, q = 4; cells [[20, 11]] and [[43, 32]] fetched 2026-10-15 01:56:21 UTC.
  10. [10]L. Jin and C. Xing. New binary codes from rational function fields. IEEE Trans. Inform. Theory, 61(1):60–65, 2015. doi:10.1109/TIT.2014.2352306.DOI
  11. [11]B. G. Kang, H. K. Kim, and P. T. Toan. Improved linear programming bounds on sizes of constant-weight codes. arXiv:1108.5104, 2011.arxiv.org/abs/1108.5104
  12. [12]C. Lysenstøen. New lower bounds for binary constant-weight codes: A(23, 6, 10) ≥ 2979 and A(24, 6, 10) ≥ 4214. arXiv:2607.19550, 2026.
  13. [13]K. J. Nurmela, M. K. Kaikkonen, and P. R. J. Östergård. New constant weight codes from linear permutation groups. IEEE Trans. Inform. Theory, 43:1623–1630, 1997.
  14. [14]A. Gippini Requeijo. Two new lower bounds for binary constant weight codes: A(29, 6, 9) ≥ 14313 and A(29, 6, 10) ≥ 25896. Zenodo, https://doi.org/10.5281/zenodo.23075335, 2026.
  15. [15]C. D. Rosin. Automated discovery of improved constant weight binary codes. arXiv:2603.00174, 2026.arxiv.org/abs/2603.00174

Paper details

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

views · 1

downloads · 0

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

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents