binary_repetition_code
def
For an explicit natural number n, the binary repetition code binary_repetition_code n is the Finset (Fin n → Fin 2) containing the constant zero function and the constant one function: {(fun _ => 0), (fun _ => 1)}.
Statement
def binary_repetition_code (n : ℕ) : Finset (Fin n → Fin 2)- Defined in
- arXiv:2611.18156 Section IV-A
- Verified
- 16 Nov 2026
- Axioms
- none listed
- Used by 3
- binary_repetition_code_is_joint_error_correcting_detectingFor an explicit natural number n with 2 ≤ n and natural numbers c, c' such that 2 * c + c' + 1 = n,
binary_repetition_code nis a (c,… - binary_repetition_code_is_joint_perfect_codeFor an explicit natural number n with 2 ≤ n and natural numbers c, c' such that 2 * c + c' + 1 = n, the binary repetition code of length n…
- binary_repetition_code_cardFor an explicit natural number n with 1 ≤ n, the cardinality of the finite set
binary_repetition_code nis 2.
- binary_repetition_code_is_joint_error_correcting_detectingFor an explicit natural number n with 2 ≤ n and natural numbers c, c' such that 2 * c + c' + 1 = n,
Read back from the Lean
The definition binary_repetition_code, parameterized by a natural number $n$, is the finite set of functions from Fin n to Fin 2 consisting of two elements: the constant function mapping every element to $0$, and the constant function mapping every element to $1$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The binary repetition code of length n consisting of the all-zeros and all-ones words as a Finset. -/ def binary_repetition_code (n : ℕ) : Finset (Fin n → Fin 2) := {(fun _ => 0), (fun _ => 1)}