Improved Lower Bounds on Capacities of Symmetric 2D Constraints Using Rayleigh Quotients

A method for computing lower bounds on capacities of two-dimensional (2D) 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 two families of multidimensional constraints are given exactly.

[1]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[2]  Lauren C. Kingman,et al.  Operational Image Systems: A New Opportunity , 1990, IBM Syst. J..

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

[4]  B. Marcus.  Constrained Systems and Coding for Recording Channels, in Handbook of Coding Theory, v. Finite-state Modulation Codes for Data Storage, Ieee , 2000 .

[5]  J. Kingman.  A convexity property of positive matrices , 1961 .

[6]  R. Horst,et al.  DC Programming: Overview , 1999 .

[7]  Angela Desai,et al.  Subsystem entropy for ℤd sofic shifts , 2006 .

[8]  P. W. Kasteleyn.  The Statistics of Dimers on a Lattice , 1961 .

[9]  Li Sheng,et al.  New upper and lower bounds on the channel capacity of read/write isolated memory , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[10]  Douglas Lind,et al.  An Introduction to Symbolic Dynamics and Coding , 1995 .

[11]  Ba Di Ya,et al.  Matrix Analysis , 2011 .

[12]  Jørn Justesen,et al.  Bounds on the capacity of constrained two-dimensional codes , 2000, IEEE Trans. Inf. Theory.

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

[14]  Shmuel Friedland,et al.  Theory of computation of multidimensional entropy with an application to the monomer-dimer problem , 2004, Adv. Appl. Math..

[15]  R. Roth,et al.  Parallel constrained coding with application to two-dimensional constraints , 2002, Proceedings IEEE International Symposium on Information Theory,.

[16]  Kenneth Zeger,et al.  Capacity bounds for the three-dimensional (0, 1) run length limited channel , 2000, IEEE Trans. Inf. Theory.

[17]  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).

[18]  P. W. Kasteleyn.  The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice , 1961 .