R.M. Roth, P.H. Siegel, and J.K. Wolf, "Efficient Coding Schemes for the Hard-Square Model," IEEE Transactions on Information Theory, vol. 47, no 3, March 2001, pp. 1166--1176. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Bit Stuffing Algorithms and Analysis for Run Length Constrained .. - Nagy, Zeger (2002) (Correct)
....bit stuffing algorithm for the (1; 1) constraint was presented by Roth, Siegel, and Wolf [16] The algorithm converts an infinite unbiased independent and identically distributed (i.i.d. binary input sequence into a biased i.i.d. sequence, before mapping the bits into Z . In a subsequent paper [17] they improved the bit stuffing encoder (i.e. increased the coding rate closer to the channel capacity) by converting the input into two biased i.i.d. sequences. They also use a randomized initial labeling of certain points in Z in order to facilitate analysis. The coding rate calculations in ....
....improved the bit stuffing encoder (i.e. increased the coding rate closer to the channel capacity) by converting the input into two biased i.i.d. sequences. They also use a randomized initial labeling of certain points in Z in order to facilitate analysis. The coding rate calculations in [16] [17], and [19] were performed without a precisely defined mapping from unbiased input sequences to biased sequences, and without prescribing how the infinite biased sequence is encoded using finite size regions in Z . One specific (and efficient) implementation of the Roth SiegelWolf coding ....
[Article contains additional citation context not shown here]
R. M. Roth, P. H. Siegel, and J. K. Wolf. Efficient coding schemes for the hard-square model. IEEE Trans. Inform. Theory, 47(3):1166--1176, March 2001. 38
Asymptotic Capacity of Two-dimensional Channels with.. - Nagy, Zeger (2002) (1 citation) (Correct)
....rectangular binary array. An important special two dimensional channel is one satisfying the (d; 1) run length constraint. In two dimensions, the (1; 1) constraint, for example, has been studied in terms of computing the channel capacity [4] 7] and for efficient coding algorithms [21], 22] The capacity of the (1; 1) constrained channel is not known exactly, but has been very accurately upper and lower bounded. If a two dimensional (d; 1) run length constraint is further constrained along one diagonal direction to similarly only The research was supported in part by the ....
R.M. Roth, P.H. Siegel, and J.K. Wolf. Efficient coding schemes for the hard-square model. IEEE Trans. Info. Theory, 47:1166--1176, March 2001.
Zero Capacity Region of Multidimensional Run Length Constraints - Hisashi Ito Dept (1999) (4 citations) (Correct)
....whenever k d 0. Very tight upper and lower bounds on the (0; 1) capacity were given for two dimensions in [1] improved in [2, 7] and extended to three dimensions in [7] In [9] an encoding procedure for the 2dimensional (d; 1) constraint was given for all positive integer d s, and in [8] an encoding procedure for the 2 dimensional (0; 1) constraint was given whose coding rating comes very close to the capacity. It was shown [5] that whenever k d 1, the 2 dimensional capacity is zero if and only if k = d 1. II. Main Results We present two main results that characterize the ....
R.M. Roth, P.H. Siegel, and J.K. Wolf, "Efficient Coding Schemes for the Hard-Square Model," IEEE Trans. Inform. Theory, (submitted October 1999).
Partial Characterization of the Positive Capacity Region of .. - Akiko Kato Kenneth (2000) (2 citations) (Correct)
....If d = d 1 = d 2 and k = k 1 = k 2 (this is called the symmetric constraint) then the twodimensional (d 1 ; k 1 ; d 2 ; k 2 ) capacity is called the two dimensional (d; k) capacity, and is denoted by C d;k . Two dimensional run length constraints have recently become a focus of increased study [1, 2, 4, 5, 6, 7, 9, 15, 16, 21]. A proof was given in [9] that shows the twodimensional (d; k) capacities exist, and essentially the same proof shows that the C d1 ;k 1 ;d 2 ;k 2 exist. The two dimensional asymmetric positive capacity region is the set f(d 1 ; k 1 ; d 2 ; k 2 ) C d1 ;k 1 ;d 2 ;k 2 0g: It is of interest ....
....was given in [9] and is stated as the proposition below. Proposition 1 C d;k 0 if and only if k Gamma d 2 or (d; k) 0; 1) Fairly tight upper and lower bounds on the value of C 0;1 were given in [2] improved in [6, 12] and extended to three dimensional run length constraints in [12] In [15] an encoding procedure for the symmetric two dimensional (0; 1) constrained channel was given whose coding rating comes incredibly close to the capacity C 0;1 . For other positive twodimensional (d; k) capacities various bounds were given in [9, 16] and approximations were given in [21] ....
R.M. Roth, P.H. Siegel, and J.K. Wolf, "Efficient Coding Schemes for the Hard-Square Model," IEEE Trans. Inform. Theory, (submitted October 1999).
Convergence Rates for Runlength Constrained Capacities - Pomerance, Zeger (2001) (Correct)
No context found.
R.M. Roth, P.H. Siegel, and J.K. Wolf, "Efficient Coding Schemes for the Hard-Square Model," IEEE Transactions on Information Theory, vol. 47, no 3, March 2001, pp. 1166--1176.
Capacity Bounds for the Hard-Triangle Model - Nagy, Zeger (2002) (1 citation) (Correct)
No context found.
R. M. Roth, P. H. Siegel, and J. K. Wolf. Efficient coding schemes for the hard-square model. IEEE Trans. Inform. Theory, 47(3):1166--1176, March 2001.
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