DocumentCode
2387537
Title
Exact thresholds and optimal codes for the binary symmetric channel and Gallager´s decoding algorithm A
Author
Bazzi, L. ; Richardson, T. ; Urbanke, R.
Author_Institution
LIDS, MIT, MA, USA
fYear
2000
fDate
2000
Firstpage
203
Abstract
We show that for the case of a binary symmetric channel and Gallager´s decoding algorithm A the threshold can, in many cases, be determined analytically. We further present optimal codes for a large range of rates
Keywords
channel coding; codes; iterative decoding; Gallager´s decoding algorithm; binary symmetric channel; exact thresholds; low density parity check codes; optimal concentrated codes; Algorithm design and analysis; Code standards; Communications technology; Decoding; H infinity control; Parity check codes; Polynomials; Solids;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location
Sorrento
Print_ISBN
0-7803-5857-0
Type
conf
DOI
10.1109/ISIT.2000.866501
Filename
866501
Link To Document