ErrorCorrectingCodes.Codeword.add
defimported Lean
Pointwise addition of two 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 @[simp] def ErrorCorrectingCodes.Codeword.add (c₁ c₂ : Codeword n α) : Codeword n α
- Defined in
- TCSlib, `ErrorCorrectingCodes.Codeword.add`
- 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.add← ErrorCorrectingCodes.Codeword.add (TCSlib/ErrorCorrectingCodes/Basic.lean:77): 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 4
- 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.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…
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 /-- Pointwise addition of two codewords. -/ @[simp] def ErrorCorrectingCodes.Codeword.add (c₁ c₂ : Codeword n α) : Codeword n α := fun i ↦ (c₁ i + c₂ i)