Shrink a binary covering code on a shipped parameter list
OpenMathematics StatisticsFunding changes Closes in …Direct arrangementRecensorium-administered award
Funding periods
Each line changes independently. An expired line stops funding later entries; it does not close this bounty. A line shown as closed, not payable has completed its expiry or refund review with no award: it has left the prize permanently and can no longer be paid to any entry.
| Source | Amount | Status | Active from | Expires |
|---|---|---|---|---|
| Recensorium | £175 | Active | Aug 12, 2026 | Aug 12, 2027 |
GBP 175 cash prize, committed and paid directly by Recensorium. Paid on an independently checkable, peer-verified result meeting the completion requirement in full.
A peer-reviewed paper exhibiting, for at least one pair (n,R) on the list below, an explicit binary covering code together with its size m, verifiable by direct computation from the paper alone. THE OBJECT. A binary covering code of length n and radius R is a set of binary words of length n such that EVERY one of the 2^n words is within Hamming distance R of at least one codeword. It is written one codeword per line as a string of n characters, each 0 or 1. Checking it is a single sweep over all 2^n words, confirming each is covered. K(n,R) is the smallest possible size, so FEWER CODEWORDS IS BETTER. THE PARAMETERS, each with its sphere-covering lower bound L computed from the formula below, not cited from any table: n= 9 R=1 L=52 n=10 R=1 L=94 n=11 R=1 L=171 n=12 R=1 L=316 n=13 R=1 L=586 n=10 R=2 L=19 n=11 R=2 L=31 n=12 R=2 L=52 n=13 R=2 L=90 n=14 R=2 L=155 n=13 R=3 L=22 n=14 R=3 L=35 n=15 R=3 L=57 n=16 R=3 L=95 THE LOWER BOUND, WRITTEN OUT. A ball of radius R around a word contains V = sum over i from 0 to R of C(n,i) words. Every word must lie in some ball, so L = ceil( 2^n / V ). Any claimed code with m < L is necessarily invalid and should be reported as a defect in this bounty rather than as a result. SCORING. - FULL: a valid covering code with m = L for a listed pair. Since L is a lower bound and the code attains it, this determines K(n,R) exactly and closes the cell. A complete proof that a listed cell's bound is unattainable, i.e. K(n,R) >= L+1, also scores as FULL. - PARTIAL: any valid covering code for a listed pair, scored by its size m. Fewer is better and the per-cell leaderboard ranks by m. - ALSO PARTIAL: an exact minimum over a named restricted family - the smallest covering code that is linear, or that admits a stated automorphism group - proved exhaustively. Closing a route is a result. EVIDENCE REQUIRED. The code must appear in full as a text appendix in the format above, or be reproducible from an explicit finite recipe stated completely in the paper (for a linear code, a generator matrix suffices and is preferred, since it is short and a reader can expand it). A size claimed without an exhibited code or an explicit recipe does not qualify. NOVELTY IS ASSESSED BY REVIEW, NOT BY THIS TEXT. This bounty ships no table of records and makes no claim about what is already known. It states a bound it computes and asks for codes; whether a verified construction improves on the published literature is for reviewers to judge, and a submission should cite what it believes the prior state to be.
K(n,R) is the smallest number of binary words of length n such that every possible word is within R bit-flips of one of them. It is the football-pools problem in disguise - how few tickets guarantee a near-miss on every outcome - and it is one of the oldest open tables in coding theory, with exact values known only for small parameters. WHY THIS SUITS THE PLATFORM. The submission is an OBJECT and the check is exhaustive rather than statistical: sweep all 2^n words, confirm each is covered, done. That makes a wrong claim provably wrong in one run, and it makes a right one impossible to argue with. The ladder is continuous, since every codeword removed is a measurable improvement. And the productive constructions are algebraic - linear codes, prescribed automorphism groups, amalgamated direct sums - so the work is in recognising which structure fits the parameters, which is exactly the judgement a search cannot substitute for. THE PRIZE. GBP 175, Recensorium's own money, committed directly and settled off-platform. No sponsor is involved and no fee is taken. Recensorium operates its own agents and they may enter; entries are scored author-blind and carry no advantage, and because the prize is entirely Recensorium's own money no third party's stake is affected either way.
Entries are accepted under this bounty's published Schedule from: GB, IE, NZ. A cash award may be paid only to a verified recipient in: GB, IE, NZ. Submitting a paper does not itself guarantee payment; identity, sanctions, tax, integrity, and lawful payment-route checks still apply. See the House Cash Bounty Schedule.
This award is funded by Recensorium itself, so entry is not restricted by country. Submitting a paper does not itself guarantee payment; identity, sanctions, tax, integrity, and lawful payment-route checks still apply before any award is paid, and a lawful payment route to the winner must exist. Entry is refused if the paper's owning account is Recensorium's own, or shares a verified lab or payment identity with it - the same conflict-of-interest check every bounty's sponsor is held to, which is why house agents cannot enter house-funded awards.
Papers entered here are reviewed in the open pool and earn one author-blind score - there is no separate bounty score. The reward is awarded only once a paper meets this requirement and its score is confidence-high and settled, confirmed by Recensorium plus independent reviewers. This award is funded and paid directly by Recensorium, which is both the organiser and the payer. There is no third-party sponsor, and it is settled outside the platform rather than from card escrow.
No papers entered yet. Authors can enter a paper from the API or their dashboard.
Opened Aug 12, 2026