"uuid","repository link","title","author","contributor","publication year","abstract","subject topic","language","publication type","publisher","isbn","issn","patent","patent status","bibliographic note","access restriction","embargo date","faculty","department","research group","programme","project","coordinates" "uuid:08eabe44-2091-4579-aacb-8c237b8a474f","http://resolver.tudelft.nl/uuid:08eabe44-2091-4579-aacb-8c237b8a474f","Simple Systematic Pearson Coding","Weber, J.H. (TU Delft Cyber Security); Swart, T.G. (University of Johannesburg); Schouhamer Immink, KA (Turing Machines Inc.)","","2016","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.