On the redundancy of two-dimensional balanced codes

Let A/sub n/spl times/m/ be the set of binary n/spl times/m arrays in which each row, and respectively each column, has the same number of 0's and 1's. We prove the lower bound log/sub 2/|A/sub n/spl times/m/|/spl ges/nm- 1/2 (nlog/sub 2/(2m)+mlog/sub 2/(2n)). We also show that this bound is tight up to an additive term O(n+m).

[1]  T. Etzion,et al.  Efficient code constructions for certain two-dimensional constraints , 1997, Proceedings of IEEE International Symposium on Information Theory.

[2]  Bella Bose,et al.  Design of some new Balanced Codes , 1993, Proceedings. IEEE International Symposium on Information Theory.

[3]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[4]  M A Neifeld,et al.  Optical memory disks in optical information processing. , 1990, Applied optics.

[5]  Kees Schouhamer-Immink.  Coding Techniques for Digital Recorders , 1991 .

[6]  Donald E. Knuth,et al.  Efficient balanced codes , 1986, IEEE Trans. Inf. Theory.

[7]  Bella Bose,et al.  On balanced codes , 1990, IEEE Trans. Inf. Theory.

[8]  Ron M. Roth,et al.  Efficient Code Construction for Certain Two-Dimensional Constraints , 1997, IEEE Trans. Inf. Theory.

[9]  L. Gleser.  On the Distribution of the Number of Successes in Independent Trials , 1975 .

[10]  D. Psaltis,et al.  Control of volume holograms , 1992 .