State Space Realizations and Monomial Equivalence for Convolutional Codes
<|reference_start|>State Space Realizations and Monomial Equivalence for Convolutional Codes: 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 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.<|reference_end|>
@article{gluesing-luerssen2006state,
    title={State Space Realizations and Monomial Equivalence for Convolutional
  Codes},
    author={Heide Gluesing-Luerssen and Gert Schneider},
    journal={arXiv preprint arXiv:cs/0603049},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0603049},
    primaryClass={cs.IT math.IT math.OC}
}