Communicating Over a Channel Constrained to a Fixed Code

We examine the problem of decoding a linear block code used over a binary symmetric channel when the goal is to minimize the average information bit error probability. For fixed crossover probability p, the optimal decoder can be implemented by standard array. We present optimal strategies for choosing coset leaders in the very quiet (p /spl rarr/ 0) and very noisy (p /spl rarr 1/2) limits.