.png){kind=icon}
Return
A tighter Bhattacharyya bound for decoding error probability
.png){kind=icon}
OA
AI
DOI：10.1109/LCOM.2007.348296.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Bhattacharyya bound has been widely used to upper bound the pair-wise probability of error when transmitting over a noisy channel. However, the bound as it appears in most textbooks on channel coding can be improved by a factor of 1/2 when applied to the frame error probability. For the particular case of symmetric channels, the pairwise error probability can also be improved by a factor of 1/2. This letter provides a simple proof of these tighter bounds that has the same simplicity as the proof of the standard Bhattacharyya bound currently found in textbooks.
Keywords:
channel coding
Bhattacharyya bound
error probability
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave