State space realizations and monomial equivalence for convolutional codes

Heide Gluesing-Luerssen, Gert Schneider

Research output: Contribution to journalArticlepeer-review

13 Scopus citations


We will study convolutional codes with the help of state space realizations. It will be shown that two such minimal realizations belong to the same code if and only if they are equivalent under the full state feedback group. This result will be used in order to prove that two codes with positive Forney indices are monomially equivalent if and only if they share the same adjacency matrix. The adjacency matrix is an invariant of the code obtained via a minimal state space realization and counts in a detailed way the weights of all possible outputs. It contains full information about the weights of the codewords in the given code.

Original languageEnglish
Pages (from-to)518-533
Number of pages16
JournalLinear Algebra and Its Applications
Issue number2-3
StatePublished - Sep 1 2007


  • Convolutional codes
  • Minimal realizations
  • Monomial equivalence
  • Weight adjacency matrix

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Numerical Analysis
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'State space realizations and monomial equivalence for convolutional codes'. Together they form a unique fingerprint.

Cite this