Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers

@article{Zinovik2008ComputingBC,
  title={Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers},
  author={Igor Zinovik and Daniel Kroening and Yury Chebiryak},
  journal={IEEE Transactions on Information Theory},
  year={2008},
  volume={54},
  pages={1819-1823}
}
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional properties that are of interest to a particular application, e.g., circuit testing, data compression, and computational biology. New distance-preserving and circuit codes are presented along with a complete list of equivalence classes of the coil-in-the-box codes for codeword length with respect to symmetry… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
16 Citations
24 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 24 references

A survey of combinatorial Gray codes

  • C. Savage
  • SIAM Rev., vol. 39, no. 4, pp. 605–629, 1997.
  • 1997
Highly Influential
7 Excerpts

Snake-in-the-box codes for dimension 7

  • K. J. Kochut
  • J. Comb. Math. and Comb. Comput., no. 20, pp. 175…
  • 1996
Highly Influential
4 Excerpts

On automorphisms of cycles in the binary n-cube

  • A. L. Perezhogin
  • (in Russian) Diskretnyi Analiz i Issledovanie…
  • 2007
1 Excerpt

Similar Papers

Loading similar papers…