ErrorCorrectingCodes.Codeword.hamming_distance
defimported Lean
Hamming distance between two codewords, wrapping Mathlib's hammingDist.
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.hamming_distance (c1 c2 : Codeword n α) : ℕ
- Defined in
- TCSlib, `ErrorCorrectingCodes.Codeword.hamming_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.hamming_distance← ErrorCorrectingCodes.Codeword.hamming_distance (TCSlib/ErrorCorrectingCodes/Basic.lean:136): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 1
- ErrorCorrectingCodes.CodewordA codeword of length $n$ over alphabet $\alpha$ is a function $c : \mathrm{Fin}\,n \to \alpha$.
- Used by 13
- ErrorCorrectingCodes.Codeword.prob_leq_ball_sizeWeight distribution of a random linear image is dominated by a Hamming ball. Let $\alpha$ be a finite field, let $n$ and $k \ge 1$ be…
- ErrorCorrectingCodes.Codeword.existence_boundExistence bound via union bound. Let $\alpha$ be a finite nonempty field, let $n$ and $k$ be natural numbers with $k \ge 1$, and let $d$…
- 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_ball_sizeCardinality of Hamming balls. Let $\alpha$ be a finite alphabet, and regard a codeword of length $n$ as a function…
- ErrorCorrectingCodes.Codeword.list_decoding_capacityList-decoding over a q-ary alphabet. Let $\alpha$ be a finite field, write $q = \abs{\alpha}$ for the number of its elements, and fix a…
- ErrorCorrectingCodes.Codeword.hamming_ballThe Hamming ball of radius $l$ around $c$: \[ B_l(c) = \{c' : d(c',c) \le l\}, \] implemented as a
Finset. - ErrorCorrectingCodes.Codeword.distance
distance C dholds when $d$ is the minimum Hamming distance of $C$: there exist distinct codewords at distance exactly $d$, and… - ErrorCorrectingCodes.Codeword.weightThe Hamming weight of $c$ is $d(c, \mathbf{0})$.
- 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…
- hamming_ball_card_eq_zeroTranslation invariance of Hamming ball size. Let alpha be a finite field, and let c be a codeword of length n over alpha. Then for any…
- 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 /-- The Hamming distance between two codewords. -/ def ErrorCorrectingCodes.Codeword.hamming_distance (c1 c2 : Codeword n α) : ℕ := hammingDist c1 c2