Erasure decoding of convolutional codes using first-order representations
From MaRDI portal
Publication:2236445
Abstract: In this paper, we employ the linear systems representation of a convolutional code to develop a decoding algorithm for convolutional codes over the erasure channel. We study the decoding problem using the state space description and this provides in a natural way additional information. With respect to previously known decoding algorithms, our new algorithm has the advantage that it is able to reduce the decoding delay as well as the computational effort in the erasure recovery process. We describe which properties a convolutional code should have in order to obtain a good decoding performance and illustrate it with an example.
Recommendations
Cites work
- A first approximation of concatenated convolutional codes from linear systems theory viewpoint
- A new class of superregular matrices and MDP convolutional codes
- BCH convolutional codes
- Complete j-MDP Convolutional Codes
- Concatenation of convolutional codes and rank metric codes for multi-shot network coding
- Convolutional codes with maximum distance profile
- Decoding of Convolutional Codes Over the Erasure Channel
- Error control coding. Fundamentals and applications
- Gaussian elimination is not optimal
- scientific article; zbMATH DE number 3711820 (Why is no real title available?)
- scientific article; zbMATH DE number 65823 (Why is no real title available?)
- scientific article; zbMATH DE number 1284425 (Why is no real title available?)
- Linear system modelization of concatenated block and convolutional codes
- On behaviors and convolutional codes
- Parallel concatenated convolutional codes from linear systems theory viewpoint
- Strongly-MDS convolutional codes
- Superregular matrices and applications to convolutional codes
Cited in
(6)- Decoding of 2D convolutional codes over an erasure channel
- List decoding of convolutional codes over integer residue rings
- Error-resilient first-order multiplexed source codes: performance bounds, design and decoding algorithms
- A decoding algorithm for 2D convolutional codes over the erasure channel
- An algorithm to compute a minimal input-state-output representation of a convolutional code
- Construction of observable and MDP convolutional codes with good decodable properties by ISO representations
This page was built for publication: Erasure decoding of convolutional codes using first-order representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2236445)