AFTD Auto-Formalizing Theoretical Domains

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.
Verified
07 Oct 2026
Axioms
none listed
Built on 2
Used by 6

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)
See it in the graphDiscuss this resultChallenge it