Convex programming upper bounds on the capacity of 2-D constraints

IEEE Transactions on Information Theory

Volumn 57, Issue 1, 2011, Pages 381-391

  Tal, Ido ^a,b   Roth, Ron M ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b University of California at San Diego   (United States)

Author keywords

"no isolated bits" constraint; Concave function maximization; convex programming; runlength limited constraints; two dimensional constraints

Indexed keywords

'NO ISOLATED BITS' CONSTRAINT; CONCAVE FUNCTION; CONVEX PROGRAMMING; CONVEX PROGRAMS; LINEAR EQUALITY; MARKOV CHAIN; RUN LENGTH LIMITEDS; STATIONARITY; UPPER BOUND;

ENTROPY; MARKOV PROCESSES; MOLECULAR PHYSICS; OPTIMIZATION; TWO DIMENSIONAL;

PROBABILITY DISTRIBUTIONS;

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

References (20)

1. B. H. Marcus, R. M. Roth, and P. H. Siegel, "Constrained systems and coding for recording channels," in Handbook of Coding Theory, V. Pless and W. Huffman, Eds. Amsterdam, The Netherlands: Elsevier, 1998, pp. 1635-1764.
2. W. Weeks and R. E. Blahut, "The capacity and coding gain of certain checkerboard codes," IEEE Trans. Inf. Theory, vol. 44, pp. 1193-1203, 1998.
3. A. Kato and K. Zeger, "On the capacity of two-dimensional run-length constrained code," IEEE Trans. Inf. Theory, vol. 45, pp. 1527-1540, 1999.
4. T. Etzion, "Cascading methods for runlength-limited arrays," IEEE Trans. Inf. Theory, vol. 43, pp. 319-324, 1997.
5. S. Halevy, J. Chen, R. M. Roth, P. H. Siegel, and J. K.Wolf, "Improved bit-stuffing bounds on two-dimensional constraints," IEEE Trans. Inf. Theory, vol. 50, pp. 824-838, 2004.
6. S. Forchhammer and J. Justesen, "Bounds on the capacity of constrained two-dimensional codes," IEEE Trans. Inf. Theory, vol. 46, pp. 2659-2666, 2000. (Pubitemid 32090047)
7. N. Calkin and H. S. Wilf, "The number of independent sets in a grid graph," SIAM J. Discrete Math., vol. 11, pp. 54-60, 1997.
8. R. Burton and J. E. Steif, "Non-uniqueness of measures of maximal entropy for 4 subshifts of finite type," Ergod. Th. Dynam. Sys., vol. 14, pp. 213-235, 1994.
9. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
10. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
11. J. Czyzyk, M. P. Mesnier, and J. J. Moré, "The NEOS server," IEEE Comput. Sci. & Eng., vol. 5, no. 3, pp. 68-75, 1998.
12. W. Gropp and J. J. Moré, "Optimization environments and the NEOS server," in Approximation Theory and Optimization. Cambridge, U.K.: Cambridge Univ. Press, 1997, pp. 167-182.
13. E. D. Dolan, R. Fourer, J. J. Moré, and T. S. Munson, The NEOS srver for optimization: Version 4 and beyond Mathematics and Computer Science Division, Argonne Nat. Lab., Argonne, IL, 2002.
14. R. Fourer, D. M. Gay, and B. W. Kernighan, AMPL: A Modeling Language for Mathematical Programming, 2nd ed. Pacific Grove, CA: Duxbury, 2002.
15. A. Wächter and L. T. Biegler, "On the implementation of an interiorpoint filter line-search algorithm for large-scale nonlinear programming," Math. Program., vol. 106, pp. 25-57, 2006.
16. S. Forchhammer and T. V. Laursen, "Entropy of bit-stuffing-induced measures for two-dimensional checkerboard constraints," IEEE Trans. Inf. Theory, vol. 53, pp. 1537-1546, 2007.
17. I. Tal and R. M. Roth, "Bounds on the rate of 2-D bit-stuffing encoders," IEEE Trans. Inf. Theory, vol. 56, pp. 2561-2567, 2010.
18. A. Sharov and R. M. Roth, "Two-dimensional constrained coding based on tiling," IEEE Trans. Inf. Theory, vol. 56, pp. 1800-1807, 2010.
19. d subshifts of finite type," Lin. Alg. Applicat., vol. 252, pp. 199-220, 1997.
20. S. Even, Graph Algorithms. New York: Computer Science, 1979.