Abstract
We consider the transmission and storage of data that use coded symbols over a channel, where a Pearson-distance-based 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 Euclidean-distance-based detection.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2018 International Symposium on Information Theory and its Applications |
Place of Publication | Singapore |
Publisher | The Institute of Electronics, Information and Communication Engineers (IEICE) |
Pages | 637-641 |
Number of pages | 5 |
ISBN (Electronic) | 978-4-88552-317-5 |
DOIs | |
Publication status | Published - Oct 2018 |
Event | 2018 International Symposium on Information Theory and Its Applications - Singapore, Singapore Duration: 28 Oct 2018 → 31 Oct 2018 |
Conference
Conference | 2018 International Symposium on Information Theory and Its Applications |
---|---|
Abbreviated title | ISITA 2018 |
Country/Territory | Singapore |
City | Singapore |
Period | 28/10/18 → 31/10/18 |