trureturingGitHub MATHEMATICAL ATLAS

Arith / CONCEPT

Exact Residue-Code Minimum Distance

The minimum Hamming distance of a bounded residue code is determined exactly by the largest product-bounded coordinate subset.

Closed Authored exposition
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH1
DOCUMENT LINKS1
THEOREM

Exact residue-code minimum distance

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Dynamic Range and Minimum Distance of Residue CodesDynamic Range and MinimumDistance of Residue CodesExact Residue-Code Minimum DistanceExact Residue-Code MinimumDistanceFull CRT Dynamic Range Has No Correction MarginFull CRT Dynamic Range Has NoCorrection Margin
Proof dependencyStructural affinityDocument link

RELATED KNOWLEDGE

Structural connections

Documents & exposition

Other authored & advisory relationships

None recorded in this release.

LIBRARY / RELEASE VERSIONS

Content history

Loading release versions...
Browse the archive

Certified provenance

Exact release coordinate

Lean sourceResearch workspace
Status
Closed
Depth
1
Layer
D5/S3
Domain
Arith
Node ID
D5/S3/Arith/Coding/ExactResidueCodeMinimumDistance
Repository path
D5/S3/Arith/Coding/ExactResidueCodeMinimumDistance.lean
Truth release
sha256:c0d04258d27972c1cf58485e21d64dbcbe336405346ba95133913c64ba2856aa
Source commit
745bf90812f7175f83e1235688249f9495f23bfc
Source tree
143bc6c9ab9054c406f0cdd7f3b296eb38768b5c

Authority boundary

Dependency edges, status, and source coordinates come from the verified release and certified topology. Blueprint exposition is labeled separately. A fallback title carries no additional mathematical authority.