On the capacities of balanced codes with run-length constraints
On the capacities of balanced codes with run-length constraints
复制标题
具有游程长度约束的平衡码的容量
DOI：
10.1109/isit.2017.8006757
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Akiko Manada and Hiroyoshi Morita
中科院分区：
文献类型：
--
作者：
森倉 悠介;野澤 優介;関根 晃大;柏木 雅英;大石 進一;菖蒲川由郷;Tomoko Ikeda;Akiko Manada and Hiroyoshi Morita
平衡码是在{a，B}上的一组字，使得字中a的数目和B的数目相等，并且迄今为止已经提出了许多使用平衡码的应用。近年来，人们不仅研究了原始的平衡码，而且还研究了具有其它约束条件的平衡码，主要是为了在数据存储介质中的应用。然而，与其他典型的满足某些约束条件的字集相反，这种平衡码的容量至今还没有得到很好的研究。在本文中，我们专注于满足各种游程长度约束的平衡码，并分析其容量。更确切地说，我们展示的能力的下限，或在某些情况下，提出明确的能力。
A balanced code is a set of words over {a, b} such that the number of a's and the number of b's in a word are equal, and many applications using balanced codes have been proposed so far. Recently, not only the original balanced code, but also balanced codes with some other constraints have been studied mainly for an application of data storage media. However, contrary to other typical sets of words satisfying some constraints, the capacities of such balanced codes have not been well studied up to this moment. In this paper, we focus on balanced codes satisfying various run-length constraints and analyze their capacities. More precisely, we exhibit lower bounds on the capacities, or present the explicit capacities for certain cases.