DocumentCode
2945755
Title
Capacity Lower Bounds for Two-Dimensional M-ary (0, k) and (d, ∞) Runlength-limited Channels
Author
Srinivasa, Shayan G. ; McLaughlin, Steven W.
Author_Institution
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA
fYear
2006
fDate
9-14 July 2006
Firstpage
1472
Lastpage
1476
Abstract
We present lower bounds on the two-dimensional capacity for two sets of symmetric and asymmetric M-ary runlength-limited constraints. The bounds extend and generalize our previous work on binary constraints. We also give sequential coding algorithms achieving the derived capacity lower bounds
Keywords
channel capacity; channel coding; sequential codes; capacity lower bounds; channel capacity; runlength-limited channels; sequential coding algorithms; two-dimensional M-ary channels; Algorithm design and analysis; Constraint theory; Entropy; Holographic optical components; Holography; Lattices; Mesh generation; Optical recording; Random processes; Two dimensional displays;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2006 IEEE International Symposium on
Conference_Location
Seattle, WA
Print_ISBN
1-4244-0505-X
Electronic_ISBN
1-4244-0504-1
Type
conf
DOI
10.1109/ISIT.2006.262112
Filename
4036211
Link To Document