Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
M. Twitto, I. Sason, S. Shamai
Abstract
The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid for any memoryless, binary-input and output-symmetric communication channel, and their effectiveness is exemplified for various ensembles of turbo-like codes over the AWGN channel. An expurgation of the distance spectrum of binary linear block codes further tightens the resulting upper bounds.
Create a lesson
Related papers
An Explicit Family of Log-Concave Counterexamples to the Gaussian Completely Monotone Conjecture
Jiayang Zou, Luyao Fan, Jiayang Gao et al.
Strengthening Recursive Constructions for Zero-Error Shannon Capacity
Ravi Tandon
Fluid Antenna Multiple Access for Noise Modulation
Hadi Zayyani, Felipe A. P. de Figueiredo
The generalized covering radii of Melas codes
Shuxing Li, Maosheng Xiong
Efficient Polynomial-Time Decoding of Simplicial Anticodes with Near-Optimal Performance
Antonio Jesús Lorite-López, Daniel Camazón-Portela, Juan Antonio López-Ramos
Multi-Access Speculative Inference: Uplink or Downlink?
Chang Cai, Kaibin Huang