ErrorCorrectingCodes.Codeword.Code
abbrevimported Lean
A (block) code of length $n$ over $\alpha$ is a finite set (Finset) of codewords.
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 abbrev ErrorCorrectingCodes.Codeword.Code (n : ℕ) (α : Type*) [Fintype α] [DecidableEq α]
- Defined in
- TCSlib, `ErrorCorrectingCodes.Codeword.Code`
- 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.Code← ErrorCorrectingCodes.Codeword.Code (TCSlib/ErrorCorrectingCodes/Basic.lean:88): 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 10
- 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_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.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.distance
distance C dholds when $d$ is the minimum Hamming distance of $C$: there exist distinct codewords at distance exactly $d$, and… - 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 /-- A code of block-length `n` over `α`: a finite set of codewords. -/ abbrev ErrorCorrectingCodes.Codeword.Code (n : ℕ) (α : Type*) [Fintype α] [DecidableEq α] := Finset (Codeword n α)