Capacity of Higher-Dimensional Constrained Systems
暂无分享,去创建一个
[1] Ron M. Roth,et al. Two-dimensional weight-constrained codes through enumeration bounds , 2000, IEEE Trans. Inf. Theory.
[2] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[3] Li Sheng,et al. New upper and lower bounds on the channel capacity of read/write isolated memory , 2004, Discret. Appl. Math..
[4] S. K. Tsang,et al. Entropy of hard hexagons , 1980 .
[5] Tom Meyerovitch,et al. A Characterization of the Entropies of Multidimensional Shifts of Finite Type , 2007, math/0703206.
[6] Klas Markström,et al. The $1$ -Vertex Transfer Matrix and Accurate Estimation of Channel Capacity , 2010, IEEE Transactions on Information Theory.
[7] B. Marcus,et al. Independence entropy of $\mathbb{Z}^{d}$-shift spaces , 2013 .
[8] Sheng Zhong,et al. Approximate capacities of two-dimensional codes by spatial mixing , 2014, 2014 IEEE International Symposium on Information Theory.
[9] Elza Erkip,et al. Constrained Codes for Joint Energy and Information Transfer , 2014, IEEE Transactions on Communications.
[10] Brian H. Marcus,et al. Sliding-block coding for input-restricted channels , 1988, IEEE Trans. Inf. Theory.
[11] Alexander Vardy,et al. New Bounds on the Capacity of Multidimensional Run-Length Constraints , 2011, IEEE Transactions on Information Theory.
[12] Andrew Rechnitzer,et al. Accurate Lower Bounds on 2-D Constraint Capacities From Corner Transfer Matrices , 2014, IEEE Transactions on Information Theory.
[13] R. Baxter,et al. Hard hexagons: exact solution , 1980 .
[14] Klaus Schmidt,et al. Mahler measure and entropy for commuting automorphisms of compact groups , 1990 .
[15] P. W. Kasteleyn. The Statistics of Dimers on a Lattice , 1961 .
[16] Brian H. Marcus,et al. Improved lower bounds on capacities of symmetric 2-dimensional constraints ising Rayleigh quotients , 2009, 2009 IEEE International Symposium on Information Theory.
[17] Claude E. Shannon,et al. The mathematical theory of communication , 1950 .
[18] Tom Meyerovitch,et al. Entropy and measures of maximal entropy for axial powers of Subshifts , 2011 .
[19] Brian H. Marcus,et al. Improved Lower Bounds on Capacities of Symmetric 2D Constraints Using Rayleigh Quotients , 2010, IEEE Transactions on Information Theory.
[20] Sandro Zampieri,et al. Minimal and systematic convolutional codes over finite Abelian groups , 2004 .
[21] Barry Simon,et al. The statistical mechanics of lattice gases , 1993 .
[22] Jørn Justesen,et al. Entropy Bounds for Constrained Two-Dimensional Random Fields , 1999, IEEE Trans. Inf. Theory.
[23] Tuvi Etzion,et al. The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels , 2006, IEEE Transactions on Information Theory.
[24] D. Lind. The entropies of topological Markov shifts and a related class of algebraic integers , 1984, Ergodic Theory and Dynamical Systems.
[25] Herbert S. Wilf,et al. The Number of Independent Sets in a Grid Graph , 1998, SIAM J. Discret. Math..
[26] Robert L. Berger. The undecidability of the domino problem , 1966 .
[27] S. Friedland. On the entropy of Zd subshifts of finite type , 1997 .
[28] A. Rechnitzer,et al. Accurate lower bounds on two-dimensional constraint capacities from corner transfer matrices , 2012, 1210.5189.
[29] Don Coppersmith,et al. Algorithms for sliding block codes - An application of symbolic dynamics to information theory , 1983, IEEE Trans. Inf. Theory.
[30] Richard E. Blahut,et al. The Capacity and Coding Gain of Certain Checkerboard Codes , 1998, IEEE Trans. Inf. Theory.
[31] D. Gamarnik,et al. Sequential Cavity Method for Computing Free Energy and Surface Pressure , 2008, 0807.1551.
[32] Bruce Kitchens. Multidimensional Convolutional Codes , 2002, SIAM J. Discret. Math..
[33] Brian H. Marcus,et al. Tradeoff functions for constrained systems with unconstrained positions , 2004, IEEE Transactions on Information Theory.
[34] Brian H. Marcus,et al. Computing Bounds for Entropy of Stationary Zd Markov Random Fields , 2012, SIAM J. Discret. Math..
[35] R. Pavlov. Approximating the hard square entropy constant with probabilistic methods , 2010, 1011.1983.
[36] B. Marcus,et al. An integral representation for topological pressure in terms of conditional probabilities , 2013, 1309.1873.
[37] Kenneth Zeger,et al. On the capacity of two-dimensional run-length constrained channels , 1999, IEEE Trans. Inf. Theory.
[38] Ido Tal,et al. Bounds on the rate of 2-D bit-stuffing encoders , 2010, IEEE Trans. Inf. Theory.
[39] Paul H. Siegel,et al. Efficient coding schemes for the hard-square model , 2001, IEEE Trans. Inf. Theory.
[40] Elliott H. Lieb,et al. Residual Entropy of Square Ice , 1967 .
[41] Douglas Lind,et al. An Introduction to Symbolic Dynamics and Coding , 1995 .
[42] Brian H. Marcus,et al. Holographic data storage technology , 2000, IBM J. Res. Dev..
[43] Ettore Fornasini,et al. Algebraic aspects of two-dimensional convolutional codes , 1994, IEEE Trans. Inf. Theory.