DocumentCode
3328648
Title
Generalized Gray codes
Author
Sankar, K. Jaya ; Pandharipande, V.M. ; Moharir, P.S.
Author_Institution
Dept. of ECE, Vasavi Coll. of Eng., Hyderabad, India
fYear
2004
fDate
18-19 Nov. 2004
Firstpage
654
Lastpage
659
Abstract
A more generalized method is presented to enumerate a sequence of all codewords in the (n,r) Gray code. As a generalization, we refer to a bit as git. When the last codeword differs with the first codeword in exactly one element, then the code is said to be cyclic. An algorithm to generate the (n,r) Gray code is presented. As an example, constructional details of a generalized binary Gray code and a generalized ternary Gray code are considered. The generalized (n,r) Gray code is cyclic.
Keywords
Gray codes; binary codes; cyclic codes; ternary codes; binary code; code generation; codeword sequence; cyclic code; generalized Gray codes; ternary code; Binary codes; Educational institutions; Reflective binary codes; Shafts;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Signal Processing and Communication Systems, 2004. ISPACS 2004. Proceedings of 2004 International Symposium on
Print_ISBN
0-7803-8639-6
Type
conf
DOI
10.1109/ISPACS.2004.1439140
Filename
1439140
Link To Document