On 2D finite support convolutional codes: An algebraic approach
From MaRDI portal
Publication:1329004
DOI10.1007/BF00980707zbMath0794.94016OpenAlexW2028700264MaRDI QIDQ1329004
Ettore Fornasini, Valcher, Maria Elena
Publication date: 21 July 1994
Published in: Multidimensional Systems and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00980707
Multivariable systems, multidimensional control systems (93C35) Discrete-time control/observation systems (93C55) Convolutional codes (94B10)
Related Items
From 1D Convolutional Codes to 2D Convolutional Codes of Rate 1/n ⋮ On the control of finite support behaviors ⋮ MDS 2D convolutional codes with optimal 1D horizontal projections ⋮ A construction of MDS 2D convolutional codes of rate \(1/n\) based on superregular matrices ⋮ Realization of 2D convolutional codes of rate \(\frac{1}{n}\) by separable Roesser models ⋮ Series concatenation of 2D convolutional codes by means of input-state-output representations ⋮ Control systems analysis for the Fornasini-Marchesini 2D systems model – progress after four decades ⋮ The predictable degree property and minimality in multidimensional convolutional coding ⋮ Serial concatenation of a block code and a 2D convolutional code ⋮ Realization of 2D \((2,2)\)-periodic encoders by means of 2D periodic separable Roesser models ⋮ Non-catastrophicity in multidimensional convolutional coding ⋮ Composition codes ⋮ Decoding of 2D convolutional codes over an erasure channel
Cites Work
- Unnamed Item
- Minimality and observability of group systems
- The Quillen - Suslin theorem and the structure of n-dimensional elementary polynomial matrices
- The dynamics of group codes: state spaces, trellis diagrams, and canonical encoders
- Algebraic aspects of two-dimensional convolutional codes
- Convolutional codes I: Algebraic structure
This page was built for publication: On 2D finite support convolutional codes: An algebraic approach
