ErrorCorrectingCodes.Codeword.distance
defimported Lean
distance C d holds when $d$ is the minimum Hamming distance of $C$: there
exist distinct codewords at distance exactly $d$, and no two distinct codewords
are closer than $d$.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in set_option linter.unusedSectionVars false in open Set Filter Asymptotics Finset in variable {α : Type*} [Fintype α] [Nonempty α] [DecidableEq α] [Field α] in variable {n k : ℕ} in def ErrorCorrectingCodes.Codeword.distance (C : Code n α) (d : ℕ) : Prop
- Defined in
- TCSlib, `ErrorCorrectingCodes.Codeword.distance`
- Lean proof
- By Allan Li, Hydroxyi (from the file's git history), from github.com/Shilun-Allan-Li/tcslib at
c8a02591b1e5(Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.ErrorCorrectingCodes.Codeword.distance← ErrorCorrectingCodes.Codeword.distance (TCSlib/ErrorCorrectingCodes/Basic.lean:141): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 2
- ErrorCorrectingCodes.Codeword.hamming_distanceHamming distance between two codewords, wrapping Mathlib's
hammingDist. - ErrorCorrectingCodes.Codeword.CodeA (block) code of length $n$ over $\alpha$ is a finite set (
Finset) of codewords.
- ErrorCorrectingCodes.Codeword.hamming_distanceHamming distance between two codewords, wrapping Mathlib's
- Used by 6
- ErrorCorrectingCodes.Codeword.hamming_ball_non_intersectDisjointness of decoding balls around distinct codewords. Let $C$ be a code of length $n$ over a finite alphabet $\alpha$ whose minimum…
- ErrorCorrectingCodes.Codeword.hamming_boundHamming (sphere-packing) bound. Let $\alpha$ be a finite alphabet with $q = \abs{\alpha} > 1$ symbols, and let $C \subseteq \alpha^n$ be a…
- hamming_sphere_packing_boundHamming (sphere-packing) bound. Let alpha be a finite field with at least one element, and let C be a code of length n over alpha with…
- ErrorCorrectingCodes.Codeword.dist_le_lengthMinimum distance is at most the block length. Let $C$ be a code of length $n$ over an alphabet $\alpha$ — that is, a finite set of…
- ErrorCorrectingCodes.Codeword.singleton_boundLet $\alpha$ be a finite alphabet with at least two symbols, and let $C$ be a code of length $n$ over $\alpha$ — that is, a finite set of…
- ErrorCorrectingCodes.Codeword.hamming_ball'_disjointDisjointness of Hamming balls at minimum distance. Let $C$ be a code of length $n$ over an alphabet $\alpha$ whose minimum Hamming…
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in set_option linter.unusedSectionVars false in open Set Filter Asymptotics Finset in variable {α : Type*} [Fintype α] [Nonempty α] [DecidableEq α] [Field α] in variable {n k : ℕ} in /-- `distance C d` holds when `d` is the minimum Hamming distance of code `C`: there exist two distinct codewords at distance exactly `d`, and no two distinct codewords are closer. -/ def ErrorCorrectingCodes.Codeword.distance (C : Code n α) (d : ℕ) : Prop := (∃ x ∈ C, ∃ y ∈ C, x ≠ y ∧ hamming_distance x y = d) ∧ (∀ z ∈ C, ∀ w ∈ C, z ≠ w → hamming_distance z w ≥ d)