State Space Realizations and Monomial Equivalence for Convolutional Codes

Simple item page
dc.creatorGluesing-Luerssen, Heide
dc.creatorSchneider, Gert
dc.date2006-03-13
dc.date.accessioned2026-07-07T08:16:25Z
dc.date.available2026-07-07T08:16:25Z
dc.descriptionWe 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 counts in a detailed way the weights of all possible outputs and thus contains full information about the weights of the codewords in the given code.
dc.identifierhttps://arxiv.org/abs/cs/0603049
dc.identifierhttp://arxiv.org/abs/cs/0603049
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133774
dc.subjectInformation Theory
dc.subjectOptimization and Control
dc.titleState Space Realizations and Monomial Equivalence for Convolutional Codes
dc.typetext

Files

Collections

arXiv