State space realizations and monomial equivalence for convolutional codes

DOI10.1016/j.laa.2007.03.004zbMath1140.94016arXivcs/0603049MaRDI QIDQ998191

Heide Gluesing-Luerssen, Gert Schneider

Publication date: 27 August 2007

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0603049

zbMATH Keywords

convolutional codes; minimal realizations; monomial equivalence; weight adjacency matrix

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

93B20: Minimal systems representations

93B15: Realizations from input-output data

94B10: Convolutional codes

Related Items

Minimal Trellis Construction for Finite Support Convolutional Ring Codes

Cites Work

• Fast projection methods for minimal design problems in linear system theory
• Finite-ring combinatorics and MacWilliams' equivalence theorem
• Characters and the equivalence of codes
• Convolutional codes with maximum distance profile
• On the equivalence of codes over rings and modules
• On the weight distribution of convolutional codes
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• Quasi-cyclic unit memory convolutional codes
• On the MacWilliams Identity for Convolutional Codes
• The McMillan degree of a polynomial system matrix†
• Fundamentals of Error-Correcting Codes
• BCH convolutional codes
• Woven convolutional codes .I. Encoder properties
• The Use of State Feedback for Exact Model Matching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item