...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels
【24h】

The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels

机译：二维行程限制通道的正电容区

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A binary sequence satisfies a one-dimensional (d,k) constraint if every run of zeros (with possible exception of the first and the last runs) has length at least d and at most k. A binary two-dimensional array satisfies a (d,k) constraint if each row and each column satisfies the one-dimensional (d,k) constraint. Few models have been proposed in the literature to handle two-dimensional data: the diamond model, the square model, the hexagonal model, and the triangular model. The constraints in the different directions might be asymmetric and hence many kind of constraints are defined depending on the number of directions in the model. For example, a two-dimensional array in the diamond model satisfies a (d1,k1,d2,k 2) constraint if it satisfies the one-dimensional (d1 ,k1) constraint horizontally and the one-dimensional (d 2,k2) constraint vertically. In this correspondence, the region in which the capacity is zero or positive, in the various models, is examined. Asymmetric constraints in the diamond model and symmetric constraints in the other models are considered. In particular, an almost complete solution for asymmetric constraints in the diamond model is provided
机译：如果每个零行程（首行和最后一个行程可能除外）的长度至少为d，最大为k，则二进制序列满足一维（d，k）约束。如果每一行和每一列均满足一维（d，k）约束，则二进制二维数组满足（d，k）约束。文献中很少有人提出处理二维数据的模型：菱形模型，正方形模型，六边形模型和三角形模型。不同方向上的约束可能是不对称的，因此根据模型中方向的数量定义了多种约束。例如，菱形模型中的二维数组如果满足水平方向的一维（d1，k1）约束和一维（d 2，k2）的约束，则满足（d1，k1，d2，k 2）约束。垂直约束。通过这种对应，检查了各种模型中的容量为零或正的区域。考虑了菱形模型中的不对称约束和其他模型中的对称约束。特别是，提供了针对钻石模型中不对称约束的几乎完整解决方案

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号