• DocumentCode
    1025324
  • Title

    A (16, 9, 6, 5, 4) error-correcting DC free block code

  • Author

    Blaum, Mario

  • Author_Institution
    IBM Almaden Res. Center, San Jose, CA, USA
  • Volume
    34
  • Issue
    1
  • fYear
    1988
  • fDate
    1/1/1988 12:00:00 AM
  • Firstpage
    138
  • Lastpage
    141
  • Abstract
    A (2n, k, l, c, d) DC free binary block code is a code of length 2n, constant weight n, 2k codewords, maximum runlength of a symbol l , maximum accumulated charge c, and minimum distance d . The purpose of this code is to achieve DC freeness and error correction at the same time. The goal is to keep the rate k/2 n and d large and l and c small. Of course, these are conflicting goals. H.C. Ferreira (IEEE Trans. Magn., vol.MAG-20, no.5, p.881-3, 1984) presented a (16, 8, 8, 5, 4) DC free code. Here, a (16, 9, 6, 5, 4) DC free code is presented. Easy encoding and decoding algorithms are also given
  • Keywords
    decoding; encoding; error correction codes; (16, 9, 6, 5, 4) DC free code; binary block code; codewords; constant weight; decoding; encoding; error correction; error-correcting DC free block code; maximum accumulated charge; maximum runlength; minimum distance; Block codes; Decoding; Entropy; Error correction codes; Hamming distance; Hamming weight; Magnetic recording;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.2613
  • Filename
    2613