Mean-square-error optimum coset leaders for group codes

Crimmins et al. [1] showed how to minimize mean-square error over all 1 - 1 mappings of digital data into binary group code elements when the a priori probability of the data is uniform. This paper shows how to optimize simultaneously over all possible choices of coset leaders for the detection scheme.