Binary Cyclic Pearson Codes

Ari Dwi Hartanto (Universitas Gadjah Mada, Yogyakarta, Indonesia)
Al. Sutjijana (Universitas Gadjah Mada, Yogyakarta, Indonesia)

Jurnal Matematika: MANTIK
Vol. 7 No. 1 (2021): Mathematics and Applied Mathematics

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.