S. Halevy and R. M. Roth. Parallel constrained coding with application to two-dimensional constraints. IEEE Trans. Inform. Theory, IT-48:1009--1020, May 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Asymptotic Capacity of Two-dimensional Channels with.. - Nagy, Zeger (2002) (1 citation) (Correct)
....in graphs. The capacities are also closely related to gases, lattices, and Ising model entropies in statistical mechanics [2] In addition to run length constraints, other types of constraints can be used to model two dimensional channels for certain applications [1] 8] 9] 10] 12] [13], 23] 24] 25] 27] 28] For example, run length constraints along diagonals in both directions (northwest southeast and northeastsouthwest) can be imposed, in addition to horizontal and vertical constraints. An example of a circularly symmetric twodimensional constraint occurs by requiring ....
S. Halevy and R. Roth. Parallel constrained coding with application to two-dimensional constraints. IEEE Trans. Info. Theory, IT-48:1009-- 1020, May 2002.
On the Capacity of 2-D Constrained Codes and Consequences for.. - Weeks (Correct)
....this paper are related to two dimensional RLL codes. Work related to computing capacity for general constraints for two dimensional codes also exists [3] 2] 19] 6] 5] Finally, work in constructing e#cient encoders and decoders for constrained two dimensional codes has also been completed [8]. Computing the capacity of a two dimensional constrained code appears to be intrinsically harder than computing the capacity of a one dimensional constrained code. In Section 2 the capacity of a constrained 2 D code (i.e. checkerboard code) is computed by constructing a matrix recursion, ....
....in Table 2. These numbers reflect data density that has been adjusted by code rate and assume the existence of encoders and decoders that can come arbitrarily close to capacity values calculated by Weeks and Blahut [18] Such encoders and decoders can be designed by using a multitrack approach [8], though issues of complexity and suboptimality loom. It is also assumed that a di#erential encoder exists that guarantees large blocks of ones and zeros. Designing capacity achieving encoders, decoders, and appropriate di#erential encoders remains an open problem. Because such encoders and ....
S. Halevy and R. M. Roth. Parallel constrained coding with application to twodimensional constraints. IEEE Transactions on Information Theory, 48(5):1009--1020, May 2002.
Capacity Bounds for the Hard-Triangle Model - Nagy, Zeger (2002) (1 citation) (Correct)
No context found.
S. Halevy and R. M. Roth. Parallel constrained coding with application to two-dimensional constraints. IEEE Trans. Inform. Theory, IT-48:1009--1020, May 2002.
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