Properties of Binary Pearson Codes

Conference paper (2018)

Authors

J.H. Weber Discrete Mathematics and Optimization - EEMCS
KA Schouhamer Immink Turing Machines Inc.
Research Group
Discrete Mathematics and Optimization (EEMCS) (TU Delft)
Copyright: © 2018 J.H. Weber, KA Schouhamer Immink
DOI
help_outline
https://doi.org/10.23919/ISITA.2018.8664287
More Info
expand_more

Published Date

2018-10

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Delft Institute of Applied Mathematics

Research Group

Discrete Mathematics and Optimization

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.