Abstract
A new class of M-ary two-dimensional (2-D) run-length limited (RLL) constraints is introduced in this paper. In particular, only RLL d constraints on 2D m /spl times/ n arrays with limited height m are considered. Column vectors of 2-D arrays are used as states in a directed graph. The transfer matrix of the graph is obtained with consideration of non-binary alphabet, and the largest eigenvalue of the transfer matrix is used to calculate the capacity of 2-D (M, d, /spl infin/) RLL constraints on 2-D arrays. Some numerical results are derived for RLL d = 1 and d = 2 constraints. We also present an example of efficient finite-state encoder for d = 1 constraint by state splitting and merging algorithm. The 2-D (M, d, /spl infin/) constrained codes have potential to be applied in advanced 2-D optical recording channels.
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.
