The capacity of some hexagonal (d,k)-constraints

We consider two-dimensional binary codes whose bits lie on a hexagonal lattice and satisfy a (d,k) constraint in six directions. We prove that the capacity is zero if k=d+2 and give positive lower bounds on the capacity for k/spl ges/4[d/2]+1.

[1]  Kenneth Zeger,et al.  On the capacity of two-dimensional run-length constrained channels , 1999, IEEE Trans. Inf. Theory.

[2]  Bane V. Vasic.  Capacity of channels with redundant multitrack (d, k) constraints: the k , 1996, IEEE Trans. Inf. Theory.

[3]  Herbert S. Wilf,et al.  The Number of Independent Sets in a Grid Graph , 1998, SIAM J. Discret. Math..

[4]  R. Blahut,et al.  The capacity and coding gain of certain checkerboard codes , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[5]  R. Baxter,et al.  Hard hexagons: exact solution , 1980 .

[6]  Paul H. Siegel,et al.  Efficient coding schemes for the hard-square model , 2001, IEEE Trans. Inf. Theory.