Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
