Maximum transition run codes for data storage systems
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 32 (5) , 3992-3994
- https://doi.org/10.1109/20.539241
Abstract
A new code is presented which improves the minimum distance properties of sequence detectors operating at high linear densities. This code, which is called the maximum transition run code, eliminates data patterns producing three or more consecutive transitions while imposing the usual k-constraint necessary for timing recovery. The code possesses the similar distance-gaining property of the (1,k) code, but can be implemented with considerably higher rates. Bit error rate simulations on fixed delay tree search with decision feedback and high order partial response maximum likelihood detectors confirm large coding gains over the conventional (0,k) codeKeywords
This publication has 8 references indexed in Scilit:
- A signal space representation of fixed delay tree search for use with d=0 codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A high dimensional signal space implementation of FDTS/DFIEEE Transactions on Magnetics, 1996
- Coding for higher-order partial-response channelsPublished by SPIE-Intl Soc Optical Eng ,1995
- Nonlinearities in thin-film media and their impact on data recoveryIEEE Transactions on Magnetics, 1993
- Discrete-time modeling of transition noise dominant channels and study of detection performanceIEEE Transactions on Magnetics, 1991
- Performance comparison of detection methods in magnetic recordingIEEE Transactions on Magnetics, 1990
- Coding techniques for the noisy magnetic recording channel: a state-of-the-art reportIEEE Transactions on Communications, 1989
- Recording codes for digital magnetic storageIEEE Transactions on Magnetics, 1985