{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:39:50Z","timestamp":1740148790399,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s12190-022-01771-6","type":"journal-article","created":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T16:03:24Z","timestamp":1661184204000},"page":"1037-1056","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["$${\\mathbb {F}}_{2}[u]{\\mathbb {F}}_{2}[u] $$-additive cyclic codes are asymptotically good"],"prefix":"10.1007","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6487-8803","authenticated-orcid":false,"given":"Hai Q.","family":"Dinh","sequence":"first","affiliation":[]},{"given":"Bhanu Pratap","family":"Yadav","sequence":"additional","affiliation":[]},{"given":"Sachin","family":"Pathak","sequence":"additional","affiliation":[]},{"given":"Abhyendra","family":"Prasad","sequence":"additional","affiliation":[]},{"given":"Ashish Kumar","family":"Upadhyay","sequence":"additional","affiliation":[]},{"given":"Woraphon","family":"Yamaka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,22]]},"reference":[{"key":"1771_CR1","doi-asserted-by":"publisher","first-page":"1508","DOI":"10.1109\/TIT.2014.2299791","volume":"60","author":"T Abualrub","year":"2014","unstructured":"Abualrub, T., Siap, I., Aydin, Nuh: $${\\mathbb{Z}}_{2}{\\mathbb{Z}}_{4}$$-additive cyclic codes. IEEE Trans. Inf. Theory 60, 1508\u20131514 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1771_CR2","unstructured":"Assmus, E.F., Mattson, H.F., Turyn, R.: Cyclic Codes. AF Cambridge Research Labs, Bedford, AFCRL, 66-348 (1966)"},{"key":"1771_CR3","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s12190-018-01216-z","volume":"60","author":"I Aydogdu","year":"2019","unstructured":"Aydogdu, I., Gursoy, F.: $${\\mathbb{Z} }_{2} {\\mathbb{Z} }_{4} {\\mathbb{Z} }_{8} $$-cyclic codes. J. Appl. Math. Comput. 60, 327\u2013341 (2019)","journal-title":"J. Appl. Math. Comput."},{"key":"1771_CR4","doi-asserted-by":"publisher","first-page":"3210","DOI":"10.1109\/TIT.2006.876244","volume":"52","author":"LMJ Bazzi","year":"2006","unstructured":"Bazzi, L.M.J., Mitter, S.K.: Some randomized code constructions from group actions. IEEE Trans. Inf. Theory 52, 3210\u20133219 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1771_CR5","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s00200-009-0110-8","volume":"20","author":"M Bhaintwal","year":"2009","unstructured":"Bhaintwal, M., Wasan, S.K.: On quasi-cyclic codes over $${\\mathbb{Z} }_{q}$$. Appl. Algebra Eng. Commun. Comput. 20, 459\u2013480 (2009)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"1771_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10623-009-9316-9","volume":"54","author":"J Borges","year":"2010","unstructured":"Borges, J., Fernandez-Cordoba, C., Pujol, J., Rifa, J., Villanueva, M.: $${\\mathbb{Z} }_{2} {\\mathbb{Z} }_{4}$$-linear codes: generator matrices and duality. Des. Codes Cryptogr. 54, 167\u2013179 (2010)","journal-title":"Des. Codes Cryptogr."},{"key":"1771_CR7","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00200-011-0145-5","volume":"22","author":"Y Cao","year":"2011","unstructured":"Cao, Y.: Generalized quasi-cyclic codes over Galois rings; structural properties and enumeration. Appl. Algebra Eng. Commun. Comput. 22, 219\u2013233 (2011)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"1771_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"TM Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (1991)"},{"key":"1771_CR9","doi-asserted-by":"publisher","first-page":"555","DOI":"10.3934\/amc.2020029","volume":"14","author":"L Diao","year":"2020","unstructured":"Diao, L., Gao, J., Lu, J.: Some results on $${\\mathbb{Z} }_{p} {\\mathbb{Z} }_{p}[u]$$-additive cyclic codes. Adv. Math. Commun. 14, 555\u2013572 (2020)","journal-title":"Adv. Math. Commun."},{"key":"1771_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-022-00557-4","author":"HQ Dinh","year":"2022","unstructured":"Dinh, H.Q., Yadav, B.P., Pathak, S., Prasad, A., Upadhyay, A.K., Yamaka, W.: $${\\mathbb{Z} }_{4}{\\mathbb{Z} }_{4}{\\mathbb{Z} }_{4} $$-additive cyclic codes are asymptotically good, Applicable Algebra in Engineering. Commun. Comput. (2022). https:\/\/doi.org\/10.1007\/s00200-022-00557-4","journal-title":"Commun. Comput."},{"key":"1771_CR11","unstructured":"Fan, Y., Liu, H.: Quasi-cyclic codes of index $$1\\frac{1}{2}$$. https:\/\/arxiv.org\/pdf\/1505.02252.pdf (2015)"},{"key":"1771_CR12","doi-asserted-by":"publisher","first-page":"6342","DOI":"10.1109\/TIT.2016.2602842","volume":"60","author":"Y Fan","year":"2016","unstructured":"Fan, Y., Liu, H.: Quasi-cyclic codes of index $$1\\frac{1}{3}$$. IEEE Trans. Inf. Theory 60, 6342\u20136347 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1771_CR13","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/TIT.2014.2368138","volume":"62","author":"Y Fan","year":"2015","unstructured":"Fan, Y., Lin, L.: Thresholds of random quasi-abelian codes. IEEE Trans. Inf. Theory 62, 82\u201390 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1771_CR14","unstructured":"Fan, Y., Liu, H.: $${\\mathbb{Z}}_{2}{\\mathbb{Z}}_{4}$$-additive cyclic codes are asymptotically good. https:\/\/arxiv.org\/abs\/1911.09350 (2019)"},{"key":"1771_CR15","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1109\/LCOMM.2020.2992501","volume":"24","author":"J Gao","year":"2020","unstructured":"Gao, J., Hou, X.: $${\\mathbb{Z} }_{4}$$-double cyclic codes are asymptotically good. IEEE Commun. Lett. 24, 1593\u20131597 (2020)","journal-title":"IEEE Commun. Lett."},{"key":"1771_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.ffa.2016.02.003","volume":"39","author":"J Gao","year":"2016","unstructured":"Gao, J., Shi, M., Wu, T., Fu, F.: On double cyclic codes over $${\\mathbb{Z} }_{4}$$. Finite Fields Appl. 39, 233\u2013250 (2016)","journal-title":"Finite Fields Appl."},{"key":"1771_CR17","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.ffa.2017.06.005","volume":"47","author":"C G\u00fcneri","year":"2017","unstructured":"G\u00fcneri, C., \u00d6zbudak, F., \u00d6zkaya, B., Sa\u00e7\u0131kara, E., Sepasdar, Z., Sol\u00e9, P.: Structure and performance of generalized quasi-cyclic codes. Finite Fields Appl. 47, 183\u2013202 (2017)","journal-title":"Finite Fields Appl."},{"key":"1771_CR18","volume-title":"Fundamental of Mathematical Statistics","author":"SC Gupta","year":"1970","unstructured":"Gupta, S.C., Kapoor, V.K.: Fundamental of Mathematical Statistics. Sultan Chand and Sons, Delhi (1970)"},{"key":"1771_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error Correcting Codes. Cambridge University Press, Cambridge (2003)"},{"key":"1771_CR20","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/s12190-020-01466-w","volume":"66","author":"X Hou","year":"2021","unstructured":"Hou, X., Gao, J.: $${\\mathbb{Z} }_{p} {\\mathbb{Z} }_{p}[v]$$-additive cyclic codes are asymptotically good. J. Appl. Math. Comput. 66, 871\u2013884 (2021)","journal-title":"J. Appl. Math. Comput."},{"key":"1771_CR21","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1109\/TIT.2005.862123","volume":"52","author":"C Martinez-Perez","year":"2006","unstructured":"Martinez-Perez, C., Willems, W.: Is the class of cyclic codes asymptotically good? IEEE Trans. Inf. Theory 52, 696\u2013700 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1771_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing, Randomized Algorithm and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing, Randomized Algorithm and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"1771_CR23","doi-asserted-by":"publisher","first-page":"1980","DOI":"10.1109\/LCOMM.2018.2863370","volume":"22","author":"M Shi","year":"2018","unstructured":"Shi, M., Wu, R., Sol\u00e9, P.: Asymptotically good additive cyclic codes exist. IEEE Commun. Lett. 22, 1980\u20131983 (2018)","journal-title":"IEEE Commun. Lett."},{"key":"1771_CR24","first-page":"24","volume":"5","author":"I Siap","year":"2005","unstructured":"Siap, I., Kulhan, N.: The structure of generalized quasi cyclic codes. Appl. Math. E-Notes 5, 24\u201330 (2005)","journal-title":"Appl. Math. E-Notes"},{"key":"1771_CR25","doi-asserted-by":"publisher","first-page":"641","DOI":"10.3934\/amc.2018038","volume":"12","author":"T Wu","year":"2018","unstructured":"Wu, T., Gao, J., Gao, Y., Fu, F.: $${\\mathbb{Z} }_{2} {\\mathbb{Z} }_{2} {\\mathbb{Z} }_{4} $$-additive cyclic codes. Adv. Math. Commun. 12, 641\u2013657 (2018)","journal-title":"Adv. Math. Commun."},{"key":"1771_CR26","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s12095-019-00397-z","volume":"12","author":"T Yao","year":"2019","unstructured":"Yao, T., Zhu, S.: $${\\mathbb{Z} }_{p} {\\mathbb{Z} }_{p^s}$$-additive cyclic codes are asymptotically good. Cryptogr. Commun. 12, 253\u2013264 (2019)","journal-title":"Cryptogr. Commun."},{"key":"1771_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2020.101633","volume":"63","author":"T Yao","year":"2020","unstructured":"Yao, T., Zhu, S., Kai, X.: $${\\mathbb{Z} }_{p^r} {\\mathbb{Z} }_{p^s}$$-additive cyclic codes are asymptotically good. Finite Fields Appl. 63, 101633 (2020)","journal-title":"Finite Fields Appl."},{"key":"1771_CR28","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1049\/cje.2020.05.013","volume":"29","author":"T Yao","year":"2020","unstructured":"Yao, T., Zhu, S., Kai, X.: Additive cyclic codes are asymptotically good. Chin. J. Electron. 29, 859\u2013864 (2020)","journal-title":"Chin. J. Electron."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-022-01771-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-022-01771-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-022-01771-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T22:44:41Z","timestamp":1674859481000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-022-01771-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,22]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1771"],"URL":"https:\/\/doi.org\/10.1007\/s12190-022-01771-6","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2022,8,22]]},"assertion":[{"value":"14 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}