We consider a family of binary prefix condition codes in which each codeword
is required to have even Hamming weight.  Such codes have intrinsic error
resilience.  For a given source over a finite alphabet we offer a 
polynomial-time algorithm to construct a minimum-redundancy code among this
class of prefix condition codes.