A new method for erasure decoding of convolutional codes
Open Access
- 3 April 2025
- journal article
- research article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (8) , 2897-2918
Abstract
In this paper, we propose a new erasure decoding algorithm for convolutional codes using the generator matrix. This implies that our decoding method also applies to catastrophic convolutional codes in opposite to the classic approach using the parity-check matrix. We compare the performance of both decoding algorithms. Moreover, we enlarge the family of optimal convolutional codes (complete-MDP) based on the generator matrix.Keywords
All Related Versions
Funding Information
- Deutsche Forschungsgemeinschaft (513811367)
- Center for Research and Development in Mathematics and Applications (UIDB/04106/2020)
- Grundlagenforschungsfond, Universität St. Gallen (2260780)
- University of St.Gallen
This publication has 9 references indexed in Scilit:
- On the left primeness of some polynomial matrices with applications to convolutional codesJournal of Algebra and Its Applications, 2020
- Complete j-MDP Convolutional CodesIEEE Transactions on Information Theory, 2020
- Complete MDP convolutional codesJournal of Algebra and Its Applications, 2019
- Superregular matrices and applications to convolutional codesLinear Algebra and its Applications, 2016
- Decoding of Convolutional Codes Over the Erasure ChannelIEEE Transactions on Information Theory, 2012
- Strongly-MDS convolutional codesIEEE Transactions on Information Theory, 2006
- Maximum Distance Separable Convolutional CodesApplicable Algebra in Engineering, Communication and Computing, 1999
- Convolutional codes I: Algebraic structureIEEE Transactions on Information Theory, 1970
- Gaussian elimination is not optimalNumerische Mathematik, 1969