Binary Cyclic Pearson Codes

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....

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Ari Dwi Hartanto, Al. Sutjijana
Formato:	article
Lenguaje:	EN
Publicado:	Department of Mathematics, UIN Sunan Ampel Surabaya 2021
Materias:	pearson distance pearson code cyclic code Mathematics QA1-939
Acceso en línea:	https://doaj.org/article/955915eae34446b4a21ceb21e1e65ae8
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:955915eae34446b4a21ceb21e1e65ae8
record_format	dspace
spelling	oai:doaj.org-article:955915eae34446b4a21ceb21e1e65ae82021-12-02T15:30:25ZBinary Cyclic Pearson Codes2527-31592527-316710.15642/mantik.2021.7.1.1-8https://doaj.org/article/955915eae34446b4a21ceb21e1e65ae82021-03-01T00:00:00Zhttp://jurnalsaintek.uinsby.ac.id/index.php/mantik/article/view/661https://doaj.org/toc/2527-3159https://doaj.org/toc/2527-3167The 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.Ari Dwi HartantoAl. SutjijanaDepartment of Mathematics, UIN Sunan Ampel Surabayaarticlepearson distancepearson codecyclic codeMathematicsQA1-939ENMantik: Jurnal Matematika, Vol 7, Iss 1, Pp 1-8 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	pearson distance pearson code cyclic code Mathematics QA1-939
spellingShingle	pearson distance pearson code cyclic code Mathematics QA1-939 Ari Dwi Hartanto Al. Sutjijana Binary Cyclic Pearson Codes
description	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.
format	article
author	Ari Dwi Hartanto Al. Sutjijana
author_facet	Ari Dwi Hartanto Al. Sutjijana
author_sort	Ari Dwi Hartanto
title	Binary Cyclic Pearson Codes
title_short	Binary Cyclic Pearson Codes
title_full	Binary Cyclic Pearson Codes
title_fullStr	Binary Cyclic Pearson Codes
title_full_unstemmed	Binary Cyclic Pearson Codes
title_sort	binary cyclic pearson codes
publisher	Department of Mathematics, UIN Sunan Ampel Surabaya
publishDate	2021
url	https://doaj.org/article/955915eae34446b4a21ceb21e1e65ae8
work_keys_str_mv	AT aridwihartanto binarycyclicpearsoncodes AT alsutjijana binarycyclicpearsoncodes
_version_	1718387155276922880

Binary Cyclic Pearson Codes

Ejemplares similares