.png){kind=icon}
返回
Minimal Sets for Capacity-Approaching Variable-Length Constrained Sequence Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2018.2873345.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The use of constrained sequence (CS) codes is important for the robust operation of transmission and data storage systems. While most analysis and development of CS codes have focused on fixed-length codes, recent research has demonstrated the advantages of variable-length CS codes. In our design of capacity-approaching variable-length CS codes, the construction of minimal sets is critical. In this paper, we propose an approach to construct minimal sets for a variety of constraints based on the finite-state machine (FSM) description of CSs. We develop three criteria to select the optimal state of the FSM that enables the design of a single-state encoder that results in the highest maximum possible code rate, and we apply these criteria to several constraints to illustrate the advantages that can be achieved. We then introduce FSM partitions and propose a recursive construction algorithm to establish the minimal set of the specified state. Finally, we present the construction of single-state capacity-approaching variable-length CS codes to show the improved efficiency and reduced implementation complexity that can be achieved compared with CS codes currently in use.
Keyword:
Constrained sequence codes
variable-length codes
capacity-approaching codes
single-state codes
DC-free codes
run-length-limited codes
visible light communication
DNA-based storage
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
.png){kind=icon}
Design of Capacity-Approaching Constrained Codes for DNA-Based Storage Systems基于DNA的存储系统的容量接近约束代码的设计
PREAI
分享收藏
查看更多内容