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....
Guardado en:
Autores principales: | Ari Dwi Hartanto, Al. Sutjijana |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Department of Mathematics, UIN Sunan Ampel Surabaya
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/955915eae34446b4a21ceb21e1e65ae8 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
A polynomial-time reduction from the multi-graph isomorphism problem to additive code equivalence
por: Simeon Ball, et al.
Publicado: (2021) -
Oxygen deficiency and benthic communities in the peruvian upper continental margin
por: Gutiérrez,Dimitri, et al.
Publicado: (2006) -
Reproducible families of codes and cryptographic applications
por: Santini Paolo, et al.
Publicado: (2021) -
On the State Approach Representations of Convolutional Codes over Rings of Modular Integers
por: Ángel Luis Muñoz Castañeda, et al.
Publicado: (2021) -
An empirical relationship between sea surface temperature and massive stranding of the loggerhead turtle (Caretta caretta) in the Gulf of Ulloa, Mexico
por: Salinas-Zavala,César A., et al.
Publicado: (2020)