{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:42:28Z","timestamp":1740148948614,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T00:00:00Z","timestamp":1724630400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T00:00:00Z","timestamp":1724630400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001501","name":"University Grants Commission","doi-asserted-by":"publisher","award":["Ref. No.: 211610147912"],"award-info":[{"award-number":["Ref. No.: 211610147912"]}],"id":[{"id":"10.13039\/501100001501","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["SRG\/2021\/000055, dated 03 December 2021"],"award-info":[{"award-number":["SRG\/2021\/000055, dated 03 December 2021"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s12095-024-00737-8","type":"journal-article","created":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T07:02:16Z","timestamp":1724655736000},"page":"1559-1580","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On $$\\mathbb {Z}_{p^r} \\mathbb {Z}_{p^s} \\mathbb {Z}_{p^t}$$-additive cyclic codes exhibit asymptotically good properties"],"prefix":"10.1007","volume":"16","author":[{"given":"Mousumi","family":"Ghosh","sequence":"first","affiliation":[]},{"given":"Sachin","family":"Pathak","sequence":"additional","affiliation":[]},{"given":"Dipendu","family":"Maity","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,26]]},"reference":[{"issue":"3","key":"737_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, N.: $$\\mathbb{Z} _2\\mathbb{Z} _4$$-additive cyclic codes. IEEE Trans. Inf. Theory 60(3), 1508\u20131514 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"737_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.13069\/jacodesmath.514339","volume":"6","author":"I Aydogdu","year":"2019","unstructured":"Aydogdu, I.: Codes over $$\\mathbb{Z} _{p}[u]\/{\\langle u^r \\rangle }\\times \\mathbb{Z} _{p}[u]\/{\\langle u^s \\rangle }$$. J. Algebra Comb. Discrete Struct. Appl. 6, 39\u201351 (2019)","journal-title":"J. Algebra Comb. Discrete Struct. Appl."},{"issue":"10","key":"737_CR3","doi-asserted-by":"publisher","first-page":"2089","DOI":"10.1080\/03081087.2014.952728","volume":"63","author":"I Aydogdu","year":"2015","unstructured":"Aydogdu, I., Siap, I.: On $$\\mathbb{Z} _{p^r}\\mathbb{Z} _{p^s}$$-additive codes. Linear Multilinear Algebra 63(10), 2089\u20132102 (2015)","journal-title":"Linear Multilinear Algebra"},{"issue":"7","key":"737_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(7), 3210\u20133219 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"737_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.3934\/amc.2018011","volume":"12","author":"J Borges","year":"2018","unstructured":"Borges, J., Fern\u00e1ndez-C\u00f3rdoba, C., Ten-Valls, R.: On $$\\mathbb{Z} _{p^r}\\mathbb{Z} _{p^s}$$-additive cyclic codes. Adv. Math. Commun. 12(1), 169\u2013179 (2018)","journal-title":"Adv. Math. Commun."},{"issue":"6","key":"737_CR6","doi-asserted-by":"publisher","first-page":"2477","DOI":"10.1109\/18.720545","volume":"44","author":"P Delsarte","year":"1998","unstructured":"Delsarte, P., Levenshtein, V.I.: Association schemes and coding theory. IEEE Trans. Inf. Theory 44(6), 2477\u20132504 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"737_CR7","doi-asserted-by":"crossref","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, Communication and Computing, pp. 1\u201321, (2022)","DOI":"10.1007\/s00200-022-00557-4"},{"issue":"1","key":"737_CR8","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1007\/s12190-022-01771-6","volume":"69","author":"HQ Dinh","year":"2023","unstructured":"Dinh, H.Q., Yadav, B.P., Pathak, S., Prasad, A., Upadhyay, A.K., Yamaka, W.: $$\\mathbb{F} _2[u]\\mathbb{F} _2[u]$$-additive cyclic codes are asymptotically good. J. Appl. Math. Comput. 69(1), 1037\u20131056 (2023)","journal-title":"J. Appl. Math. Comput."},{"issue":"1","key":"737_CR9","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/TIT.2014.2368138","volume":"61","author":"Y Fan","year":"2015","unstructured":"Fan, Y., Lin, L.: Thresholds of random quasi-abelian codes. IEEE Trans. Inf. Theory 61(1), 82\u201390 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"737_CR10","unstructured":"Fan, Y., Ling, S., Liu, H., Shen, J., Xing, C.: Cumulative distance enumerators of random codes and their thresholds. arXiv:1212.5679 (2012)"},{"key":"737_CR11","unstructured":"Fan, Y., Liu, H.: Quasi-cyclic codes of index 1.5. arXiv:1505.02252 (2015)"},{"issue":"11","key":"737_CR12","doi-asserted-by":"publisher","first-page":"6342","DOI":"10.1109\/TIT.2016.2602842","volume":"62","author":"Y Fan","year":"2016","unstructured":"Fan, Y., Liu, H.: Quasi-cyclic codes of index $$1\\frac{1}{3}$$. IEEE Trans. Inf. Theory 62(11), 6342\u20136347 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"737_CR13","unstructured":"Fan, Y., Liu, H.: $$\\mathbb{Z}_2 \\mathbb{Z} _4$$-additive cyclic codes are asymptotically good. arXiv:1911.09350 (2019)"},{"issue":"1\u20132","key":"737_CR14","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(1\u20132), 871\u2013884 (2021)","journal-title":"J. Appl. Math. Comput."},{"issue":"2","key":"737_CR15","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1109\/TIT.2005.862123","volume":"52","author":"C Mart\u00ednez-P\u00e9rez","year":"2006","unstructured":"Mart\u00ednez-P\u00e9rez, C., Willems, W.: Is the class of cyclic codes asymptotically good? IEEE Trans. Inf. Theory 52(2), 696\u2013700 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"737_CR16","doi-asserted-by":"publisher","first-page":"4302","DOI":"10.1109\/TIT.2007.907500","volume":"53","author":"C Mart\u00ednez-P\u00e9rez","year":"2007","unstructured":"Mart\u00ednez-P\u00e9rez, C., Willems, W.: Self-dual doubly even 2-quasi-cyclic transitive codes are asymptotically good. IEEE Trans. Inf. Theory 53(11), 4302\u20134308 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"737_CR17","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and computing: randomized algorithms and probabilistic analysis. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511813603"},{"key":"737_CR18","unstructured":"Molaei, R., Khashyarmanesh, K.: $$\\mathbb{Z}_{p^r}\\mathbb{Z}_{p^s}\\mathbb{Z}_{p^t} $$-additive cyclic codes. Adv. Math. Commun. (2022)"},{"key":"737_CR19","unstructured":"Musili, C.: Introduction to rings and modules. Narosa Publishing House (1994)"},{"issue":"10","key":"737_CR20","doi-asserted-by":"publisher","first-page":"1980","DOI":"10.1109\/LCOMM.2018.2863370","volume":"22","author":"M Shi","year":"2018","unstructured":"Shi, M., Rongsheng, W., Sole, P.: Asymptotically good additive cyclic codes exist. IEEE Commun. Lett. 22(10), 1980\u20131983 (2018)","journal-title":"IEEE Commun. Lett."},{"key":"737_CR21","first-page":"739","volume":"117","author":"RR Varshamov","year":"1957","unstructured":"Varshamov, R.R.: The evaluation of signals in codes with correction of errors. Dokl. Akad. Nauk SSSR 117, 739\u2013741 (1957)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"5","key":"737_CR22","doi-asserted-by":"publisher","first-page":"1290","DOI":"10.3934\/amc.2022087","volume":"17","author":"T Yao","year":"2023","unstructured":"Yao, T., Heqian, X., Tang, Y., Zhu, S.: Asymptotically good $$\\mathbb{Z} _p\\mathbb{Z} _p[u]\/\\langle u^t\\rm \\rangle $$-additive cyclic codes. Adv. Math. Commun. 17(5), 1290\u20131301 (2023)","journal-title":"Adv. Math. Commun."},{"issue":"2","key":"737_CR23","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s12095-019-00397-z","volume":"12","author":"T Yao","year":"2020","unstructured":"Yao, T., Zhu, S.: $$ \\mathbb{Z} _p\\mathbb{Z} _{p^s} $$-additive cyclic codes are asymptotically good. Cryptogr. Commun. 12(2), 253\u2013264 (2020)","journal-title":"Cryptogr. Commun."},{"key":"737_CR24","unstructured":"Yao, T., Zhu, S., Kai, X.: Asymptotically good $$\\mathbb{Z} _{p^r} \\mathbb{Z} _{p^s} $$-additive cyclic codes. Finite Fields Appl. 63, 15 (2020). Id\/No 101633"},{"issue":"2","key":"737_CR25","first-page":"145","volume":"2","author":"B Y\u0131ld\u0131z","year":"2012","unstructured":"Y\u0131ld\u0131z, B., \u00d6zger, Z.\u00d6.: A generalization of the Lee weight to $$\\mathbb{Z} _{p^k}$$. TWMS J. Appl. Eng. Math. 2(2), 145\u2013153 (2012)","journal-title":"TWMS J. Appl. Eng. Math."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00737-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-024-00737-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00737-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T16:23:14Z","timestamp":1737476594000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-024-00737-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,26]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["737"],"URL":"https:\/\/doi.org\/10.1007\/s12095-024-00737-8","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2024,8,26]]},"assertion":[{"value":"6 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}