@article{Ahmad_Bait Suwailam_2009, title={A Less Complex Algorithmic Procedure for Computing Gray Codes}, volume={6}, url={https://journals.squ.edu.om/index.php/tjer/article/view/62}, DOI={10.24200/tjer.vol6iss2pp12-19}, abstractNote={<p class="p1"> The purpose of this paper is to present a new and faster algorithmic procedure for generating the <strong>n</strong> bi Gray codes. Thereby, through this paper we have presented the derivation, design and implementation of a newly developed algorithm for the generation of an n-bit binary reflected Gray code sequences. The developed algorithm is stemmed from the fact of generating and properly placing the min-terms from the universal set of all the possible min-terms [m0 m1 m2 …. mN] of Boolean function of n variables, where, 0 < N <span class="s1">< </span> 2n-1. The resulting algorithm is in concise form and trivial to implement. Furthermore, the developed algorithm is equipped with added attributes of optimizing of time and space while executed.</p><p class="p1"> </p>}, number={2}, journal={The Journal of Engineering Research [TJER]}, author={Ahmad, Afaq and Bait Suwailam, Mohammed M.}, year={2009}, month={Dec.}, pages={12–19} }