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.
โฆ LIBER โฆ
On Upper Bounds for the Decoding Error Probability of Convolutional Codes
โ Scribed by M. V. Burnashev
- Book ID
- 110325000
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 2001
- Tongue
- English
- Weight
- 218 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0032-9460
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
New Decoding Error Probability Bounds fo
โ
Dmitri V. Truhachev; Karin Engdahl; Kamil S. Zigangirov
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 483 KB
Bounds on the decoding error probability
โ
Poltyrev, G.
๐
Article
๐
1994
๐
IEEE
๐
English
โ 829 KB
On the decoder error probability for Ree
โ
McEliece, R.; Swanson, L.
๐
Article
๐
1986
๐
IEEE
๐
English
โ 536 KB
Iterative MAP decoding for serial concat
โ
Ambroze, A.; Wade, G.; Tomlinson, M.
๐
Article
๐
1998
๐
The Institution of Electrical Engineers
๐
English
โ 663 KB
Upper bounds on the size of error-correc
โ
Winick, Kim A. ;Yang, Shih-Hsuan
๐
Article
๐
1996
๐
John Wiley and Sons
๐
English
โ 757 KB
The maximum achievable rate of an error-correcting runlength-limited code is consid-ered. Runlength-limited codes find wide appIications in magnetic and optical recording, baseband. pulse transmission, and fiber optic communications. When a runlength-limited code is used on a noisy channel, error-co
Decoding of Reed Solomon Codes beyond th
โ
Madhu Sudan
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 256 KB