• DocumentCode
    2202038
  • Title

    On weight enumerators and MacWilliams identity for convolutional codes

  • Author

    Bocharova, Irina E. ; Hug, Florian ; Johannesson, Rolf ; Kudryashov, Boris D.

  • Author_Institution
    Dept. of Inf. Syst., St. Petersburg Univ. of Inf. Technol., Mech. & Opt., St. Petersburg, Russia
  • fYear
    2010
  • fDate
    Jan. 31 2010-Feb. 5 2010
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    Convolutional codes are defined to be equivalent if their code symbols differ only in how they are ordered and two generator matrices are defined to be weakly equivalent (WE) if they encode equivalent convolutional codes. It is shown that tailbiting convolutional codes encoded by WE minimal-basic generator matrices have the same spectra. Shearer and McEliece showed that MacWilliams identity does not hold for convolutional codes. However, for the spectra of truncated convolutional codes and their duals, MacWilliams identity clearly holds. It is shown that the dual of a truncated convolutional code is not a truncation of a convolutional code but its reversal is. Finally, a recursion for the spectra of truncated convolutional codes is given and the spectral components are related to those for the corresponding dual codes.
  • Keywords
    convolutional codes; dual codes; MacWilliams identity; code symbols; dual codes; equivalent convolutional codes; minimal basic generator matrices; truncated convolutional codes; weakly equivalent; weight enumerators; Block codes; Convolutional codes; Error probability; Information systems; Information technology; Maximum likelihood decoding; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory and Applications Workshop (ITA), 2010
  • Conference_Location
    San Diego, CA
  • Print_ISBN
    978-1-4244-7012-9
  • Electronic_ISBN
    978-1-4244-7014-3
  • Type

    conf

  • DOI
    10.1109/ITA.2010.5454120
  • Filename
    5454120