@article{Hartanto_Sutjijana_2021, title={Binary Cyclic Pearson Codes}, volume={7}, url={https://jurnalsaintek.uinsby.ac.id/index.php/mantik/article/view/661}, DOI={10.15642/mantik.2021.7.1.1-8}, abstractNote={<p>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 <em>T</em>-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.</p>}, number={1}, journal={Jurnal Matematika MANTIK}, author={Hartanto, Ari Dwi and Sutjijana, Al.}, year={2021}, month={Mar.}, pages={1–8} }