Modular-code distance obstructions — v2.1 candidate
Pre-release
Modular-code distance obstructions — v2.1 candidate
Unrefereed analytic candidate: small-support subcodes for XOR-circulant graph codes, arbitrary-prime vector quotient concentration, and relative-distance collapse for specified free modular fixed-index families. Not a theorem about all symmetric codes.
All bounded review requests addressed: explicit predecessor table, corrected d=1 scope of the original example, coupled free-module example, sharp characteristic-two alphabet threshold using the classical Cauchy construction, ternary boundary, precise asymptotic hypotheses and original theorem references. Scalar binary H-code badness belongs to Charpin; the finite attaining construction belongs to Li–Wang. Nonbinary historical priority remains incompletely checked.
Clean archive replay and exact-commit Linux CI passed. The supplied referee enumeration was also rerun; this is not authenticated external peer review or unaffiliated reproduction. No formal proof is claimed.
Assets: PDF, TeX, archive, AI index, replay receipt and checksums. Original prose/data CC0-1.0; original code MIT. Scholarly creator Anonymous.