• DocumentCode
    1486598
  • Title

    Combined ECC/RLL codes

  • Author

    Lin, Yinyi ; Wolf, Jack K.

  • Author_Institution
    Center for Magnetic Recording Res., California Univ., San Diego, La Jolla, CA, USA
  • Volume
    24
  • Issue
    6
  • fYear
    1988
  • fDate
    11/1/1988 12:00:00 AM
  • Firstpage
    2527
  • Lastpage
    2529
  • Abstract
    Two novel combined error-correcting/run-length-limited (ECC/RLL) trellis codes are presented. One is a two-state (1,3) code with a Hamming distance 4, and the other is a four-state (2,6) code with a hamming distance 3. Each of these codes is decoded by a Viterbi decoder. A second coding scheme is discussed that uses a long constraint convolutional ECC code and a standard RLL modulation code. A single sequential decoder decides both codes by finding the best path through a single tree which describes both of them. Two RLL codes were utilized: a Miller (1,3) code and a (2,7) sliding block code. A comparison of the performance of these competing schemes shows that the code with sequential decoding, while requiring a much more complex decoder, far outperforms the simpler trellis codes, due to the long constraint length of the code used for sequential decoding
  • Keywords
    error correction codes; magnetic recording; Hamming distance; Miller code; RLL codes; Viterbi decoder; coding scheme; combined ECC/RLL codes; convolutional ECC code; error correcting codes; four state code; long constraint length; performance; run length limited codes; sequential decoder; sequential decoding; sliding block code; standard RLL modulation code; trellis codes; two state code; Block codes; Computer errors; Convolutional codes; Decoding; Error correction codes; Error probability; Hamming distance; Magnetic recording; Modulation coding; Viterbi algorithm;
  • fLanguage
    English
  • Journal_Title
    Magnetics, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9464
  • Type

    jour

  • DOI
    10.1109/20.92163
  • Filename
    92163