Upper Bound on the Bit Error Probability of Systematic Binary Linear Codes via Their Weight Spectra
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 tec...
Saved in:
Main Authors: | Jia Liu, Mingyu Zhang, Chaoyong Wang, Rongjun Chen, Xiaofeng An, Yufei Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2020-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2020/1469090 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An Upper Bound for Locating Strings with High Probability Within Consecutive Bits of Pi
by: Víctor Manuel Silva-García, et al.
Published: (2025-01-01) -
Novel method to calculate average bit error probability of UWB non-coherent system
by: YANG Zhi-hua1, et al.
Published: (2010-01-01) -
Bit error rate analysis model of M-APSK based on total probability formula
by: HUAN Hao, et al.
Published: (2024-07-01) -
Weighted symbol-flipping decoding for non-binary LDPC codes based on average probability and stopping criterion
by: Rui GUO, et al.
Published: (2016-02-01) -
k-error linear complexity of binary cyclotomic generators
by: Zhixiong CHEN, et al.
Published: (2019-02-01)