Techniques of bounding the probability of decoding error for block coded modulation structures
From MaRDI portal
Publication:4838644
Recommendations
- Computing upper bounds to error probability of coded modulation schemes
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
- Bounds on the decoding error probability of binary linear codes via their spectra
- scientific article; zbMATH DE number 4033671
Cited in
(10)- Block coded modulation and concatenated coding schemes for error control on fading channels
- The parameterized Gallager's first bounds based on conditional triplet-wise error probability
- Tight error bounds for nonuniform signaling over AWGN channels
- Lower Bounds on the Error Probability of Block Codes Based on Improvements on de Caen's Inequality
- scientific article; zbMATH DE number 68004 (Why is no real title available?)
- Computing upper bounds to error probability of coded modulation schemes
- Block-definition approaches to source coding with a fidelity criterion
- Calculation of power spectra for block coded signals
- Upper bound on the bit error probability of systematic binary linear codes via their weight spectra
- An upper bound on error probability in communication systems with single-user reception based on order statistics
This page was built for publication: Techniques of bounding the probability of decoding error for block coded modulation structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4838644)