The 1-vertex transfer matrix and accurate estimation of channel capacity
Preprint
Abstract
The notion of a 1-vertex transfer matrix for multi-dimensional 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-dimensional (0,1) run length limited channel. In order to compare the computational cost of the new method with the standard transfer matrix and have rigorous bounds to compare the estimates with a large scale computation of eigenvalues for the (0,1) run length limited channel in 2 and 3 dimensions have been carried out. This in turn leads to improvements on the best previous lower and upper bounds for that channel.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Sampling independent sets in the discrete torusRandom Structures & Algorithms, 2008
- Equation of state for hard-square lattice gasesPhysical Review E, 2007
- Reflection positivity, rank connectivity, and homomorphism of graphsJournal of the American Mathematical Society, 2006
- Theory of computation of multidimensional entropy with an application to the monomer–dimer problemAdvances in Applied Mathematics, 2005
- On the capacity of two-dimensional run-length constrained channelsIEEE Transactions on Information Theory, 1999
- The Number of Independent Sets in a Grid GraphSIAM Journal on Discrete Mathematics, 1998
- Hard-square lattice gasJournal of Statistical Physics, 1980
- Residual Entropy of Square IcePhysical Review B, 1967