Rational rate punctured convolutional codes for soft-decision Viterbi decoding
From MaRDI portal
Recommendations
- Short convolutional codes with maximal free distance for rates 1/2, 1/3, and 1/4 (Corresp.)
- An Extensive Search for Good Punctured Rate->tex<$ kover k+1$>/tex<Recursive Convolutional Codes for Serially Concatenated Convolutional Codes
- Some rate 1/3 and 1/4 binary convolutional codes with an optimum distance profile (Corresp.)
- scientific article; zbMATH DE number 4208001
- Design and decoding of optimal high-rate convolutional codes
Cited in
(11)- On maximum length convolutional codes under a trellis complexity constraint
- Periodic state-space representations of periodic convolutional codes
- On the performance of sequential and Viterbi decoders for high-rate punctured convolutional codes
- Invariancies in punctured convolutional codes. -- Their effect on Viterbi synchronization
- An Extensive Search for Good Punctured Rate->tex<$ kover k+1$>/tex<Recursive Convolutional Codes for Serially Concatenated Convolutional Codes
- scientific article; zbMATH DE number 3934930 (Why is no real title available?)
- Punctured uniform codes
- Punctured recursive convolutional encoders and their applications in turbo codes
- An algorithm for identifying rate (n-1)/n catastrophic punctured convolutional encoders
- Searching punctured convolutional codes based on quantum genetic algorithm
- Blind recognition of punctured convolutional codes
This page was built for publication: Rational rate punctured convolutional codes for soft-decision Viterbi decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4345636)
