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) -
Weight Distribution of Periodic Errors and Optimal/Anti-Optimal Linear Codes
by: Pankaj Kumar Das
Published: (2014-01-01) -
Probability Error Bounds for Approximation of Functions in Reproducing Kernel Hilbert Spaces
by: Ata Deniz Aydın, et al.
Published: (2021-01-01) -
Combined coding of bit planes of images
by: B. J.S. Sadiq, et al.
Published: (2019-12-01) -
The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity Problem
by: Hongchun Sun, et al.
Published: (2012-01-01)