Conference item icon

Conference item

An efficient SAT encoding of circuit codes

Abstract:
Circuit codes in hypercubes are generalized snake-in-the-box codes and are used in analog-to-digital conversion devices. The construction of the longest known circuit codes is based on either an exhaustive search or an algorithm that restricts the search to the codes with periodic coordinate sequences. In this paper, we describe an efficient SAT encoding of circuit codes, which enabled us to obtain new circuit codes.
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Publisher copy:
10.1109/ISITA.2008.4895595

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
Publisher:
IEEE
Host title:
2008 International Symposium on Information Theory and its Applications
Journal:
2008 International Symposium on Information Theory and Its Applications More from this journal
Publication date:
2008-12-01
DOI:
ISBN:
9781424420698
Keywords:
Pubs id:
pubs:327240
UUID:
uuid:61e3a6ed-fee6-4543-9509-b3c5ce71cf3e
Local pid:
pubs:327240
Source identifiers:
327240
Deposit date:
2017-01-28

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP