Spectra of linear codes and error probability of decoding

Author(s):  
Gregory L. Katsman ◽  
Michael A. Tsfasman ◽  
Serge G. Vladut
2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Jia Liu ◽  
Mingyu Zhang ◽  
Chaoyong Wang ◽  
Rongjun Chen ◽  
Xiaofeng An ◽  
...  

In this paper, upper bound on the probability of maximum a posteriori (MAP) decoding error for systematic binary linear codes over additive white Gaussian noise (AWGN) channels is proposed. The proposed bound on the bit error probability is derived with the framework of Gallager’s first bounding technique (GFBT), where the Gallager region is defined to be an irregular high-dimensional geometry by using a list decoding algorithm. The proposed bound on the bit error probability requires only the knowledge of weight spectra, which is helpful when the input-output weight enumerating function (IOWEF) is not available. Numerical results show that the proposed bound on the bit error probability matches well with the maximum-likelihood (ML) decoding simulation approach especially in the high signal-to-noise ratio (SNR) region, which is better than the recently proposed Ma bound.


2017 ◽  
Vol 09 (01) ◽  
pp. 1750012
Author(s):  
Lin-Zhi Shen ◽  
Fang-Wei Fu

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.


2011 ◽  
Vol 403-408 ◽  
pp. 2852-2855
Author(s):  
Jun Guo ◽  
Li Yun Dai ◽  
Hong Wen Yang

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.


Author(s):  
Mohammad Azizur RAHMAN ◽  
Chin-Sean SUM ◽  
Ryuhei FUNADA ◽  
Shigenobu SASAKI ◽  
Tuncer BAYKAS ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document