[
    {
        "id": "osp-13241",
        "type": "article-journal",
        "title": "A Less Complex Algorithmic Procedure for Computing Gray Codes",
        "author": [
            {
                "family": "Ahmad",
                "given": "Afaq"
            },
            {
                "family": "Bait‐Suwailam",
                "given": "Mohammed M."
            }
        ],
        "URL": "https://omanscience.com/ar/articles/a-less-complex-algorithmic-procedure-for-computing-gray-codes",
        "language": "en",
        "issued": {
            "date-parts": [
                [
                    2009
                ]
            ]
        },
        "container-title": "The Journal of Engineering Research",
        "volume": "6",
        "issue": "2",
        "page": "12",
        "DOI": "10.24200/tjer.vol6iss2pp12-19",
        "publisher": "Sultan Qaboos University",
        "ISSN": "1726-6009",
        "abstract": "The purpose of this paper is to present a new and faster algorithmic procedure for generating the n 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 < 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."
    }
]