On maximum likelihood soft-decision decoding of binary linear codes

1993 ◽  
Vol 39 (1) ◽  
pp. 197-203 ◽  
Author(s):  
N.J.C. Lous ◽  
P.A.H. Bours ◽  
H.C.A. van Tilborg
Keyword(s):  
Maximum Likelihood ◽  
Linear Codes ◽  
Soft Decision ◽  
Binary Linear Codes ◽  
Soft Decision Decoding

2ℓ-Incorrigible set distributions of some linear codes by the finite geometry

2017 ◽  
Vol 09 (01) ◽  
pp. 1750012
Author(s):  
Lin-Zhi Shen ◽  
Fang-Wei Fu
Keyword(s):  
Maximum Likelihood ◽  
Linear Code ◽  
Error Probability ◽  
Linear Codes ◽  
Finite Geometry ◽  
Short Paper ◽  
List Decoding ◽  
Maximum Likelihood Decoding ◽  
Binary Linear Codes ◽  
Erasure Channels

The [Formula: see text]-incorrigible set distributions of binary linear codes over the erasure channels can be used to determine the decoding error probability of a linear code under maximum likelihood decoding and [Formula: see text]-list decoding. In this short paper, we give the [Formula: see text]-incorrigible set distributions of some linear codes by the finite geometry theory.

A New Upper Bound on the Error Probability of Binary Linear Codes

2011 ◽  
Vol 403-408 ◽  
pp. 2852-2855
Author(s):  
Jun Guo ◽  
Li Yun Dai ◽  
Hong Wen Yang
Keyword(s):  
Performance Evaluation ◽  
Maximum Likelihood ◽  
Upper Bound ◽  
Error Probability ◽  
Linear Codes ◽  
Binary Linear Codes ◽  
Union Bound ◽  
Simulation Results ◽  
Error Probabilities

Performance evaluation of maximum-likelihood (ML) decoded binary linear codes is usually carried out using bounding techniques. In this paper, a new upper bound is presented to improve existing union bounds. The proposed upper bounding is based on probabilities of correct events, while the traditional union bound (UB) is on pair-wise error probabilities. Moreover, the improved upper bounding uses the intersection instead of the union of basic events. The theoretical and simulation results show that the proposed bound is tight than UB.

Sign in / Sign up

Export Citation Format

Share Document