AbstractIt is shown that for 1 ⩽ j ⩽ n and 1 ⩽ k ⩽ 2″, the jth letter of the kth word of the binary reflected Gray code of length n is equal to the parity of the binomial coefficient 2n−2n−j−1C[2n−2n−j−1−k/2] modulo 2. Also it is shown how this observation and the usual iterative definition of the binary reflected Gray codes are revealed in a modified version of Sierpinski's gasket (Pascal's triangle modulo 2)
AbstractWe give a characterization of codes meeting the Grey–Rankin bound. When the codes have even ...
For any integer $n\geq 1$ a \emph{middle levels Gray code} is a cyclic listing of all bitstrings of ...
We examine the problem of representing integers modulo L so that both increment and decrement operat...
On binary reflected Gray codes and functions The Binary Reflected Gray Code function b is defined as...
AbstractThe binary reflected Gray code function b is defined as follows: If m is a nonnegative integ...
The permutation associated with the decimal expression of the binary reflected Gray code with N bits...
The standard binary reflected Gray code describes a sequence of integers 0 to n-1, where n is a powe...
International audienceAt the 4th Conference on Combinatorics on Words, Christophe Reutenauer posed t...
Graduation date: 2008An n-bit Gray code is an ordered set of all 2n binary strings of length n. The\...
Given a certain Gray code consisting of 2n codewords, it is possible to generate from it n! 2n codes...
This paper is concerned with the problem of selecting a binary labeling for the signal constellation...
This paper concerns the problem of selecting a binary labeling for the signal constellation in M-PSK...
A counting sequence of length n is a list of all 2^n binary n-tuples (binary codewords of length n)....
AbstractAn n-bit binary Gray code is an enumeration of all n-bit binary strings so that successive e...
A Gray code of length n is a list of all binary words of length n such that each two successive code...
AbstractWe give a characterization of codes meeting the Grey–Rankin bound. When the codes have even ...
For any integer $n\geq 1$ a \emph{middle levels Gray code} is a cyclic listing of all bitstrings of ...
We examine the problem of representing integers modulo L so that both increment and decrement operat...
On binary reflected Gray codes and functions The Binary Reflected Gray Code function b is defined as...
AbstractThe binary reflected Gray code function b is defined as follows: If m is a nonnegative integ...
The permutation associated with the decimal expression of the binary reflected Gray code with N bits...
The standard binary reflected Gray code describes a sequence of integers 0 to n-1, where n is a powe...
International audienceAt the 4th Conference on Combinatorics on Words, Christophe Reutenauer posed t...
Graduation date: 2008An n-bit Gray code is an ordered set of all 2n binary strings of length n. The\...
Given a certain Gray code consisting of 2n codewords, it is possible to generate from it n! 2n codes...
This paper is concerned with the problem of selecting a binary labeling for the signal constellation...
This paper concerns the problem of selecting a binary labeling for the signal constellation in M-PSK...
A counting sequence of length n is a list of all 2^n binary n-tuples (binary codewords of length n)....
AbstractAn n-bit binary Gray code is an enumeration of all n-bit binary strings so that successive e...
A Gray code of length n is a list of all binary words of length n such that each two successive code...
AbstractWe give a characterization of codes meeting the Grey–Rankin bound. When the codes have even ...
For any integer $n\geq 1$ a \emph{middle levels Gray code} is a cyclic listing of all bitstrings of ...
We examine the problem of representing integers modulo L so that both increment and decrement operat...
DOI
Add to ORKG