FA-71897 / Error-correcting codes / Member archive

Repetition decoder reads interleaved copies · case 02

Multi-bit messages decode into scrambled bits.

Member previewVariant 2 · 3 implementations · 8 checks per implementation

Case contract

Decode an n-fold repetition code sent in contiguous blocks of n symbols; each received symbol is 0, 1 or None (erasure). Erasures do not vote. The bit is the majority of non-erased symbols; a tie (including an all-erased block) yields None. fixed_count counts non-erased symbols outvoted in decided blocks. A length that is not a multiple of n, or n < 1, returns None. Return [bits, fixed_count].

Why this case matters

Robust control channels repeat critical flags and must treat erased symbols differently from zeros.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
regression [[1, 0, 0, 1, 1, 0], 3]	`[[1, 0], 2]`	`[[0, 1], 2]`	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.