A large class of maximum-transition-run (MTR) block codes is presented that is based on a novel low-complexity enumerative encoding scheme. This new class of MTR codes is obtained by a general design method to construct capacity-efficient MTR codes with predetermined j and k constraints and limited error propagation at the decoder. Typically, these codes are designed to improve the distance properties of a generalized partial-response detector trellis. Another way to use MTR codes consists in applying even/odd interleaving to construct long high-rate PRML(G,I,M) modulation codes that satisfy tight global G = 2k and interleaved I = k constraints. Furthermore, these (G,I) constrained codes satisfy the M = 2j constraint, i.e., they have limited runs of alternating 2T magnets at the channel input.
A shortened version of this report (titled: Enumerative Encoding of Maximum-Transition-Run Codes) appears in: Proc. 10th Int'l Symp. on Communication Theory and Applications "ISCTA '09," Ambleside, United Kingdom (July 2009).
By: Thomas Mittelholzer
Published in: RZ3723 in 2009
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .