The positive capacity region of two-dimensional run-length-constrained channels

IEEE Transactions on Information Theory

Volumn 52, Issue 11, 2006, Pages 5128-5140

  Censor, Keren ^a   Etzion, Tuvi ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Asymmetric constraints; Capacity; Constrained codes; Diamond model; Hexagonal model; Permutation arrays; Square model; Tiling; Triangular model; Two dimensional coding

Indexed keywords

CHANNEL CAPACITY; CODES (SYMBOLS); CONSTRAINT THEORY; ENCODING (SYMBOLS);

ASYMMETRIC CONSTRAINTS; CONSTRAINED CODES; DIAMOND MODEL; HEXAGONAL MODEL; PERMUTATION ARRAYS; SQUARE MODEL; TILING; TRIANGULAR MODEL;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 33750575747     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.883544     Document Type: Article

References (18)

1. J. J. Ashley and B. H. Marcus, "Two-dimensional low-pass filtering codes," IEEE Trans. Commun., vol. 46, no. 6, pp. 724-727, Jun. 1998.
2. S. R. Blackburn, "Two dimensional runlength constrained arrays with equal horizontal and vertical constraints," IEEE Trans. Inf. Theory, to be published.
3. K. Censor, "Constrained Codes for Two-Dimensional Channels," M.Sc. thesis, Computer Science Department, Technion-Israel Inst. Technol., Haifa, Israel, 2006.
4. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices, and Groups. New York: Springer-Verlag, 1988.
5. S. I. Costa, M. Muniz, E. Agustini, and R. Palazzo, "Graphs, tessellations, and perfect codes on flat tori," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2363-2377, Oct. 2004.
6. T. Etzion and K. Paterson, "Zero/positive capacities two-dimensional runlength-constrained arrays," IEEE Trans. Inf. Theory, vol. 51, no. 9, pp. 3186-3199, Sep. 2005.
7. T. Etzion and A. Vardy, "Two-dimensional interleaving schemes with repetitions: Constructions and bounds," IEEE Trans. Inf. Theory, vol. 48, no. 11, pp. 428-457, Nov. 2002.
8. K. A. S. Immink, Coding Techniques for Digital Recorders. New York: Prentice-Hall, 1991.
9. K. A. S. Immink, Codes for Mass Data Storage Systems. Amstedam, The Netherlands: Shannon Foundation Publishers, 1999.
10. A. Kato and K. Zeger, "On the capacity of two-dimensional run length constarined channels," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1527-1540, Jul. 1999.
11. A. Kato and K. Zeger, "Partial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels," IEEE Trans. Inf. Theory, vol. 46, no. 7, pp. 2666-2670, Nov. 2000.
12. Z. Kukorelly and K. Zeger, "The capacity of some hexagonal (d,k) constraints," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, Jun. 2001, p. 64.
13. Z. Kukorelly and K. Zeger, "Automated theorem proving for hexagonal run length constrained capacity computation," in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, pp. 1199-1203.
14. Z. Nagy and K. Zeger, "Capacity bounds for the hard-triangle modes," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 162.
15. Z. Nagy and K. Zeger, "Asymptotic capacity of two-dimensional channels with checkboard constraints," IEEE Trans. Inf. Theory, vol. 49, no. 9, pp. 2115-2125, Sep. 2003.
16. R. M. Roth, P. H. Siegel, and J. K. Wolf, "Efficient coding schemes for the hard-square model," IEEE Trans. Inf. Theory, vol. 47, no. 3, pp. 1166-1176, Mar. 2001.
17. M. Schwartz and T. Etzion, "Two-dimensional cluster-correcting codes," IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 2121-2132, Jun. 2005.
18. W. Weeks and R. E. Blahut, "The capacity and coding gain of certain checkerboard codes," IEEE Trans. Inf. Theory, vol. 44, no. 3, pp. 1193-1203, May 1998.