Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers

DOI10.1109/TIT.2008.917695zbMath1328.94095DBLPjournals/tit/ZinovikKC08OpenAlexW2160361593WikidataQ63549362 ScholiaQ63549362MaRDI QIDQ3604537

Daniel Kroening, Igor Zinovik, Yury Chebiryak

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2008.917695

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial codes (94B25)

Related Items (7)

Computer-aided constructions of commafree codes ⋮ On the maximum length of coil-in-the-box codes in dimension 8 ⋮ On cardinalities of \(k\)-abelian equivalence classes ⋮ Finding Lean Induced Cycles in Binary Hypercubes ⋮ On orthogonal symmetric chain decompositions ⋮ The maximum length of circuit codes with long bit runs and a new characterization theorem ⋮ Snakes, coils, and single-track circuit codes with spread \(k\)

This page was built for publication: Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers