Name
Abstract | ||
|---|---|---|
The binary reflected Gray code function b is defined as follows: If m is a nonnegative integer, then b(m) is the integer obtained when initial zeros are omitted from the binary reflected Gray code of m. This paper examines this Gray code function and its inverse and gives simple algorithms to generate both. It also simplifies Conder's result that the jth letter of the kth word of the binary reflected Gray code of length n is 2^n-2^n^-^j-1@?2^n-2^n^-^j^-^1-k/2@?mod2by replacing the binomial coefficient by k-12^n^-^j^+^1+12. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2006.12.004 | Discrete Mathematics |
Keywords | Field | DocType |
binary reflected gray codes,gray,functions,codes,gray code,binary,binomial coefficient | Integer,Inverse,Discrete mathematics,Combinatorics,Binary code,Gray code,Binomial coefficient,SIMPLE algorithm,Mathematics,Gray (unit),Binary number | Journal |
Volume | Issue | ISSN |
308 | 9 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.97 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin W. Bunder | 1 | 64 | 16.78 |
| Keith P. Tognetti | 2 | 11 | 3.66 |
| Glen E. Wheeler | 3 | 1 | 1.31 |