论文标题
本地平衡约束的编码方案
Coding schemes for locally balanced constraints
论文作者
论文摘要
通过在基于DNA的存储中的应用激励的动机，我们研究了满足局部平衡约束的二元字符串的明确编码和解码方案，其中$（\ ell，δ）$ - 局部平衡的约束要求任何连续的$ \ ell $连续底带的重量是$ \ ell $之间的重量$ \ frac {\ ell} {2}+δ$。在本文中，我们分别为局部平衡的约束和局部平衡的约束介绍了编码方案。此外，我们对$（6,1）$ - 本地平衡的二进制字符串数量的线性复发公式介绍了一个额外的结果，以进一步尝试为本地平衡的约束来实现能力表征和新的编码策略。
Motivated by applications in DNA-based storage, we study explicit encoding and decoding schemes of binary strings satisfying locally balanced constraints, where the $(\ell,δ)$-locally balanced constraint requires that the weight of any consecutive substring of length $\ell$ is between $\frac{\ell}{2}-δ$ and $\frac{\ell}{2}+δ$. In this paper we present coding schemes for the strongly locally balanced constraints and the locally balanced constraints, respectively. Moreover, we introduce an additional result on the linear recurrence formula of the number of binary strings which are $(6,1)$-locally balanced, as a further attempt to both capacity characterization and new coding strategies for locally balanced constraints.
