Bounds on the capacity of constrained two-dimensional codes
From MaRDI portal
Recommendations
Cited in
(15)- Two-dimensional low-pass filtering codes
- Capacity of higher-dimensional constrained systems
- Improved Bit-Stuffing Bounds on Two-Dimensional Constraints
- The capacity and coding gain of certain checkerboard codes
- Maximizing the Shannon Capacity of Constrained Systems with Two Constraints
- Two-dimensional weight-constrained codes through enumeration bounds
- scientific article; zbMATH DE number 1756448 (Why is no real title available?)
- Parallel constrained coding with application to two-dimensional constraints
- Entropy bounds for constrained two-dimensional random fields
- Efficient code constructions for certain two-dimensional constraints
- On the capacity of two-dimensional run-length constrained channels
- Capacity bounds for the three-dimensional (0,1) run length limited channel
- Upper bounds and Hamming spheres under the DC constraint
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- On codes with local joint constraints
This page was built for publication: Bounds on the capacity of constrained two-dimensional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706000)
