New performance bounds for turbo codes
From MaRDI portal
Recommendations
- A New Upper Bound on the Minimum Distance of Turbo Codes
- Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum
- On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes
- Combinatorial analysis of the minimum distance of turbo codes
- Upper bound on the minimum distance of turbo codes
Cited in
(12)- A new method for performance evaluation of bit decoding algorithms using statistics of the log likelihood ratio
- A New Upper Bound on the Minimum Distance of Turbo Codes
- New Gallager Bounds in Block-Fading Channels
- Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum
- Performance bounds for high rate linear codes over partial-response channels
- On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes
- Combinatorial analysis of the minimum distance of turbo codes
- Upper bound on the minimum distance of turbo codes
- Variance of the turbo code performance bound over the interleavers
- Cryptography and Coding
- Variations on the Gallager bounds with some applications
- An upper bound on error probability in communication systems with single-user reception based on order statistics
This page was built for publication: New performance bounds for turbo codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2714778)