Properties of Binary Pearson Codes

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.

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

[2]  Nikolaos Papandreou,et al.  Using adaptive read voltage thresholds to enhance the reliability of MLC NAND flash memory systems , 2014, GLSVLSI '14.

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

[4]  Kees A. Schouhamer Immink.  A survey of codes for optical disk recording , 2001, IEEE J. Sel. Areas Commun..

[5]  Franklin A. Graybill,et al.  Introduction to The theory , 1974 .

[6]  Jos H. Weber,et al.  Pearson Codes , 2015, IEEE Transactions on Information Theory.

[7]  Chaitali Chakrabarti,et al.  Enhancing the Reliability of STT-RAM through Circuit and System Level Techniques , 2012, 2012 IEEE Workshop on Signal Processing Systems.