Print Email Facebook Twitter Simple Systematic Pearson Coding Title Simple Systematic Pearson Coding Author Weber, J.H. (TU Delft Cyber Security) Swart, T.G. (University of Johannesburg) Schouhamer Immink, KA (Turing Machines Inc.) Date 2016 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. Subject RedundancyEncodingDetectorsSystematicsArtEuclidean distance To reference this document use: http://resolver.tudelft.nl/uuid:08eabe44-2091-4579-aacb-8c237b8a474f DOI https://doi.org/10.1109/ISIT.2016.7541326 Publisher IEEE ISBN 978-1-5090-1806-2 Source Proceedings ISIT 2016: 2016 IEEE International Symposium on Information Theory Event 2016 IEEE International Symposium on Information Theory, ISIT 2016, 2016-07-10 → 2016-07-15, Barcelona, Spain Bibliographical note Accepted Author Manuscript Part of collection Institutional Repository Document type conference paper Rights © 2016 J.H. Weber, T.G. Swart, KA Schouhamer Immink Files PDF 8958213_ISIT2016_Systemat ... earson.pdf 192.42 KB Close viewer /islandora/object/uuid:08eabe44-2091-4579-aacb-8c237b8a474f/datastream/OBJ/view