Keyboard shortcuts

Press or to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Full CRT Blind Count and Distance

Abstract

The full product range has maximal blind-coordinate count one below its length and exact distance one.

Theorem 1.1 (Full CRT range has no coordinate-error margin).

Proof. Machine-checked in Lean as D5/S3/Arith/Coding/FullCRTBlindCountAndDistance.full_crt_blind_count_distance_and_detection_limit (✓ std3). ∎

Source. Repository-derived.

Commentary.

The blind-coordinate count is the canonical maximum over coordinate subsets whose modulus product lies below the message range. At the full product, every prefix omitting the last coordinate is admissible, while the complete coordinate set is not.

The resulting residue words are still injective on the complete range, so encoding remains unique. The attained minimum supplies two valid words separated in exactly one coordinate, showing that a single changed coordinate can be accepted as another valid word.

References