|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
On Generating the N-ary Reflected Gray Codes
August 1984 (vol. 33 no. 8)
pp. 739-741
| ASCII Text | x | ||
| M. C. Er, "On Generating the N-ary Reflected Gray Codes," IEEE Transactions on Computers, vol. 33, no. 8, pp. 739-741, August, 1984. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1984.5009360, author = {M. C. Er}, title = {On Generating the N-ary Reflected Gray Codes}, journal ={IEEE Transactions on Computers}, volume = {33}, number = {8}, issn = {0018-9340}, year = {1984}, pages = {739-741}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1984.5009360}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - On Generating the N-ary Reflected Gray Codes IS - 8 SN - 0018-9340 SP739 EP741 EPD - 739-741 A1 - M. C. Er, PY - 1984 VL - 33 JA - IEEE Transactions on Computers ER - | |||
The definition of the N-ary reflected Gray code is given. Two recursive algorithms for generating the N-ary reflected Gray codes are presented: one algorithm is coded directly from the definition; another algorithm is derived from the sequencing orders of digits in the N-ary reflected Gray codes. It is shown that these two algorithms are equivalent functionally. Furthermore, it is proven that the N-ary reflected Gray code is cyclic when its radix is even, but not cyclic, in general, when its radix is odd.
Citation:
M. C. Er, "On Generating the N-ary Reflected Gray Codes," IEEE Transactions on Computers, vol. 33, no. 8, pp. 739-741, Aug. 1984, doi:10.1109/TC.1984.5009360
Usage of this product signifies your acceptance of the Terms of Use.