Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial

DOI10.1561/0100000009MaRDI QIDQ5898666zbMATH OpenOpenAlexFDO

Authors Igal Sason, S. Shamai

Publication date 23 February 2007

Published in Foundations and Trends™ in Communications and Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1561/0100000009

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Decoding (94B35)

Recommendations

• Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
• Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
• Bounds on the bit error probability of a linear cyclic code over GF(2/sup l/) and its extended code
• scientific article; zbMATH DE number 493106
• Variations on the Gallager bounds, connections, and applications

Cited in

(2)

• Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
• Bounds on the bit error probability of a linear cyclic code over GF(2/sup l/) and its extended code

This page was built for publication: Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial

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