• DocumentCode
    3014490
  • Title

    Trellis matched codes for partial response channels

  • Author

    Filho, Bartolomeu F Uchôba ; Herro, Mark A.

  • Author_Institution
    DECOM-FEEC, Univ. Estadual de Campinas, Sao Paulo, Brazil
  • fYear
    1997
  • fDate
    29 Jun-4 Jul 1997
  • Firstpage
    98
  • Abstract
    The paper considers the design of zero run-length limited (ZRLL) trellis codes with large minimum free squared Euclidean distance, d2free, and low state-complexity, for the Pn (D)=(1-D)(1+D)n partial response channels, where n is a nonnegative integer
  • Keywords
    channel coding; convolutional codes; partial response channels; runlength codes; trellis codes; convolutional encoder; large minimum free squared Euclidean distance; low state-complexity; partial response channels; trellis matched codes; zero run-length limited trellis codes; Convolutional codes; Decoding; Euclidean distance; Hamming distance; Magnetic recording; Partial response channels; Partial response signaling; Scholarships; Sufficient conditions; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
  • Conference_Location
    Ulm
  • Print_ISBN
    0-7803-3956-8
  • Type

    conf

  • DOI
    10.1109/ISIT.1997.613013
  • Filename
    613013