Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Ivan Molina Naizir"'
Publikováno v:
IEEE Access, Vol 8, Pp 51333-51339 (2020)
In general, the construction of subspace codes or, in particular, cyclic Grassmannian codes in some projective space Pq(n) is highly mathematical and requires substantial computational power for the resulting searches. In this paper, we present a new
Externí odkaz:
https://doaj.org/article/05a952f8514d49888b19282dd05ceb15
Publikováno v:
IEEE Latin America Transactions. 17:1180-1190
In this paper we construct, using GAP System for Computational Discrete Algebra and Wolfram Mathematica, some cyclic subspace codes, specially an optimal code over the finite field F210 . Further we introduce the q-analogous of theclassic quasi cycli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5868752e57b934f4febb4d77056a2f4b
https://doi.org/10.1109/tla.2019.8931207
https://doi.org/10.1109/tla.2019.8931207
Publikováno v:
Cryptography and Communications. 11:1021-1035
Nowadays it is vital to have a robust mechanism that can identify people, objects, animals, and living beings, for example, for agricultural, health and national security purposes. Some drawbacks occur when very many objects need to be identified, an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb33911603be6fb96a0f15af52710077
https://doi.org/10.1007/s12095-018-0346-x
https://doi.org/10.1007/s12095-018-0346-x