Capacity equalities in 1-dimensional (d, k)-constrained systems

被引：0
|
作者：
Kashyap, N [1 ]
Siegel, PH [1 ]
机构：
[1] Univ Calif San Diego, Dept Elect & Comp Engn, La Jolla, CA 92093 USA
来源：
2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS | 2003年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we consider the problem of determining when the capacities of distinct 1-dimensional (d, k)-constrained systems can be equal. If we let C(d, k) denote the capacity of a (d, k)-constrained system, then it is known that C(d, 2d) = C(d + 1, 3d + 1), and C(d, 2d + 1) = C(d + 1, infinity). Repeated application of these two identities also yields the chain of equalities C(1, 2) = C(2,4) = C(3,7) = C(4, infinity). We show that these are the only equalities possible among the capacities of (d, k)-constrained systems.
引用
收藏
页码：105 / 105
页数：1
相关论文
共 50 条
12345