Design and decoding of optimal high-rate convolutional codes
From MaRDI portal
Recommendations
- Cryptography and Coding
- On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
- Decoding of High Rate Convolutional Codes Using the Dual Trellis
- A new class of high-rate orthogonalizable convolutional codes
- scientific article; zbMATH DE number 1314690
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Convolutional codes: techniques of construction
- Convolutional codes
- scientific article; zbMATH DE number 3865152
- Using combinatorial optimization to design good unit-memory convolutional codes
Cited in
(5)- On the performance of sequential and Viterbi decoders for high-rate punctured convolutional codes
- An Extensive Search for Good Punctured Rate->tex<$ kover k+1$>/tex<Recursive Convolutional Codes for Serially Concatenated Convolutional Codes
- Using combinatorial optimization to design good unit-memory convolutional codes
- Rational rate punctured convolutional codes for soft-decision Viterbi decoding
- MAP decoding of convolutional codes using reciprocal dual codes
This page was built for publication: Design and decoding of optimal high-rate convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546500)