21. As the name implies, this type of Gray code uses non-Boolean values in its encodings. 22. In this generalized sense, the Steinhaus Johnson Trotter algorithm generates a Gray code for the permutations themselves. 23. The Johnson counter generates a Gray code , a code in which adjacent states differ by only one bit. 24. For counters, Gray coding gives minimum switching activity, and thus is suitable for low-power designs. 25. Martin Gardner wrote a popular account of the Gray code in his August 1972 Mathematical Games column in Scientific American. 26. The bits of the Gray code of i, G ( i ), are used to select direction numbers. 27. The example shown here is for 8-PSK, which has also been given a Gray coded bit assignment. 28. #How many " non-trivially distinct " Gray codes of a given alphabet size and codeword length exist? 29. Gray codes are used in position encoders ( linear encoders and rotary encoders ), in preference to straightforward binary encoding.30. Rotary encoders benefit from the cyclic nature of Gray codes , because consecutive positions of the sequence differ by only one bit.
