Towards a MacWilliams identity for convolutional codes

Heide Gluesing-Luerssen, Gert Schneider

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The weight adjacency matrix associated with a convolutional code collects in a detailed manner information about the weight distribution of the code. We will formulate a MacWilliams Identity Conjecture stating that the adjacency matrix of a code fully determines the adjacency matrix of the dual code. An explicit formula for the transformation will be stated as well; it involves the MacWilliams matrix known from complete weight enumerators of block codes. The conjecture will be proven for the class of convolutional codes where either the code or its dual is a unit memory code. For the general case the conjecture is backed up by many examples, and a weaker version will be established.

Original languageEnglish
Title of host publicationProceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Pages2691-2695
Number of pages5
DOIs
StatePublished - 2007
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
Duration: Jun 24 2007Jun 29 2007

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Conference

Conference2007 IEEE International Symposium on Information Theory, ISIT 2007
Country/TerritoryFrance
CityNice
Period6/24/076/29/07

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Towards a MacWilliams identity for convolutional codes'. Together they form a unique fingerprint.

Cite this