DocumentCode
2992534
Title
Approximate enumerative coding for 2-D constraints through ratios of maprix Products
Author
Ordentlich, Erik ; Roth, Ron M.
Author_Institution
Hewlett-Packard Labs., Palo Alto, CA, USA
fYear
2009
fDate
June 28 2009-July 3 2009
Firstpage
1050
Lastpage
1054
Abstract
We show how to improve on the technique of approximate enumerative coding for a family of two-dimensional constraints by encoding according to lower bounds based on the worst-case behavior of certain ratios of matrix products. For the case of the two-dimensional (d = 2;infin) run-length limited (RLL) constraint, the improved approach yields a lower bound of 0.4453 on the capacity of the constraint.
Keywords
approximation theory; matrix algebra; runlength codes; approximate enumerative coding; encoding; matrix product; run-length limited constraint; two-dimensional constraint; worst-case behavior; Binary sequences; Computer science; Decoding; Encoding; Holographic optical components; Holography; Laboratories; Memory; Size measurement; Two dimensional displays;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location
Seoul
Print_ISBN
978-1-4244-4312-3
Electronic_ISBN
978-1-4244-4313-0
Type
conf
DOI
10.1109/ISIT.2009.5206057
Filename
5206057
Link To Document