Blind recognition of punctured convolutional codes
From MaRDI portal
Recommendations
- A fast method for blind identification of \( (2,1,m)\) convolutional codes under high error bit ratios
- An algorithm for identifying rate (n-1)/n catastrophic punctured convolutional encoders
- Rational rate punctured convolutional codes for soft-decision Viterbi decoding
- Punctured recursive convolutional encoders and their applications in turbo codes
- scientific article; zbMATH DE number 4208001
Cited in
(12)- Invariancies in punctured convolutional codes. -- Their effect on Viterbi synchronization
- Properties of syndrome distribution for blind reconstruction of cyclic codes
- Blind recognition method for the Turbo codes on trellis termination
- scientific article; zbMATH DE number 6612135 (Why is no real title available?)
- Identifying an unknown code by partial Gaussian elimination
- Information-dispersion-entropy-based blind recognition of binary BCH codes in soft decision situations
- Blind recognition of linear block codes based on matrix analysis
- A fast method for blind identification of \( (2,1,m)\) convolutional codes under high error bit ratios
- A study on new right/left inverses of nonsquare polynomial matrices
- Searching punctured convolutional codes based on quantum genetic algorithm
- Fast computation of Gröbner basis of homogeneous ideals of \(\mathbb{F}[x, y]\)
- Blind recognition of binary BCH codes for cognitive radios
This page was built for publication: Blind recognition of punctured convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866170)
