Z. Nagy and K. Zeger, Asymptotic capacity of two-dimensional channels with checkerboard constraints, preprint. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Capacity Bounds for the Hard-Triangle Model - Nagy, Zeger (2002) (1 citation) Self-citation (Nagy Zeger) (Correct)
No context found.
Zs. Nagy and K. Zeger. Asymptotic capacity of two-dimensional channels with checkerboard constraints. IEEE Trans. Inform. Theory, (submitted July 2002).
Bit Stuffing Algorithms and Analysis for Run Length Constrained .. - Nagy, Zeger (2002) Self-citation (Nagy Zeger) (Correct)
.... and optical data storage systems, and have been studied extensively [9] Other two dimensional constraints such as asymmetric run length constraints, run length constraints along diagonals, and constraints defined by two dimensional sets are also of theoretical and practical interest [1] 6] [14], 20] 21] 23] Three dimensional constraints were studied in [7] and [13] and the positive capacity region of general n dimensional run length constraints was determined in [10] The mathematical analysis of high dimensional constraints often is more difficult than the one dimensional ....
Zs. Nagy and K. Zeger. Asymptotic capacity of two-dimensional channels with checkerboard constraints. IEEE Trans. Inform. Theory, 2002 (submitted).
Zero/Positive Capacities of Two-Dimensional Runlength.. - Etzion, Paterson (2004) (2 citations) (Correct)
No context found.
Z. Nagy and K. Zeger, Asymptotic capacity of two-dimensional channels with checkerboard constraints, preprint.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC