Pearson Codes

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

Research output: Contribution to journalArticlepeer-review

76 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 languageEnglish
Pages (from-to)131-135
Number of pages5
JournalIEEE Transactions on Information Theory
Volume62
Issue number1
Early online date13 Oct 2015
DOIs
Publication statusPublished - Jan 2016

Cite this