Balanced Gray Codes With Flexible Lengths

Robinson and Cohn constructed an (n + 2)-bit balanced Gray code (BGC) of length 2n+2 from an n-bit BGC. This letter extends their construction to flexible lengths by selecting a subsequence from transition sequence of an n-bit BGC. For any target length, we first derive the length range of the desired subsequence and the occurrence of each bit position in this subsequence. Then, an (n + 2)-bit balanced Gray code of flexible length can be constructed by selecting a subsequence under the two above constraints.

[1]  Bella Bose,et al.  Lee distance Gray codes , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[2]  Steven Skiena,et al.  Synthetic Sequence Design for Signal Location Search , 2012, Algorithmica.

[3]  Naehyuck Chang,et al.  Energy- and endurance-aware design of phase change memory caches , 2010, 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010).

[4]  Mary Flahive.  Balancing Cyclic R-ary Gray Codes II , 2008, Electron. J. Comb..

[5]  John P. Robinson,et al.  Counting sequences , 1981, IEEE Transactions on Computers.

[6]  T. Ottosson,et al.  Unequal bit-error protection in coherent M-ary PSK , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[7]  A. J. van Zanten,et al.  Balanced Maximum Counting Sequences , 2006, IEEE Transactions on Information Theory.

[8]  Yaagoub Ashir,et al.  Lee Distance and Topological Properties of k-ary n-cubes , 1995, IEEE Trans. Computers.

[9]  Bella Bose,et al.  Balancing Cyclic R-ary Gray Codes , 2007, Electron. J. Comb..

[10]  Carla D. Savage,et al.  Balanced Gray Codes , 1996, Electron. J. Comb..