CodingTheory.Johnson.hdist
defimported Lean
For binary words $x,y$ of length $n$, the Hamming distance is the number of coordinates on which they differ: $\mathrm{hdist}(x,y) = \abs{\{\, i : x_i \neq y_i \,\}}$.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators RealInnerProductSpace in open Finset in noncomputable def CodingTheory.Johnson.hdist {n : ℕ} (x y : BitVec n) : ℕ
- Defined in
- TCSlib, `CodingTheory.Johnson.hdist`
- Lean proof
- By Allan Li, Frederick Dehmel, 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.CodingTheory.Johnson.hdist← CodingTheory.Johnson.hdist (TCSlib/ErrorCorrectingCodes/JohnsonBound.lean:34): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 1
- CodingTheory.Johnson.BitVecThe type of binary words of length $n$, namely functions $\mathrm{Fin}\,n \to \mathrm{Bool}$.
- Used by 4
- CodingTheory.Johnson.inner_shifted_le_exprUpper bound on the shifted inner product. Let $x$ and $y$ be binary words of length $n$, and let $\alpha \ge 0$. Suppose $d$ and $w$ are…
- CodingTheory.Johnson.inner_pmOne_pmOneInner product of two ±1 embeddings. For any two binary words $x, y$ of length $n$, let $\phi(x), \phi(y) \in \mathbb{R}^n$ be their…
- CodingTheory.Johnson.binary_johnson_card_bound_parametricJohnson cardinality bound, parametric form. Let $n \ge 1$, let $d, w$ be natural numbers, and let $C$ be a finite set of binary words of…
- CodingTheory.Johnson.binary_johnson_card_boundBinary Johnson cardinality bound. Let $n \ge 1$ and let $d$ be an integer with $1 \le d$ and $2d \le n$. Suppose $C$ is a finite set of…
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators RealInnerProductSpace in open Finset in noncomputable def CodingTheory.Johnson.hdist {n : ℕ} (x y : BitVec n) : ℕ := (Finset.univ.filter (fun i => x i ≠ y i)).card