Papex

Open problem · Mathematics · Open

Binary constant-weight codes A(n, d, w)

What is A(n, d, w), the largest number of binary words of length n, each with exactly w ones, any two differing in at least d places?

Summary

A(n, d, w) is a basic quantity of coding theory. A. E. Brouwer keeps a table of the best known lower and upper bounds for small parameters, with links to explicit codes; people send improved codes to the table's maintainer by e-mail.

Source

Open, as listed by A. E. Brouwer, table of constant weight codes · Bounds for binary constant weight codes. Checked 19 Nov 2026.

The status is the source’s. Papex does not decide whether a problem is solved.

Records on this problem

No public record addresses this problem yet.

More in Mathematics