DocumentCode :
939348
Title :
Some new bounds for the maximum length of circuit codes (Corresp.)
Author :
Deimer, Knut
Volume :
30
Issue :
5
fYear :
1984
fDate :
9/1/1984 12:00:00 AM
Firstpage :
754
Lastpage :
756
Abstract :
A 
-dimensional circuit code of spread 
is a simple circuit 
in the graph of the -dimensional unit cube with the property that for any vertices 
and 
of that differ in exactly 
coordinates 
, there exists a path from to consisting of edges of . Some new lower bounds will be given for the maximum length of a -dimensional circuit code of spread for some values of and for 
, and 
.
-dimensional circuit code of spread is a simple circuit in the graph of the -dimensional unit cube with the property that for any vertices and of that differ in exactly coordinates , there exists a path from to consisting of edges of . Some new lower bounds will be given for the maximum length of a -dimensional circuit code of spread for some values of and for , and .Keywords :
Coding/decoding; Graph theory; Analog-digital conversion; Circuits;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1984.1056958
Filename :
1056958
Link To Document :
