The predictable degree property and minimality in multidimensional convolutional coding
From MaRDI portal
Publication:1712522
DOI10.1016/j.disc.2018.11.010zbMath1408.94985OpenAlexW2902828926MaRDI QIDQ1712522
Publication date: 22 January 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.11.010
Related Items (1)
Cites Work
- Input-state-output representations and constructions of finite support 2D convolutional codes
- Algebraic decoder of multidimensional convolutional code: Constructive algorithms for determining syndrome decoder and decoder matrix based on Gröbner basis
- On 2D finite support convolutional codes: An algebraic approach
- ``Reduced Polynomial Matrices” in Several Variables
- Minimal and canonical rational generator matrices for convolutional codes
- Algebraic aspects of two-dimensional convolutional codes
- The Geometry of Syzygies
- Multidimensional Convolutional Codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The predictable degree property and minimality in multidimensional convolutional coding