covering-codes

Lean 4-verified lower bound for binary twofold covering codes: K(8,1,2) >= 61, plus an elementary even-n theorem improving five published bounds. First unknown term of OEIS A004045.

Lean 4 formalization of q-ary covering codes with a proof-carrying database of certified bounds for K_q(n,r)

GPU framework for covering-type combinatorial search: covering codes, dominating sets, multiple coverings

Certified length-70 binary (9,1) fixed-backbone theorem: every valid cover uses at most 60 distinct edges of one explicit 64-edge backbone; global bounds unchanged.

Certified K_2(11,3) search: verified 16-word cover; 112/150 normalized and 324/350 selected fourth-word closures; exact value remains open.