Enumerative Modulation Codes Based on Sliding-Window Substitutions

We consider high-rate modulation codes satisfying tight global and interleave (G,I) constraints for magnetic storage systems. We use a novel sliding-window substitution coding technique to improve on known long capacity-efficient (G =2 gamma, I = gamma) codes. This coding technique maps one-sided (G = 2 gamma, I = gamma)-constrained sequences into one-sided sequences satisfying a substantially tighter G constraint and a slightly relaxed I constraint. Sliding-window substitution encoding in conjunction with enumerative encoding provides high-rate capacity-efficient codes that are relevant for practical magnetic storage systems.

By: Thomas Mittelholzer, Roy Cideciyan

Published in: Proc. 2014 IEEE Int’l Symp. on Information Theory (ISIT), June 29-July 4, 2014Piscataway, NJ, IEEE, p.1613 in 2014


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 .