FA-72337 / Error-correcting codes / Member archive

Bounded-distance decoder accepts any distance · case 02

Heavily corrupted words are decoded instead of flagged.

Member previewVariant 2 · 3 implementations · 8 checks per implementation

Case contract

Bounded-distance decoding against an explicit codebook (duplicate entries allowed). Find the codeword at minimum Hamming distance from r; if two different codewords tie for the minimum, or the minimum exceeds radius, return None. Otherwise return [codeword, distance].

Why this case matters

Short control-channel codes are decoded against small codebooks; ties must be reported as failures, not guessed.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
regression [[[0, 0, 0, 0, 0], [1, 1, 1, 0, 0], [0, 0, 1, 1, 1], [1, 1, 0, 1, 1...	`[[1, 1, 0, 1, 1], 1]`	`null`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.