Abstract
The recently proposed Pearson codes offer immunity
against channel gain and offset mismatch. These codes have very
low redundancy, but efficient coding procedures were lacking. In
this paper, systematic Pearson coding schemes are presented. The
redundancy of these schemes is analyzed for memoryless uniform
sources. It is concluded that simple coding can be established at
only a modest rate loss.