Pearson Codes

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.

[1]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[2]  J. Wolfowitz,et al.  An Introduction to the Theory of Statistics , 1951, Nature.

[3]  Kees A. Schouhamer Immink.  Coding schemes for multi-level channels with unknown gain and/or offset , 2013, 2013 IEEE International Symposium on Information Theory.

[4]  Anxiao Jiang,et al.  Error-correcting schemes with dynamic thresholds in nonvolatile memories , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[5]  Anxiao Jiang,et al.  Rank modulation for flash memories , 2008, 2008 IEEE International Symposium on Information Theory.

[6]  K.A.S. Immink.  Coding schemes for multi-level Flash memories that are intrinsically resistant against unknown gain and/or offset using reference symbols , 2014 .

[7]  Jos H. Weber,et al.  Minimum Pearson Distance Detection for Multilevel Channels With Gain and/or Offset Mismatch , 2014, IEEE Transactions on Information Theory.

[8]  Frederic Sala,et al.  Error Control Schemes for Modern Flash Memories: Solutions for Flash deficiencies , 2015, IEEE Consumer Electronics Magazine.

[9]  Frederic Sala,et al.  Dynamic Threshold Schemes for Multi-Level Non-Volatile Memories , 2012, IEEE Transactions on Communications.

[10]  H. J. Larson,et al.  Introduction to the Theory of Statistics , 1973 .

[11]  Jos H. Weber,et al.  Very Efficient Balanced Codes , 2010, IEEE Journal on Selected Areas in Communications.

[12]  Franklin A. Graybill,et al.  Introduction to the Theory of Statistics, 3rd ed. , 1974 .