H. Ito, A, Kato, Zs. Nagy, and K. Zeger, "Zero capacity region of multidimensional run length constraints", The Electronic Journal of Combinatorics, vol. 6, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Coding Schemes for the Hard-Square Model - Roth, Siegel, Wolf (1999) (6 citations) (Correct)
.... by the properties of D it follows that P w2D 2 Gamma (w) 1 (the Kraft equality) The expected rate of such a coding scheme is given by R m;n = 1 mn Delta X w2D 2 Gamma (w) w) A very simple coding scheme into S ( Delta m;n ) at a fixed rate 1 : 2 is implied by Lemma 1(e) in [14]: entries (i; j) 2 Delta m;n such that i j is even are filled with the input bit stream, while the remaining entries are set to zero. We do not know of any other published efficient fixedrate encoders at (significantly) higher rates for the two dimensional (1; 1) RLL constraint. The main goal ....
H. Ito, A. Kato, Z. Nagy, K. Zeger, Zero capacity region of multidimensional run length constraints, Electr. J. Combinatorics, 6 (1999), R33.
Convergence Rates for Runlength Constrained Capacities - Pomerance, Zeger (2001) Self-citation (Zeger) (Correct)
No context found.
H. Ito, A. Kato, Zs. Nagy, and K. Zeger, "Zero Capacity Region of Multidimensional Run Length Constraints," The Electronic Journal of Combinatorics, vol. 6, no. 1, 1999, # R33.
Bit Stuffing Algorithms and Analysis for Run Length Constrained .. - Nagy, Zeger (2002) Self-citation (Nagy Zeger) (Correct)
.... 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 case. For practical applications, implementable and efficient coding schemes are needed, but only a few such algorithms exist for two and higher dimensional constraints. Some examples for ....
....of the n dimensional (d; k) constraint (or of the constrained channel) is m 1 log 2 j (R m )j where R m = f0; 1; m 1g (there are various other equivalent definitions) The exact value of the capacity is not known in general. If d = k then C = 0, and it has been shown [10], 11] that if k d 1 and n 2 then C = 0 ( k = d 1. Numerical upper and lower bounds on C 1;1 were established in [3] and these bounds were later improved in [23] and then in [13] The best known bounds on C 1;1 agree in the first 9 decimal places as 1;1 0:587891161868: ....
H. Ito, A. Kato, Zs. Nagy, and K. Zeger. Zero capacity region of multidimensional run length constraints. Electronic Journal of Combinatorics, 6(1)(R33), 1999.
Zero Capacity Region of Multidimensional Run Length Constraints - Hisashi Ito Dept (1999) (4 citations) Self-citation (Ito Kato Nagy Zeger) (Correct)
No context found.
H. Ito, A. Kato, Zs. Nagy, and K. Zeger, "Zero Capacity Region of Multidimensional Run Length Constraints," The Electronic Journal of Combinatorics, vol. 6, no. 1, 1999, # R33. (http://www.combinatorics.org/Volume 6/Abstracts/v6i1r33.html).
Partial Characterization of the Positive Capacity Region of .. - Akiko Kato Kenneth (2000) (2 citations) Self-citation (Kato Zeger) (Correct)
No context found.
H. Ito, A. Kato, Zs. Nagy, and K. Zeger, "Zero Capacity Region of Multidimensional Run Length Constraints," The Electronic Journal of Combinatorics, vol. 6, no. 1, 1999, # R33. (http://www.combinatorics.org/Volume 6/Abstracts/v6i1r33.html).
Zero/Positive Capacities of Two-Dimensional Runlength.. - Etzion, Paterson (2004) (2 citations) (Correct)
No context found.
H. Ito, A, Kato, Zs. Nagy, and K. Zeger, "Zero capacity region of multidimensional run length constraints", The Electronic Journal of Combinatorics, vol. 6, 1999.
The Asymptotic Capacity of Multi-Dimensional.. - Ordentlich, Roth (2002) (Correct)
No context found.
H. Ito, A. Kato, A. Nagy, K. Zeger, Zero capacity region of multidimensional run length constraints, Electr. J. Combinatorics, 6 (1999), R33.
Efficient Coding for a Two-Dimensional Runlength-Limited.. - Roth, Siegel, Wolf (1999) (2 citations) (Correct)
No context found.
H. Ito, A. Kato, A. Nagy, and K. Zeger, "Zero capacity region of multidimensional run length constraints," submitted to Electron. J. Combinatorics, Apr. 24, 1999.
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