Title :
Capacity Lower Bounds and Approximate Enumerative Coding for 2-D Constraints
Author :
Ordentlich, E. ; Roth, R.M.
Author_Institution :
Hewlett-Packard Labs., Palo Alto
Abstract :
We present a general method for obtaining lower bounds on the capacities of two-dimensional (2-D) constraints. We apply our method to the 2-D (d=2, infin) run-length limited (RLL) constraint and obtain the best known lower bound, .4423, on the capacity of this constraint. Our lower bounds are shown to be achievable by a fixed-rate, polynomial-complexity encoding-decoding algorithm based on enumerative coding with approximate counts.
Keywords :
decoding; encoding; polynomials; runlength codes; approximate enumerative coding; capacity lower bounds; polynomial-complexity encoding-decoding algorithm; run-length limited constraint; Computer science; Encoding; H infinity control; Laboratories; Memory management; Polynomials; Two dimensional displays; Virtual manufacturing;
Conference_Titel :
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location :
Nice
Print_ISBN :
978-1-4244-1397-3
DOI :
10.1109/ISIT.2007.4557463
