Simple systematic Pearson coding

Jos H. Weber, Theo G. Swart, Kees A. Schouhamer Immink
2016 2016 IEEE International Symposium on Information Theory (ISIT)  
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.
doi:10.1109/isit.2016.7541326 dblp:conf/isit/WeberSI16 fatcat:73665rcfp5amrewvyeq3fiurd4