Asymptotic Achievable Rate of Two-Dimensional Constraint Codes based on Column by Column Encoding
Information Theory
2018-04-18 v1 math.IT
Abstract
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.
Cite
@article{arxiv.1804.06000,
title = {Asymptotic Achievable Rate of Two-Dimensional Constraint Codes based on Column by Column Encoding},
author = {Kazuya Hirata and Tadashi Wadayama},
journal= {arXiv preprint arXiv:1804.06000},
year = {2018}
}
Comments
5 pages