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)
K. G. Paterson ; Dept. of Math., London Univ., UK ; J. Tuliani

Let n⩾1 and suppose C=W0,W1,…,W t-1 is a list of t length n binary words. For 1⩽k⩽n we say that C is a length n, spread k circuit code if for every i,j with 0⩽i,j<t, dH(Wi,Wi+1)=1, dH (Wi,Wj)<k⇒dc(Wi ,Wj)=dH(Wi,Wj) where subscripts are reduced modulo t, dH denotes Hamming distance and dc denotes the number of places between the two words in the list C. Codes of spread 2 are also known as snake-in-the-box codes. For given n and k, it is of interest to maximise the number of words in such a code, as this increases the resolution that can be achieved. We present a new construction for circuit codes, yielding many codes better than those previously known

Published in:

Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on

Date of Conference:

29 Jun-4 Jul 1997