Lean 4 formalization of q-ary covering code theory with certificate predicates for bounds on K_q(n,r) and a proof-carrying database of upper and lower bounds.
Upper bounds for q-ary covering codes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Formal Foundations and Proof-Carrying Certificates for q-ary Covering Codes in Lean 4
Lean 4 formalization of q-ary covering code theory with certificate predicates for bounds on K_q(n,r) and a proof-carrying database of upper and lower bounds.