The 1-Vertex Transfer Matrix and Accurate Estimation of Channel Capacity
From MaRDI portal
Publication:5281333
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.
Cited in
(5)- Upper bounds on the growth rates of independent sets in two dimensions via corner transfer matrices
- Efficient computation of permanents, with applications to boson sampling and random matrices
- Capacity of higher-dimensional constrained systems
- The channel capacity of read/write isolated memory
- Entropies realizable by block gluing \(\mathbb{Z}^{d}\) shifts of finite type
This page was built for publication: The $1$-Vertex Transfer Matrix and Accurate Estimation of Channel Capacity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281333)
