ErrorCorrectingCodes.Codeword.hamming_ball
defimported Lean
The Hamming ball of radius $l$ around $c$:
\[
B_l(c) = \{c' : d(c',c) \le l\},
\]
implemented as a Finset.
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 @[simp] def ErrorCorrectingCodes.Codeword.hamming_ball (l : ℕ) (c : Codeword n α) : Finset (Codeword n α)
- Defined in
- TCSlib, `ErrorCorrectingCodes.Codeword.hamming_ball`
- 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_ball← ErrorCorrectingCodes.Codeword.hamming_ball (TCSlib/ErrorCorrectingCodes/Basic.lean:173): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 2
- ErrorCorrectingCodes.Codeword.hamming_distanceHamming distance between two codewords, wrapping Mathlib's
hammingDist. - ErrorCorrectingCodes.CodewordA codeword of length $n$ over alphabet $\alpha$ is a function $c : \mathrm{Fin}\,n \to \alpha$.
- ErrorCorrectingCodes.Codeword.hamming_distanceHamming distance between two codewords, wrapping Mathlib's
- 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.list_decodableA code $C$ is $(\rho,L)$-list-decodable if every Hamming ball of radius $\lfloor\rho n\rfloor$ contains at most $L$ codewords of $C$.
- 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.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…
- ErrorCorrectingCodes.Codeword.exists_listDecodable_codeExistence of list-decodable codes. Let $\alpha$ be a finite field, and fix natural numbers $n$, $L$, $M$ and a real number $p$ with…
- ErrorCorrectingCodes.Codeword.hamming_ball_size_asymptotic_upper_boundEntropy upper bound on Hamming balls. Let $\alpha$ be a finite alphabet with at least two symbols, write $q = \abs{\alpha}$ for its size,…
- 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.gv_boundGilbert–Varshamov bound for linear codes. Let $\alpha$ be a finite field with $q = \abs{\alpha}$ elements, and let $n, k, d$ be natural…
- 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…
- 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 ball of radius `l` centred at codeword `c`: the set of codewords within Hamming distance `l` of `c`. -/ @[simp] def ErrorCorrectingCodes.Codeword.hamming_ball (l : ℕ) (c : Codeword n α) : Finset (Codeword n α) := {c' : Codeword n α | hamming_distance c' c ≤ l}.toFinset