The $1$ -Vertex Transfer Matrix and Accurate Estimation of Channel Capacity

The notion of a 1-vertex transfer matrix for multidimensional codes is introduced. It is shown that the capacity of such codes, or the topological entropy, can be expressed as the limit of the logarithm of spectral radii of 1-vertex transfer matrices. Storage and computations using the 1-vertex transfer matrix are much smaller than storage and computations needed for the standard transfer matrix. The method is applied to estimate the first 15 digits of the entropy of the 2-D (0, 1) run length limited channel. A large-scale computation of eigenvalues for the (0, 1) run length limited channel in 2-D and 3-D have been carried out. This was done in order to be able to compare the computational cost of the new method with the standard transfer matrix and have rigorous bounds to compare the estimates with. This in turn leads to improvements on the best previous lower and upper bounds for these channels.

[1]  A. Baram,et al.  Hard square lattice gas , 1994 .

[2]  David Galvin,et al.  On phase transition in the hard-core model on ${\bf Z}^d$ , 2012, 1206.3144.

[3]  Kenneth Zeger,et al.  Asymptotic capacity of two-dimensional channels with checkerboard constraints , 2003, IEEE Trans. Inf. Theory.

[4]  L. Lovasz,et al.  Reflection positivity, rank connectivity, and homomorphism of graphs , 2004, math/0404468.

[5]  Jessica Fuerst.  Mathematical Systems Theory in Biology, Communications, Computation, and Finance , 2003 .

[6]  Jeff Kahn,et al.  On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$ , 2004, Combinatorics, Probability and Computing.

[7]  Equation of state for hard-square lattice gases. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  S. Friedland.  On the entropy of Zd subshifts of finite type , 1997 .

[9]  Shmuel Friedland,et al.  Multi-Dimensional Capacity, Pressure and Hausdorff Dimension , 2003, Mathematical Systems Theory in Biology, Communications, Computation, and Finance.

[10]  David Galvin,et al.  Sampling independent sets in the discrete torus , 2008, Random Struct. Algorithms.

[11]  Herbert S. Wilf,et al.  The Number of Independent Sets in a Grid Graph , 1998, SIAM J. Discret. Math..

[12]  Shmuel Friedland,et al.  Theory of computation of multidimensional entropy with an application to the monomer-dimer problem , 2004, Adv. Appl. Math..

[13]  V. Sós,et al.  Counting Graph Homomorphisms , 2006 .

[14]  Elliott H. Lleb.  Residual Entropy of Square Ice , 1967 .

[15]  Kenneth Zeger,et al.  Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel , 1999, AAECC.

[16]  Kenneth Zeger,et al.  On the capacity of two-dimensional run-length constrained channels , 1999, IEEE Trans. Inf. Theory.

[17]  Klas Markström,et al.  Exact and Approximate Compression of Transfer Matrices for Graph Homomorphisms , 2008 .