On the Capacities of Balanced Codes with Run-Length Constraints

被引:0
作者
Manada, Akiko [1 ]
Morita, Hiroyoshi [1 ]
机构
[1] Univ Electrocommun, Grad Sch Informat & Engn, 1-5-1 Chofugaoka, Chofu, Tokyo 1828585, Japan
来源
2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2017年
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:1391 / 1395
页数:5
相关论文
共 12 条
[1]  
Immink K. S., 2004, Codes for mass data storage systems
[2]  
Immink KAS, 2011, IEEE INT SYMP INFO, P317, DOI 10.1109/ISIT.2011.6034136
[3]   Very Efficient Balanced Codes [J].
Immink, Kees A. Schouhamer ;
Weber, Jos H. .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2010, 28 (02) :188-192
[4]  
Kamabe H., 2015, P 38 S INF THEOR ITS, P691
[5]   EFFICIENT BALANCED CODES. [J].
Knuth, Donald E. .
IEEE Transactions on Information Theory, 1986, IT-32 (01) :51-53
[6]   PERFECT (D, K)-CODES CAPABLE OF CORRECTING SINGLE PEAK-SHIFTS [J].
LEVENSHTEIN, VI ;
VINCK, AJH .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (02) :656-662
[7]  
Lind D, 1995, An introduction to symbolic dynamics and coding
[8]  
Manada A., 2009, THESIS
[9]  
Marcus B. H., INTRO CODING C UNPUB
[10]   Constrained coding for context-free languages with applications to genetic sequence modelling [J].
Milenkovic, Olgica .
2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, :1686-1690