A decoding algorithm for 2D convolutional codes over the erasure channel
From MaRDI portal
Publication:6112287
DOI10.3934/amc.2021031zbMath1517.94209arXiv2006.10527OpenAlexW3198183591MaRDI QIDQ6112287
Publication date: 7 July 2023
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.10527
Cites Work
- Unnamed Item
- Unnamed Item
- Decoding of 2D convolutional codes over an erasure channel
- Superregular matrices and applications to convolutional codes
- A construction of MDS 2D convolutional codes of rate \(1/n\) based on superregular matrices
- Input-state-output representations and constructions of finite support 2D convolutional codes
- MDS 2D convolutional codes with optimal 1D horizontal projections
- Matrix fraction descriptions in convolutional coding
- Convolutional codes with maximum distance profile
- Gaussian elimination is not optimal
- Maximum Distance Separable 2D Convolutional Codes
- Strongly-MDS convolutional codes
- Algebraic aspects of two-dimensional convolutional codes
- Complete j-MDP Convolutional Codes
- Locally Invertible Multidimensional Convolutional Encoders
- Decoding of Convolutional Codes Over the Erasure Channel
- Complete MDP convolutional codes
This page was built for publication: A decoding algorithm for 2D convolutional codes over the erasure channel