Exact thresholds and optimal codes for the binary symmetric channel and Gallager's decoding algorithm A

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.