Pearson Codes

Jos Weber; Kees A. S. Immink; Simon Blackburn

doi:10.1109/TIT.2015.2490219

Pearson Codes

Jos Weber, Kees A. S. Immink, Simon Blackburn

Research output: Contribution to journal › Article › peer-review

80 Downloads (Pure)

Abstract

The Pearson distance has been advocated for improving the error performance of noisy channels with unknown gain and offset. The Pearson distance can only fruitfully be used for sets of q-ary codewords, called Pearson codes, that satisfy specific properties. We will analyze constructions and properties of optimal Pearson codes. We will compare the redundancy of optimal Pearson codes with the redundancy of prior art T-constrained codes, which consist of q-ary sequences in which T pre-determined reference symbols appear at least once. In particular, it will be shown that for q ≤ 3, the two-constrained codes are optimal Pearson codes, while for q ≥ 4 these codes are not optimal.

Original language	English
Pages (from-to)	131-135
Number of pages	5
Journal	IEEE Transactions on Information Theory
Volume	62
Issue number	1
Early online date	13 Oct 2015
DOIs	https://doi.org/10.1109/TIT.2015.2490219
Publication status	Published - Jan 2016

Access to Document

10.1109/TIT.2015.2490219

Accepted ManuscriptAccepted author manuscript, 235 KB

Cite this

@article{87e344aa1efe4bd79702b6b7034cec23,

title = "Pearson Codes",

abstract = "The Pearson distance has been advocated for improving the error performance of noisy channels with unknown gain and offset. The Pearson distance can only fruitfully be used for sets of q-ary codewords, called Pearson codes, that satisfy specific properties. We will analyze constructions and properties of optimal Pearson codes. We will compare the redundancy of optimal Pearson codes with the redundancy of prior art T-constrained codes, which consist of q-ary sequences in which T pre-determined reference symbols appear at least once. In particular, it will be shown that for q ≤ 3, the two-constrained codes are optimal Pearson codes, while for q ≥ 4 these codes are not optimal.",

author = "Jos Weber and Immink, {Kees A. S.} and Simon Blackburn",

year = "2016",

month = jan,

doi = "10.1109/TIT.2015.2490219",

language = "English",

volume = "62",

pages = "131--135",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

TY - JOUR

T1 - Pearson Codes

AU - Weber, Jos

AU - Immink, Kees A. S.

AU - Blackburn, Simon

PY - 2016/1

Y1 - 2016/1

N2 - The Pearson distance has been advocated for improving the error performance of noisy channels with unknown gain and offset. The Pearson distance can only fruitfully be used for sets of q-ary codewords, called Pearson codes, that satisfy specific properties. We will analyze constructions and properties of optimal Pearson codes. We will compare the redundancy of optimal Pearson codes with the redundancy of prior art T-constrained codes, which consist of q-ary sequences in which T pre-determined reference symbols appear at least once. In particular, it will be shown that for q ≤ 3, the two-constrained codes are optimal Pearson codes, while for q ≥ 4 these codes are not optimal.

AB - The Pearson distance has been advocated for improving the error performance of noisy channels with unknown gain and offset. The Pearson distance can only fruitfully be used for sets of q-ary codewords, called Pearson codes, that satisfy specific properties. We will analyze constructions and properties of optimal Pearson codes. We will compare the redundancy of optimal Pearson codes with the redundancy of prior art T-constrained codes, which consist of q-ary sequences in which T pre-determined reference symbols appear at least once. In particular, it will be shown that for q ≤ 3, the two-constrained codes are optimal Pearson codes, while for q ≥ 4 these codes are not optimal.

U2 - 10.1109/TIT.2015.2490219

DO - 10.1109/TIT.2015.2490219

M3 - Article

SN - 0018-9448

VL - 62

SP - 131

EP - 135

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 1

ER -