Capacity bounds for two-dimensional asymmetric M-ary (0, k) and (d,∞) runlength-limited channels

Authors:
Shayan G. Srinivasa;Steven W. McLaughlin
Affiliations:
School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA;School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA
Venue:
IEEE Transactions on Communications
Year:
2009

Citing 10
Cited 0

Elements of information theory

Elements of information theory
An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
The Number of Independent Sets in a Grid Graph

SIAM Journal on Discrete Mathematics
Holographic Data Storage

Holographic Data Storage
New bounds on the capacity of multi-dimensional RLL-Constrained systems

AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Codes for digital recorders

IEEE Transactions on Information Theory
Entropy bounds for constrained two-dimensional random fields

IEEE Transactions on Information Theory
On the capacity of two-dimensional run-length constrained channels

IEEE Transactions on Information Theory
Efficient coding schemes for the hard-square model

IEEE Transactions on Information Theory
Improved bit-stuffing bounds on two-dimensional constraints

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present bounds on the two-dimensional capacity for two sets of symmetric and asymmetric M-ary runlength-limited constraints based on simple constructions. The bounds extend and generalize previous work on binary constraints.