Balanced Gray Codes with Flexible Lengths

Lu Wang; Zulin Wang; Qin Huang; Mu Zhang

doi:10.1109/LCOMM.2015.2501291

Balanced Gray Codes with Flexible Lengths

Lu Wang
, Zulin Wang
, Qin Huang^*
, Mu Zhang

^*Corresponding author for this work

School of Electronic and Information Engineering

Beihang University
Wuhan University

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

Robinson and Cohn constructed an (n+2)-bit balanced Gray code (BGC) of length 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.

Original language	English
Article number	7329924
Pages (from-to)	894-897
Number of pages	4
Journal	IEEE Communications Letters
Volume	20
Issue number	5
DOIs	https://doi.org/10.1109/LCOMM.2015.2501291
State	Published - May 2016

Keywords

balanced Gray codes
flexible lengths
transition sequence

Access to Document

10.1109/LCOMM.2015.2501291

Cite this

@article{b666317ca00a42c8ba2408705b9b5c51,

title = "Balanced Gray Codes with Flexible Lengths",

abstract = "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.",

keywords = "balanced Gray codes, flexible lengths, transition sequence",

author = "Lu Wang and Zulin Wang and Qin Huang and Mu Zhang",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.",

year = "2016",

month = may,

doi = "10.1109/LCOMM.2015.2501291",

language = "英语",

volume = "20",

pages = "894--897",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

T1 - Balanced Gray Codes with Flexible Lengths

AU - Wang, Lu

AU - Wang, Zulin

AU - Huang, Qin

AU - Zhang, Mu

PY - 2016/5

Y1 - 2016/5

N2 - 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.

AB - 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.

KW - balanced Gray codes

KW - flexible lengths

KW - transition sequence

UR - https://www.scopus.com/pages/publications/84969795508

U2 - 10.1109/LCOMM.2015.2501291

DO - 10.1109/LCOMM.2015.2501291

M3 - 文章

AN - SCOPUS:84969795508

SN - 1089-7798

VL - 20

SP - 894

EP - 897

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 5

M1 - 7329924

ER -

Balanced Gray Codes with Flexible Lengths

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this