Asymptotic optimality of the GMD and Chase decoding algorithms
From MaRDI portal
Recommendations
- Geometrical and performance analysis of GMD and Chase decoding algorithms
- Generalization of chase algorithms for soft decision decoding of binary linear codes
- Chase-type and GMD coset decoding
- Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- On the Asymptotic Performance of Bit-Wise Decoders for Coded Modulation
- A Note on Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding
- Asymptotic Optimality of Group and Systematic Codes for Some Channels
- Generalized asymptotically optimal codebooks
- Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding
Cited in
(11)- Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
- Chase-type and GMD coset decoding
- A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient
- An improvement to generalized-minimum-distance decoding
- Generalization of chase algorithms for soft decision decoding of binary linear codes
- Limited-trial chase decoding
- scientific article; zbMATH DE number 4104869 (Why is no real title available?)
- scientific article; zbMATH DE number 4112538 (Why is no real title available?)
- Error performance analysis for reliability-based decoding algorithms
- Geometrical and performance analysis of GMD and Chase decoding algorithms
- Class of algorithms for decoding block codes with channel measurement information
This page was built for publication: Asymptotic optimality of the GMD and Chase decoding algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4677560)
