On weight enumerators and MacWilliams identity for convolutional codes

Irina Bocharova, Florian Hug, Rolf Johannesson, Boris Kudryashov

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

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.
Original languageEnglish
Title of host publication[Host publication title missing]
DOIs
Publication statusPublished - 2010
EventInformation Theory and Applications Workshop (ITA), 2010 - San Diego, San Diego, CA, United States
Duration: 2010 Jan 312010 Feb 5

Conference

ConferenceInformation Theory and Applications Workshop (ITA), 2010
Country/TerritoryUnited States
CitySan Diego, CA
Period2010/01/312010/02/05

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Fingerprint

Dive into the research topics of 'On weight enumerators and MacWilliams identity for convolutional codes'. Together they form a unique fingerprint.

Cite this