Title :
Asymptotic capacity of two-dimensional channels with checkerboard constraints
Author :
Nagy, Zsigmond ; Zeger, Kenneth
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., San Diego, La Jolla, CA, USA
fDate :
29 June-4 July 2003
Abstract :
This paper discusses the capacities of two-dimensional channels satisfying convex checkerboard constraints. We consider the two-dimensional channels satisfying run length constraints in relation to optical recording applications. Two-dimensional run length constraints require binary sequence i.e. satisfied both horizontally and vertically in a rectangular binary array.
Keywords :
binary codes; binary sequences; channel capacity; digital magnetic recording; runlength codes; asymptotic capacity; binary sequence; convex checkerboard constraint; optical recording application; rectangular binary array; run length constraint; two-dimensional channel; Application software; Channel capacity; Labeling; Lattices; Magnetic recording; Optical recording; Shape measurement; Wireless communication;
Conference_Titel :
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN :
0-7803-7728-1
DOI :
10.1109/ISIT.2003.1228088
