arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.06000cs.ITmath.IT
收藏

基于逐列编码的二维的约束码的渐近可解率

Asymptotic Achievable Rate of Two-Dimensional Constraint Codes based on Column by Column Encoding

Kazuya Hirata, Tadashi Wadayama

摘要:

在本文中,我们提出了一个列的列编码方案,适用于二维的【形】(2D)的约束码,并推导出其最大可达速率的下界。证明了最大可达速率等于最大有效偶图的子图的最大最小度。一个图论分析,以提供一个下限的最大可实现的速率。对于几个二维约束,如非对称和对称非孤立位约束,下界的值进行评估。

英文摘要:

In this paper, we propose a column by column encoding scheme suitable for two-dimensional (2D) constraint codes and derive a lower bound of its maximum achievable rate. It is shown that the maximum achievable rate is equal to the largest minimum degree of a subgraph of the maximal valid pair graph. A graph theoretical analysis to provide a lower bound of the maximum achievable rate is presented. For several 2D-constraints such as the asymmetric and symmetric non-isolated bit constraints, the values of the lower bound are evaluated.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