EnglishEN

OPTES research · Mathematics

21 new records in mathematics

The OPTES search engine found 21 binary codes larger than the best published in the world table of constant-weight codes kept by Andries Brouwer. 18 of them are now the record in that table, credited to Mohammed Riyadh (OPTES).

21codes larger than the published record, each one passed two independent checkers
18cells of the world table now hold an OPTES record
9136 → 9474A(46,8,8): the largest jump credited in the table, and we hold a larger code still: 9704

In the background: real codewords from our A(46,8,8) code.

What is the problem?

Take words of zeros and ones, each n positions long with exactly w ones. How many words can you collect at most, if any two of them must differ in at least d positions? That number is written A(n,d,w).

These numbers are basic to coding theory and error correction, and most of their exact values are still unknown. Each cell has a lower bound, the largest code anyone has found, and an upper bound that cannot be passed. Everything on this page raises a lower bound.

nword length
dsmallest difference between any two words
wones in every word

An example from our A(46,8,8) code: two of its 9704 words, 8 ones each, differing in exactly 8 positions (lit). That is the least the rule allows.

0011001100111100000000000000000000000000000000
0000110011111100000000000000000000000000000000

Credited in the world table 18

In Brouwer's table these cells now show our code as the record, with the reference «Riy: Mohammed Riyadh (OPTES)». Values as in the table update of 22 November 2026; the arrow goes from the previous record to the one credited now.

A(n,6,6)4 cells

A(46, 6, 6)

75807581

+1

Known upper bound: 10626

A(51, 6, 6)

1181911827

+8

Known upper bound: 16660

We verified a larger code: 11832, not sent yet.

A(52, 6, 6)

1261912638

+19

Known upper bound: 17680

We verified a larger code: 12647, not sent yet.

A(54, 6, 6)

1470814709

+1

Known upper bound: 21069

A(n,8,7)9 cells

A(48, 8, 7)

28892890

+1

Known upper bound: 5424

A(49, 8, 7)

33123313

+1

Known upper bound: 5768

A(50, 8, 7)

34703472

+2

Known upper bound: 6121

A(51, 8, 7)

36283631

+3

Known upper bound: 7038

We verified a larger code: 3632, not sent yet.

A(52, 8, 7)

38013804

+3

Known upper bound: 7577

A(53, 8, 7)

42074208

+1

Known upper bound: 8003

A(54, 8, 7)

47284729

+1

Known upper bound: 8447

A(57, 8, 7)

60236025

+2

Known upper bound: 10862

A(59, 8, 7)

64386441

+3

Known upper bound: 12870

We verified a larger code: 6443, not sent yet.

A(n,8,8)5 cells

A(40, 8, 8)

37523755

+3

A(42, 8, 8)

52045208

+4

We verified a larger code: 5214, not sent yet.

A(43, 8, 8)

62486254

+6

We verified a larger code: 6258, not sent yet.

A(45, 8, 8)

81378140

+3

We verified a larger code: 8148, not sent yet.

A(46, 8, 8)

91369474

+338

We verified a larger code: 9704, not sent yet.

Verified by us, not yet in the table 11

These codes passed the same two checkers but have not been sent to the table's editor yet, so the table does not show them. Until they are added, their files below are the reference.

New cells, not sent yet3

A(42, 6, 6)

51405142

+2

In the table today: 5140 · Known upper bound: 7462

A(42, 8, 7)

13971398

+1

In the table today: 1397 · Known upper bound: 2952

A(52, 10, 7)

423424

+1

In the table today: 423 · Known upper bound: 630

Values above the ones credited to us8

A(42, 8, 8)

52085214

+6

Credited to us: 5208 · before us: 5204

A(43, 8, 8)

62546258

+4

Credited to us: 6254 · before us: 6248

A(45, 8, 8)

81408148

+8

Credited to us: 8140 · before us: 8137

A(46, 8, 8)

94749704

+230

Credited to us: 9474 · before us: 9136

A(51, 6, 6)

1182711832

+5

Credited to us: 11827 · before us: 11819

A(51, 8, 7)

36313632

+1

