Properties of Binary Pearson Codes

Jos Weber, KA Schouhamer Immink

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

2 Citations (Scopus)
21 Downloads (Pure)

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 languageEnglish
Title of host publicationProceedings of the 2018 International Symposium on Information Theory and its Applications
Place of PublicationSingapore
PublisherThe Institute of Electronics, Information and Communication Engineers (IEICE)
Pages637-641
Number of pages5
ISBN (Electronic)978-4-88552-317-5
DOIs
Publication statusPublished - Oct 2018
Event2018 International Symposium on Information Theory and Its Applications - Singapore, Singapore
Duration: 28 Oct 201831 Oct 2018

Conference

Conference2018 International Symposium on Information Theory and Its Applications
Abbreviated titleISITA 2018
CountrySingapore
CitySingapore
Period28/10/1831/10/18

Fingerprint

Dive into the research topics of 'Properties of Binary Pearson Codes'. Together they form a unique fingerprint.

Cite this