Summary
The 2018 International Symposium on Information Theory and Its Applications　(ISITA2018)
2018
Session Number:We-PM-1-1
Session:
Number:We-PM-1-1.5
Properties of Binary Pearson Codes
Jos H. Weber, Kees A. Schouhamer Immink,
pp.637-641
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.We-PM-1-1.5
PDF download
Summary:
We consider the transmission and storage of data that use coded symbols over a channel, where a Pearson-distancebased detector is used for achieving resilience against unknown channel gain and offset, and corruption with additive noise. We discuss properties of binary Pearson codes, such as the Pearson noise distance that plays a key role in the error performance of Pearson-distance-based detection. We also compare the Pearson noise distance to the well-known Hamming distance, since the latter plays a similar role in the error performance of Euclideandistance- based detection.