Credited to us: 3631 · before us: 3628

A(52, 6, 6)

1263812647

+9

Credited to us: 12638 · before us: 12619

A(59, 8, 7)

64416443

+2

Credited to us: 6441 · before us: 6438

Check it yourself

Each file is plain text, one word per line. Check three things: every line has length n, every line has w ones, and any two lines differ in at least d positions. The parameters and the word count are in the file name, as in A_46_8_8_9704.txt.

CellWordsStatusFileSHA-256
A(40,8,8)3755creditedA_40_8_8_3755.txt 150 KB1f4f63501d0486e8…
A(42,6,6)5142not sentA_42_6_6_5142.txt 216 KB0e89bc1ba029f5ab…
A(42,8,7)1398not sentA_42_8_7_1398.txt 59 KB4a771f4c1a71fbca…
A(42,8,8)5214above creditedA_42_8_8_5214.txt 219 KBbed08d0b2cdc7d0c…
A(43,8,8)6258above creditedA_43_8_8_6258.txt 269 KBac015ca5d8ee6abc…
A(45,8,8)8148above creditedA_45_8_8_8148.txt 366 KB77bb1edd5174633b…
A(46,6,6)7581creditedA_46_6_6_7581.txt 348 KB99582fda56c50019…
A(46,8,8)9704above creditedA_46_8_8_9704.txt 445 KBe63efeb92b740517…
A(48,8,7)2890creditedA_48_8_7_2890.txt 138 KBeb8312c21e7a7b6a…
A(49,8,7)3313creditedA_49_8_7_3313.txt 162 KBd125f6873dfcab71…
A(50,8,7)3472creditedA_50_8_7_3472.txt 173 KBa6859a7e76f127af…
A(51,6,6)11832above creditedA_51_6_6_11832.txt 601 KB44e323b9d4c5bb56…
A(51,8,7)3632above creditedA_51_8_7_3632.txt 184 KB430a5e5627fa184d…
A(52,6,6)12647above creditedA_52_6_6_12647.txt 655 KB6d2a15b9ebe59969…
A(52,8,7)3804creditedA_52_8_7_3804.txt 197 KB7946a82e4c40baa6…
A(52,10,7)424not sentA_52_10_7_424.txt 22 KBad2de968a97dcb7f…
A(53,8,7)4208creditedA_53_8_7_4208.txt 222 KB23dc25638e01ad20…
A(54,6,6)14709creditedA_54_6_6_14709.txt 790 KBe737d04a0614adb3…
A(54,8,7)4729creditedA_54_8_7_4729.txt 254 KB4430ccd2c970a162…
A(57,8,7)6025creditedA_57_8_7_6025.txt 341 KB5ab5f7918f3ac207…
A(59,8,7)6443above creditedA_59_8_7_6443.txt 378 KB5282355ac8a8e307…

A short program that checks any file (the large ones take minutes):

# python3 check.py A_46_8_8_9704.txt
import itertools, os, re, sys
f = sys.argv[1]
n, d, w, size = map(int, re.findall(r"\d+", os.path.basename(f))[-4:])
words = [l.strip() for l in open(f) if l.strip()]
assert len(words) == size == len(set(words))
assert all(len(x) == n and x.count("1") == w and set(x) <= {"0", "1"} for x in words)
v = [int(x, 2) for x in words]
m = min(bin(a ^ b).count("1") for a, b in itertools.combinations(v, 2))
print(size, "words, smallest distance", m, "OK" if m >= d else "FAIL")

Before publication every file passed two independent checkers: the first measures the difference between every two words, the second makes sure no w − d/2 + 1 positions are all ones in two different words.

Plainly

  • These are new record lower bounds, not complete solutions: the exact value of every cell is still an open problem.
  • The world table is the reference. If a number there changes after 22 November 2026, trust the table over this page: aeb.win.tue.nl/codes/Andw.html.
  • Found by the OPTES search engine on 21 and 22 November 2026; every code was checked before it was sent.
Results credited to Mohammed Riyadh (OPTES)Source: A. E. Brouwer's table of constant-weight codes, update of 22 November 2026