๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Tighter Bhattacharyya Bound for Decoding Error Probability

โœ Scribed by Griot, M.; Wen-Yen Weng; Wesel, R.D.


Book ID
117885130
Publisher
IEEE
Year
2007
Tongue
English
Weight
55 KB
Volume
11
Category
Article
ISSN
1089-7798

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Tighter error bounds and weighted error
โœ Chang, Chin-Chen ;Shih, Zen-Chung ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 66 KB ๐Ÿ‘ 1 views

In this paper we first derive a tighter error bound on form factors as a subdivision criterion for the hierarchical radiosity algorithm. Such an error bound can reduce more unnecessary links and improve the performance of the hierarchical radiosity algorithm to meet a user-specified error tolerance.

New Decoding Error Probability Bounds fo
โœ Dmitri V. Truhachev; Karin Engdahl; Kamil S. Zigangirov ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 483 KB

New upper bounds for the bit and burst error probabilities are derived for the case, when a xed convolutional code is used for communication over the binary symmetric channel (BSC) and the decoder performs maximum likelihood decoding. These bounds are tighter than existing bounds.