Zsigmond Nagy, Kenneth Zeger  Home/Search
Context Related
| ucsd.edu/~zeger/pu...mitted_fixed.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucsd.edu/~zeger/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A rigorous derivation is given of the coding rate of a variable-to-variable length bit stuffing coder for a two-dimensional (1; 1)-constrained channel. The coder studied is "nearly" a fixed-to-fixed length algorithm. Then an analogous variable-to-variable length bit stuffing algorithm for the three-dimensional (1; 1)-constrained channel is presented, and its coding rate is analyzed using the two-dimensional method. The three-dimensional coding rate is demonstrated to be at least 0:502, which... (Update)
Similar documents based on text: More All
0.8: Capacity Bounds for the 3-dimensional (0,1) Runlength Limited.. - Nagy, Zeger (1999) (Correct)
0.6: Asymptotic Capacity of Two-dimensional Channels with.. - Nagy, Zeger (2002) (Correct)
0.5: Zero Capacity Region of Multidimensional Run Length.. - Ito, Kato, Nagy, Zeger (1999) (Correct)
BibTeX entry: (Update)
Zs. Nagy and K. Zeger. Bit stuffing algorithms and analysis for run length constrained channels in two and three dimensions. IEEE Trans. Inform. Theory, (submitted November 2002). http://citeseer.ist.psu.edu/nagy02bit.html More
@misc{ nagy02bit,
author = "Z. Nagy and K. Zeger",
title = "Bit stuffing algorithms and analysis for run length constrained channels
in two and three dimensions",
text = "Zs. Nagy and K. Zeger. Bit stuffing algorithms and analysis for run length
constrained channels in two and three dimensions. IEEE Trans. Inform. Theory,
(submitted November 2002).",
year = "2002",
url = "citeseer.ist.psu.edu/nagy02bit.html" }
Citations (may not include all citations):2319 Elements of Information Theory (context) - Cover, Thomas - 1991
1447 A mathematical theory of communication (context) - Shannon - 1948
29 Codes for digital recorders - Immink, Siegel et al. - 1998
28 The number of independent sets in a grid graph (context) - Calkin, Wilf - 1998
26 the capacity of two-dimensional run length constrained chann.. - Kato, Zeger - 1999
21 The capacity and coding gain of certain checkerboard codes (context) - Weeks, Blahut - 1998
13 Two-dimensional low-pass filtering codes (context) - Ashley, Marcus - 1998
10 Efficient code construction for certain two-dimensional cons.. (context) - Talyansky, Etzion et al. - 1999
10 Cascading methods for runlength-limited arrays (context) - Etzion - 1997
8 Zero capacity region of multidimensional run length constrai.. - Ito, Kato et al. - 1999
6 Conservative arrays: Multidimensional modulation codes for h.. (context) - Vardy, Blaum et al. - 1996
6 Efficient coding schemes for the hard-square model - Roth, Siegel et al. - 2001
5 A universal algorithm for generating optimal and nearly opti.. (context) - Bender, Wolf - 1993
4 Combined error correctingmodulation recording code (context) - error, recording et al. - 1988
4 Bit stuffing bounds on the capacity of 2-dimensional constra.. (context) - Siegel, Wolf - 1998
[Article contains additional citations not shown here]
Documents on the same site (http://www.code.ucsd.edu/~zeger/pubs.html): More
Universal Bound on the Performance of Lattice Codes - Tarokh, Vardy, Zeger (1996) (Correct)
Performance of Quantizers on Noisy Channels using Structured.. - Méhes, Zeger (Correct)
Randomly Chosen Index Assignments Are Asymptotically Bad for.. - Méhes, Zeger (1999) (Correct)
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