.png){kind=icon}
返回
Balanced Gray Codes With Flexible Lengths
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2015.2501291.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Robinson and Cohn constructed an (n + 2)-bit balanced Gray code (BGC) of length 2(n+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.
Keyword:
Balanced Gray codes
transition sequence
flexible lengths
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
没有更多内容
没有更多内容