DocumentCode
1367682
Title
Some new circuit codes
Author
Paterson, Kenneth G. ; Tuliani, Jonathan
Author_Institution
Dept. of Math., London Univ., UK
Volume
44
Issue
3
fYear
1998
fDate
5/1/1998 12:00:00 AM
Firstpage
1305
Lastpage
1309
Abstract
We present a new construction for snake-in-the-box codes and circuit codes. Our technique is based on arranging necklaces, i.e., equivalence classes of words under cyclic shifting, to form codes and gives 21 new codes of lengths 8-17, all having more words than the best previously known codes. Included among these are two snake-in-the-box codes: one of length 8 with 96 words, the other of length 10 with 340 words. We also report 15 new codes with small parameters. We prove the optimality of two of these codes and an already-known code. These last results were obtained using straightforward computer search
Keywords
codes; equivalence classes; search problems; circuit codes; code lengths; cyclic shifting; equivalence classes; necklace arranging; optimality; search; small parameters; snake-in-the-box codes; Analog-digital conversion; Circuits; Computer aided software engineering; Hamming distance; Information theory; Laboratories; Mathematics; Reflective binary codes; Sensor systems; Writing;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.669420
Filename
669420
Link To Document