Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Jose Ortiz-Ubarri"'
Autor:
Jose Ortiz-Ubarri
Publikováno v:
Cryptography and Communications. 12:785-794
We present new families of three-dimensional (3-D) optical orthogonal codes for applications to optical code-division multiple access (OCDMA) networks. The families are based in the extended rational cycle used for the 2-D Moreno-Maric construction.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d633b4ee6c5b34e78a9dd2bde2f1c34a
https://doi.org/10.1007/s12095-019-00422-1
https://doi.org/10.1007/s12095-019-00422-1
Autor:
Ivelisse Rubio, Francis N. Castro, Domingo Gómez-Pérez, Rafael A. Arce-Nazario, Andrew Z. Tirkel, Jose Ortiz-Ubarri, Oscar Moreno
Publikováno v:
Applicable Algebra in Engineering, Communication and Computing. 31:43-63
The linear complexity of a sequence is an important parameter for many applications, especially those related to information security, and hardware implementation. It is desirable to develop a corresponding measure and theory for multidimensional arr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6fdefa3f4ba2fafceafaf106527db09d
https://doi.org/10.1007/s00200-019-00393-z
https://doi.org/10.1007/s00200-019-00393-z
Publikováno v:
Advances in Mathematics of Communications. 11:329-338
We compute the covering radius of some families of binary cyclic codes. In particular, we compute the covering radius of cyclic codes with two zeros and minimum distance greater than 3. We also compute the covering radius of some binary primitive BCH
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0dea584b97b6aaf917a16143eac0f525
https://doi.org/10.3934/amc.2017025
https://doi.org/10.3934/amc.2017025
Autor:
Jose Ortiz-Ubarri
Publikováno v:
Cryptography and Communications. 7:403-414
We present q new asymptotically optimal families of doubly periodic arrays with ideal auto and cross correlation constraints, derived from the Moreno-Maric construction for frequency hopping applications. These new families possess the same propertie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7c36f265854bf827df05bece6272ae4
https://doi.org/10.1007/s12095-015-0122-0
https://doi.org/10.1007/s12095-015-0122-0
Publikováno v:
IPDPS Workshops
The ability to design effective solutions using parallel processing should be a required competency for every computing student. However, teaching parallel concepts is sometimes challenging and costly, specially at early stages of a computer science
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eda7a8d604fcc3a2c396eb76346b62ff
https://doi.org/10.1109/ipdpsw.2016.204
https://doi.org/10.1109/ipdpsw.2016.204
Publikováno v:
BigData Congress
We present Toa, a web-based Network Flow data monitoring system (NMS). Toa consists of a collection of scripts that automatically parse network flow data, store this information in a database system, and generate interactive time line charts for netw
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2950f158b1d1721bd77074030ee05047
https://doi.org/10.1109/bigdatacongress.2015.71
https://doi.org/10.1109/bigdatacongress.2015.71
In this work we present two generators for the group of symmetries of the generic $(m+1)$ dimensional periodic Costas arrays over elementary abelian $(\mathbb{Z}_p)^m$ groups: one that is defined by multiplication on $m$ dimensions and the other by s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99b854c47d99fa1a140150a967ef5a20
Publikováno v:
International Journal of Reconfigurable Computing, Vol 2012 (2012)
The enumeration of two-dimensional Costas arrays is a problem with factorial time complexity and has been solved for sizes up to 29 using computer clusters. Costas arrays of higher dimensionality have recently been proposed and their properties are b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::824a56b74ef33d32e032131c8bce5eb4
Publikováno v:
ReConFig
The enumeration of Costas arrays is a problem that grows factorially with input size and that has lately been completed for sizes up to 28 using computer clusters. This paper presents designs for solving this problem using, separately, GPUs and FPGAs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::374086473a804fa244c0bc59e7572801
https://doi.org/10.1109/reconfig.2011.36
https://doi.org/10.1109/reconfig.2011.36
Publikováno v:
ITW
New families of three-dimensional (3-D) optical orthogonal codes for applications to optical code-division multiple access (OCDMA) networks are proposed. The families are based in the three dimensional periodic Welch Costas array over elementary Abel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f629100f9e38ef2b1fffeea62445606
https://doi.org/10.1109/itw.2011.6089370
https://doi.org/10.1109/itw.2011.6089370