Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers

DOI10.1109/TIT.2008.917695zbMATH Open1328.94095DBLPjournals/tit/ZinovikKC08OpenAlexW2160361593WikidataQ63549362 ScholiaQ63549362MaRDI QIDQ3604537FDOQ3604537

Authors: Igor Zinovik, Daniel Kroening, 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)

Cited In (8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604537)