Abstract
Gray coding is a variation on the way that integers are mapped on bit strings that ensures that consecutive integers always have Hamming distance one. A three bit Gray coding table is given in Table A.l, and the procedures for converting a binary number b = 〈b 1,..., b m〉, where m is the number of bits, into a Gray code number g = 〈g 1,..., g m〉 and vice versa in Table A.2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Eiben, A.E., Smith, J.E. (2003). Gray Coding. In: Introduction to Evolutionary Computing. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05094-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-662-05094-1_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07285-7
Online ISBN: 978-3-662-05094-1
eBook Packages: Springer Book Archive