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.
No takes yet. Share an insight, caveat, or question.
Bazzi et al. (2002) studied this question.