Generalized Gray codes

Generalized Gray codes

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)...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of 2004 International Symposium on Intelligent Signal Processing and Communication Systems, 2004. ISPACS 2004 pp. 654 - 659
Main Authors: Sankar, K.J., Pandharipande, V.M., Moharir, P.S.
Format: Conference Proceeding
Language:English
Published: IEEE 2004
Subjects:
Binary codes
Educational institutions
Reflective binary codes
Shafts
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISBN:9780780386396
0780386396
DOI:10.1109/ISPACS.2004.1439140