DocumentCode :
923775
Title :
An upper bound associated with errors in Gray code (Corresp.)
Author :
Cavior, S.
Volume :
21
Issue :
5
fYear :
1975
fDate :
9/1/1975 12:00:00 AM
Firstpage :
596
Lastpage :
596
Abstract :
Suppose 
. We prove that, if 
are encoded as binary Gray codewords whose Hamming distance is 
, then 
.
. We prove that, if are encoded as binary Gray codewords whose Hamming distance is , then .Keywords :
Gray codes; Bandwidth; Baseband; Block codes; Communication system control; Compaction; Frequency synchronization; Hamming distance; Reflective binary codes; Shafts; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1975.1055424
Filename :
1055424
Link To Document :
