An analysis on optimal rates of BDB encoders for RLL and MTR systems

In most recording systems, user data is translated to sequences that satisfy some constraint like run-length limited (RLL) and maximum transition run (MTR). An encoder for such a constraint is block decodable encoder. In this paper, the encoder is no longer a finite-state encoder and the encoding process uses the look ahead technique. An look ahead encoder such that the input labeling is consistent is called a bounded-delay-encodable block-decodable encoder. For look-ahead and BDB encoders state-tree as a basis for constructing the encoders. A concept called path-classes to characterize these classes of encoders is used.