By Topic

Some new circuit codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Paterson, K.G. ; Dept. of Math., London Univ., UK ; Tuliani, J.

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

Published in:

Information Theory, IEEE Transactions on  (Volume:44 ,  Issue: 3 )