Open AccessBinary Cyclic Pearson Codes
Author(s) -
Ari Dwi Hartanto,
Al. Sutjijana
Publication year - 2021
Publication title -
mantik
Language(s) - English
Resource type - Journals
eISSN - 2527-3167
pISSN - 2527-3159
DOI - 10.15642/mantik.2021.7.1.1-8
Subject(s) - computer science , offset (computer science) , pearson product moment correlation coefficient , binary number , code (set theory) , set (abstract data type) , algorithm , mathematics , arithmetic , statistics , programming language
The phenomena of unknown gain or offset on communication systems and modern storages such as optical data storage and non-volatile memory (flash) becomes a serious problem. This problem can be handled by Pearson distance applied to the detector because it offers immunity to gain and offset mismatch. This distance can only be used for a specific set of codewords, called Pearson codes. An interesting example of Pearson code can be found in T-constrained code class. In this paper, we present binary 2-constrained codes with cyclic property. The construction of this code is adopted from cyclic codes, but it cannot be considered as cyclic codes.