By Topic

A Nonconventional Approach to Generating Efficient Binary Gray Code Sequences

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)
A. Ahmad ; Dept. of Electrical and Computer Engineering, Sultan Qaboos University, Muscat, 123, Sultanate of Oman ; F. Bait-Shiginah

The gray codes are named after Frank Gray, who patented (U.S. Patent 2 632 058) the use of them in shaft encoders in 1953. Because of the reflection property of the code, sometimes the term Gray code is used to refer to reflected binary codes. The Gray codes are cycling in nature and maintain the unit hamming distance between one code word to the next code word. To visualize the attributes of reflection property, cyclic nature and unit hamming distance of Gray codes, Fig. 1 can be referred to where the binary Gray code patterns G(n) for size n51 to 4 b are depicted.

Published in:

IEEE Potentials  (Volume:31 ,  Issue: 3 )