Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes

DOI10.1109/TIT.2007.892807MaRDI QIDQ3548894zbMATH OpenOpenAlexFDO

Authors Moshe Twitto, Igal Sason, S. Shamai

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2007.892807

Mathematics Subject Classification ID

Decoding (94B35) Error probability in coding theory (94B70)

Recommendations

• Bounds on the decoding error probability of binary linear codes via their spectra
• A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes (Corresp.)
• Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial
• On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes
• Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes

Cited in

(7)

• Techniques of bounding the probability of decoding error for block coded modulation structures
• Upper bound on the bit error probability of systematic binary linear codes via their weight spectra
• Bounds on the bit error probability of a linear cyclic code over GF(2/sup l/) and its extended code
• Bounds on the decoding error probability of binary linear codes via their spectra
• Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial
• Variations on the Gallager bounds, connections, and applications
• On the Error Exponents of Improved Tangential Sphere Bounds

This page was built for publication: Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548894)