Capacity of higher-dimensional constrained systems
From MaRDI portal
Recommendations
Cites work
- A characterization of the entropies of multidimensional shifts of finite type
- A Mathematical Theory of Communication
- Accurate Lower Bounds on 2-D Constraint Capacities From Corner Transfer Matrices
- Algebraic aspects of two-dimensional convolutional codes
- Algorithms for sliding block codes - An application of symbolic dynamics to information theory
- An integral representation for topological pressure in terms of conditional probabilities
- An Introduction to Symbolic Dynamics and Coding
- Approximating the hard square entropy constant with probabilistic methods
- Bounds on the Rate of 2-D Bit-Stuffing Encoders
- Computing bounds for entropy of stationary \(\mathbb{Z}^d\) Markov random fields
- Efficient coding schemes for the hard-square model
- Entropy bounds for constrained two-dimensional random fields
- scientific article; zbMATH DE number 3746112 (Why is no real title available?)
- scientific article; zbMATH DE number 4123763 (Why is no real title available?)
- scientific article; zbMATH DE number 1284433 (Why is no real title available?)
- scientific article; zbMATH DE number 479937 (Why is no real title available?)
- Improved Lower Bounds on Capacities of Symmetric 2D Constraints Using Rayleigh Quotients
- Independence entropy of \(\mathbb{Z}^{d}\)-shift spaces
- Mahler measure and entropy for commuting automorphisms of compact groups
- Minimal and systematic convolutional codes over finite Abelian groups
- Multidimensional Convolutional Codes
- New Bounds on the Capacity of Multidimensional Run-Length Constraints
- New upper and lower bounds on the channel capacity of read/write isolated memory
- On independence and entropy for high-dimensional isotropic subshifts
- On the capacity of two-dimensional run-length constrained channels
- On the entropy of \(\mathbb{Z}^d\) subshifts of finite type
- Sequential cavity method for computing free energy and surface pressure
- The 1-Vertex Transfer Matrix and Accurate Estimation of Channel Capacity
- The capacity and coding gain of certain checkerboard codes
- The entropies of topological Markov shifts and a related class of algebraic integers
- The Number of Independent Sets in a Grid Graph
- The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- The undecidability of the domino problem
- Tradeoff functions for constrained systems with unconstrained positions
- Two-dimensional weight-constrained codes through enumeration bounds
Cited in
(5)
This page was built for publication: Capacity of higher-dimensional constrained systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460444)