bibkey: macwilliams1977binaryrepetition authors: F. J. MacWilliams and N. J. A. Sloane year: 1977 title: “The Theory of Error-Correcting Codes” doi: null url: https://archive.org/details/theoryoferrorcor00macw claim: “Chapter 1 supplies the binary repetition-code complement argument used to choose the unique odd-length short support.” strata_touched: [] license: citation-only triage: anchor

Binary repetition-code short supports

Chapter 1 gives the standard binary support/complement viewpoint: for an odd repetition length, complementary representatives have different sizes, so exactly one has size at most half. The repository theorem uses this combinatorial input together with its independently proved seven-section kernel relation. This citation does not supply a VOA or fusion realization.

Verified locator

• MacWilliams–Sloane, The Theory of Error-Correcting Codes, Chapter 1: https://archive.org/details/theoryoferrorcor00macw

The archive scan is the canonical locator for the cited chapter; the Lean theorem uses only the elementary complement argument and does not claim any result beyond that finite coding theory input.