Properties of Binary Pearson Codes

Jos Weber; KA Schouhamer Immink

doi:10.23919/ISITA.2018.8664287

Properties of Binary Pearson Codes

Jos Weber, KA Schouhamer Immink

Discrete Mathematics and Optimization

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

2 Citations (Scopus)

68 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 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	https://doi.org/10.23919/ISITA.2018.8664287
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

Access to Document

10.23919/ISITA.2018.8664287

ISITA2018 JW KI Properties of Pearson Codes finalAccepted author manuscript, 115 KB

Cite this

@inproceedings{54ea8602dc184fbfb75d1600bd634354,

title = "Properties of Binary Pearson Codes",

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.",

author = "Jos Weber and {Schouhamer Immink}, KA",

year = "2018",

month = oct,

doi = "10.23919/ISITA.2018.8664287",

language = "English",

pages = "637--641",

booktitle = "Proceedings of the 2018 International Symposium on Information Theory and its Applications",

publisher = "The Institute of Electronics, Information and Communication Engineers (IEICE)",

address = "Japan",

note = "2018 International Symposium on Information Theory and Its Applications , ISITA 2018 ; Conference date: 28-10-2018 Through 31-10-2018",

}

Weber, J & Schouhamer Immink, KA 2018, Properties of Binary Pearson Codes. in Proceedings of the 2018 International Symposium on Information Theory and its Applications . The Institute of Electronics, Information and Communication Engineers (IEICE), Singapore, pp. 637-641, 2018 International Symposium on Information Theory and Its Applications , Singapore, Singapore, 28/10/18. https://doi.org/10.23919/ISITA.2018.8664287

Properties of Binary Pearson Codes. / Weber, Jos; Schouhamer Immink, KA.
Proceedings of the 2018 International Symposium on Information Theory and its Applications . Singapore: The Institute of Electronics, Information and Communication Engineers (IEICE), 2018. p. 637-641.

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

TY - GEN

T1 - Properties of Binary Pearson Codes

AU - Weber, Jos

AU - Schouhamer Immink, KA

PY - 2018/10

Y1 - 2018/10

N2 - 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.

AB - 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.

U2 - 10.23919/ISITA.2018.8664287

DO - 10.23919/ISITA.2018.8664287

M3 - Conference contribution

SP - 637

EP - 641

BT - Proceedings of the 2018 International Symposium on Information Theory and its Applications

PB - The Institute of Electronics, Information and Communication Engineers (IEICE)

CY - Singapore

T2 - 2018 International Symposium on Information Theory and Its Applications

Y2 - 28 October 2018 through 31 October 2018

ER -

Properties of Binary Pearson Codes

Abstract

Conference

Access to Document

Fingerprint

Cite this