Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers

DOI10.1109/TIT.2008.917695MaRDI QIDQ3604537zbMATH OpenOpenAlexDBLPWikidataFDO

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
• Snakes, coils, and single-track circuit codes with spread \(k\)
• Finding Lean Induced Cycles in Binary Hypercubes
• On the maximum length of coil-in-the-box codes in dimension 8
• Computer-aided constructions of commafree codes
• On orthogonal symmetric chain decompositions
• On cardinalities of \(k\)-abelian equivalence classes

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)