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

摘要

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