Computational cutoff rate of an input runlength-limited BSC
Shih‐Hsuan Yang · 2002
Runlength-limited (RLL) codes are widely used in digital recording systems. A new lower bound for the computational cutoff rate of a binary symmetric channel having an input runlength-limited constraint is derived. The derivation is based on a random coding argument together with generating function techniques. Our result outperforms the existing lower hound.