{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:36Z","timestamp":1740122496427,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"University of Puerto Rico, FIPI Funds"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10623-023-01274-w","type":"journal-article","created":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T13:02:23Z","timestamp":1690894943000},"page":"709-722","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Analysis and computation of multidimensional linear complexity of periodic arrays"],"prefix":"10.1007","volume":"92","author":[{"given":"Rafael","family":"Arce","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Hern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Ortiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5183-0256","authenticated-orcid":false,"given":"Ivelisse","family":"Rubio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaziel","family":"Torres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,1]]},"reference":[{"issue":"5","key":"1274_CR1","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00200-018-00379-3","volume":"30","author":"TL Alderson","year":"2019","unstructured":"Alderson T.L.: n-dimensional optical orthogonal codes, bounds and optimal constructions. Appl. Algebra Eng. Commun. Comput. 30(5), 373\u2013386 (2019).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"1","key":"1274_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00200-019-00393-z","volume":"31","author":"R Arce-Nazario","year":"2020","unstructured":"Arce-Nazario R., Castro F., Gomez-Perez D., Moreno O., Ortiz-Ubarri J., Rubio I., Tirkel A.: Multidimensional linear complexity analysis of periodic arrays. Appl. Algebra Eng. Commun. Comput. 31(1), 43\u201363 (2020).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"7\u20138","key":"1274_CR3","first-page":"190","volume":"47","author":"L B\u00f6mer","year":"1993","unstructured":"B\u00f6mer L., Antweiler M., Schotten H.: Quadratic residue arrays. Frequenz 47(7\u20138), 190\u2013196 (1993).","journal-title":"Frequenz"},{"issue":"3","key":"1274_CR4","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1109\/18.669398","volume":"44","author":"C Ding","year":"1998","unstructured":"Ding C., Helleseth T., Shan W.: On the linear complexity of Legendre sequences. IEEE Trans. Inform. Theory 44(3), 1276\u20131278 (1998).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1274_CR5","doi-asserted-by":"crossref","unstructured":"Gomez-Perez D., Hoholdt T., Moreno O., Rubio I.: Linear complexity for multidimensional arrays\u2014a numerical invariant. In 2015 IEEE International Symposium on Information Theory (ISIT), pp. 2697\u20132701, June 2015.","DOI":"10.1109\/ISIT.2015.7282946"},{"issue":"2","key":"1274_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.3934\/amc.2017024","volume":"11","author":"D Gomez-Perez","year":"2017","unstructured":"Gomez-Perez D., Gomez A.-I., Tirkel A.: Arrays composed from the extended rational cycle. Adv. Math. Commun. 11(2), 313 (2017).","journal-title":"Adv. Math. Commun."},{"key":"1274_CR7","first-page":"1","volume":"1","author":"D G\u00f3mez-P\u00e9rez","year":"2019","unstructured":"G\u00f3mez-P\u00e9rez D., G\u00f3mez Ana I., Tirkel A.: Large families of sequences for CDMA, frequency hopping, and UWB. Cryptogr. Commun. 1, 1\u201315 (2019).","journal-title":"Cryptogr. Commun."},{"key":"1274_CR8","unstructured":"Leukhin A., Moreno O., Tirkel A.: Secure CDMA and frequency hop sequences. In Proceedings of the Tenth International Symposium on Wireless Communication Systems (ISWCS 2013), pp. 1\u20135. VDE (2013)."},{"issue":"12","key":"1274_CR9","doi-asserted-by":"publisher","first-page":"1715","DOI":"10.1109\/PROC.1976.10411","volume":"64","author":"FJ MacWilliams","year":"1976","unstructured":"MacWilliams F.J., Sloane N.J.A.: Pseudo-random sequences and arrays. Proc. IEEE 64(12), 1715\u20131729 (1976).","journal-title":"Proc. IEEE"},{"key":"1274_CR10","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"JL Massey","year":"1969","unstructured":"Massey J.L.: Shift-register synthesis and $${\\rm BCH}$$ decoding. IEEE Trans. Inf. Theory 15, 122\u2013127 (1969).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1274_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0885-064X(02)00009-2","volume":"19","author":"W Meidl","year":"2003","unstructured":"Meidl W., Niederreiter H.: The expected value of the joint linear complexity of periodic multisequences. J. Complex. 19(1), 61\u201372 (2003).","journal-title":"J. Complex."},{"issue":"8","key":"1274_CR12","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1109\/26.864158","volume":"48","author":"O Moreno","year":"2000","unstructured":"Moreno O., Maric S.V.: A new family of frequency-hop codes. IEEE Trans. Commun. 48(8), 1241\u20131244 (2000).","journal-title":"IEEE Trans. Commun."},{"key":"1274_CR13","doi-asserted-by":"crossref","unstructured":"Moreno O., Tirkel A.: Multi-dimensional arrays for watermarking. In 2011 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2691\u20132695 (2011).","DOI":"10.1109\/ISIT.2011.6034060"},{"key":"1274_CR15","doi-asserted-by":"crossref","unstructured":"Moreno O., Tirkel A.: New optimal low correlation sequences for wireless communications. In Sequences and Their Applications\u2014SETA 2012. Lecture Notes in Computer Science, vol. 7280, pp. 212\u2013223 (2012).","DOI":"10.1007\/978-3-642-30615-0_20"},{"key":"1274_CR14","unstructured":"Moreno O., H\u00f8holdt T., Rubio I.: Security of multidimensional arrays. US Provisional Patent Applications, 62\/131616 (March, 2015) and 62\/174973 (June, 2015)."},{"key":"1274_CR16","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1007\/s12095-019-00422-1","volume":"12","author":"J Ortiz-Ubarri","year":"2020","unstructured":"Ortiz-Ubarri J.: New asymptotically optimal three-dimensional wave-length\/space\/time optical orthogonal codes for OCDMA systems. Cryptogr. Commun. 12, 785\u2013794 (2020).","journal-title":"Cryptogr. Commun."},{"key":"1274_CR17","doi-asserted-by":"crossref","unstructured":"Rubio I.M., Sweedler M., Heegard C.: Finding a Gr\u00f6bner basis for the ideal of recurrence relations on m-dimensional periodic arrays. In Contemporary Developments in Finite Fields and Applications, pp. 296\u2013320. World Scientific, Singapore (2016).","DOI":"10.1142\/9789814719261_0018"},{"issue":"2","key":"1274_CR18","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0890-5401(90)90039-K","volume":"84","author":"S Sakata","year":"1990","unstructured":"Sakata S.: Extension of the Berlekamp-Massey algorithm to $$N$$ dimensions. Inf. Comput. 84(2), 207\u2013239 (1990).","journal-title":"Inf. Comput."},{"key":"1274_CR19","doi-asserted-by":"crossref","unstructured":"Tirkel A., Hall T.: New matrices with good auto and cross-correlation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89(9), 2315\u20132321 (2006).","DOI":"10.1093\/ietfec\/e89-a.9.2315"},{"key":"1274_CR20","first-page":"57","volume-title":"Steganography-applications of coding theory","author":"AZ Tirkel","year":"1997","unstructured":"Tirkel A.Z., Osborne C.F., Hall T.H.: Steganography-applications of coding theory, pp. 57\u201359. In IEEE Information Theory Workshop, Svalbard, Norway (1997)."},{"key":"1274_CR21","unstructured":"Torres J.: RST\\_Complexity (2019). https:\/\/github.com\/jazieltorres\/RST_Complexity.git."},{"issue":"2","key":"1274_CR22","doi-asserted-by":"publisher","first-page":"1841","DOI":"10.1109\/TVT.2019.2961417","volume":"69","author":"J Yao","year":"2019","unstructured":"Yao J., Jiang R., Heng W.: Algebraic construction of optimal frequency hopping patterns based on Welch Costas arrays. IEEE Trans. Veh. Technol. 69(2), 1841\u20131854 (2019).","journal-title":"IEEE Trans. Veh. Technol."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01274-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01274-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01274-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T15:12:32Z","timestamp":1711725152000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01274-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,1]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1274"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01274-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2023,8,1]]},"assertion":[{"value":"22 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}