Capacity Lower Bounds for Two-Dimensional M-ary (0, k) and (d, ¿) Runlength-limited Channels

Shayan Garani Srinivasa, Stephen McLaughlin · 2006

We present lower bounds on the two-dimensional capacity for two sets of symmetric and asymmetric M-ary runlength-limited constraints. The bounds extend and generalize our previous work on binary constraints. We also give sequential coding algorithms achieving the derived capacity lower bounds

Read the paper · More papers on PaperTik