...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Entropy of Bit-Stuffing-Induced Measures for Two-Dimensional Checkerboard Constraints
【24h】

Entropy of Bit-Stuffing-Induced Measures for Two-Dimensional Checkerboard Constraints

机译：二维棋盘约束的位填充诱导度量的熵

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

摘要

A modified bit-stuffing scheme for two-dimensional (2-D) checkerboard constraints is introduced. The entropy of the scheme is determined based on a probability measure defined by the modified bit-stuffing. Entropy results of the scheme are given for 2-D constraints on a binary alphabet. The constraints considered are 2-D RLL(d,infin) for d=2,3 and 4 as well as for the constraint with a minimum 1-norm distance of 3 between 1s. For these results the entropy is within 1-2% of an upper bound on the capacity for the constraint. As a variation of the scheme, periodic merging arrays are also considered
机译：介绍了一种针对二维（2-D）棋盘约束的改进的位填充方案。该方案的熵是基于由修改后的位填充定义的概率度量来确定的。该方案的熵结果针对二进制字母上的二维约束给出。对于d = 2,3和4，以及对于1s之间最小1范数距离为3的约束，考虑的约束为2-DRLLL（d，infin）。对于这些结果，熵在约束容量上限的1-2％之内。作为方案的变体，还考虑了周期合并阵列

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号