Almost johnson choose 2 elimed
JohnsonBound.almost_johnson_choose_2_elimed
Plain-language statement
choose_2-free form of almost_johnson.
Source project: ArkLib
Person-level attribution pending.
Source-pinned research
Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.
This index contains 423 research declarations. Search 10,000 more complete Mathlib declarations.
423 results
Clear filtersJohnsonBound.almost_johnson_choose_2_elimed
Plain-language statement
choose_2-free form of almost_johnson.
Source project: ArkLib
Person-level attribution pending.
JohnsonBound.almost_johnson_lhs_div_B_card
Plain-language statement
LHS of the almost-Johnson bound divided by |B| in terms of e and d.
Source project: ArkLib
Person-level attribution pending.
JohnsonBound.d_eq_sum
Plain-language statement
The average distance d expressed as a double sum of coordinate disagreements.
Source project: ArkLib
Person-level attribution pending.
JohnsonBound.johnson_condition_strong_implies_2_le_B_card
Plain-language statement
The strong Johnson condition forces the code to have at least two codewords.
Source project: ArkLib
Person-level attribution pending.
JohnsonBound.johnson_condition_weak_implies_strong
Plain-language statement
The weak Johnson condition implies the strong one on the ball intersection.
Source project: ArkLib
Person-level attribution pending.
JohnsonBound.johnson_d_le_n
Plain-language statement
The average pairwise distance d(B) is at most n.
Source project: ArkLib
Person-level attribution pending.