On the channel capacity of read/write isolated memory
Discrete Applied Mathematics
The Number of Independent Sets in a Grid Graph
SIAM Journal on Discrete Mathematics
New Techniques for Bounding the Channel Capacity of Read/Write Isolated Memory
DCC '02 Proceedings of the Data Compression Conference
New upper and lower bounds on the channel capacity of read/write isolated memory
Discrete Applied Mathematics
The capacity and coding gain of certain checkerboard codes
IEEE Transactions on Information Theory
Capacity bounds for the three-dimensional (0,1) run length limited channel
IEEE Transactions on Information Theory
Bounds on the capacity of constrained two-dimensional codes
IEEE Transactions on Information Theory
Parallel constrained coding with application to two-dimensional constraints
IEEE Transactions on Information Theory
Two-dimensional constrained coding based on tiling
IEEE Transactions on Information Theory
| Hi-index | 0.06 |
A method for computing lower bounds on capacities of 2-dimensional constraints having a symmetric presentation in either the horizontal or the vertical direction is presented. The method is a generalization of the method of Calkin and Wilf (SIAM J. Discrete Math., 1998). Previous best lower bounds on capacities of certain constraints are improved using the method. It is also shown how this method, as well as their method for computing upper bounds on the capacity, can be applied to constraints which are not of finite-type. Additionally, capacities of 2 families of multi-dimensional constraints are given exactly.