FA-72218 / Error-correcting codes / Member archive

LT peeling releases only original degree-one symbols · case 03

Higher-degree symbols are never peeled, leaving many sources unresolved.

Member previewVariant 3 · 3 implementations · 8 checks per implementation

Case contract

Peeling (belief-propagation) decoder for an LT fountain code over bytes. symbols is a list of [neighbour indices, XOR of those source symbols]. Repeatedly find an encoded symbol with exactly one unresolved neighbour, resolve it as the value XOR all resolved neighbours, and continue until a full pass makes no progress. Return the k source values with None for unresolved ones.

Why this case matters

Broadcast and storage systems use fountain codes; peeling must continue as long as new degree-one symbols appear.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
regression [[[[2, 5], 36], [[1, 3, 4], 222], [[0, 1], 103], [[1, 3, 5], 190], ...	`[null, null, 25, null, null, 61]`	`[null, null, 25, null, 93, 61]`	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.