On weight enumerators and MacWilliams identity for convolutional codes

Irina Bocharova, Florian Hug, Rolf Johannesson, Boris Kudryashov

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceedingPeer review

Sammanfattning

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.
Originalspråkengelska
Titel på värdpublikation[Host publication title missing]
DOI
StatusPublished - 2010
EvenemangInformation Theory and Applications Workshop (ITA), 2010 - San Diego, San Diego, CA, USA
Varaktighet: 2010 jan. 312010 feb. 5

Konferens

KonferensInformation Theory and Applications Workshop (ITA), 2010
Land/TerritoriumUSA
OrtSan Diego, CA
Period2010/01/312010/02/05

Ämnesklassifikation (UKÄ)

  • Elektroteknik och elektronik

Fingeravtryck

Utforska forskningsämnen för ”On weight enumerators and MacWilliams identity for convolutional codes”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här