{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T22:05:27Z","timestamp":1776204327993,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T00:00:00Z","timestamp":1652918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T00:00:00Z","timestamp":1652918400000},"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","id":[{"id":"10.13039\/501100001501","id-type":"DOI","asserted-by":"publisher"}]},{"name":"IHUB-ANUBHUTI-IIITD FOUNDATION","award":["IHUB Anubhuti\/Project Grant\/12"],"award-info":[{"award-number":["IHUB Anubhuti\/Project Grant\/12"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s12095-022-00583-6","type":"journal-article","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T09:06:55Z","timestamp":1652951215000},"page":"17-33","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Multi-twisted additive codes over finite fields are asymptotically good"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0133-8658","authenticated-orcid":false,"given":"Sandeep","family":"Sharma","sequence":"first","affiliation":[]},{"given":"Anuradha","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,19]]},"reference":[{"key":"583_CR1","doi-asserted-by":"crossref","unstructured":"Alahmadi, A., G\u00fcneri, C., Shoaib, H., Sol\u00e9, P.: Long quasi-polycyclic t-CIS codes. Adv. Math. Commun. 12(1), 189\u2013198 (2018)","DOI":"10.3934\/amc.2018013"},{"key":"583_CR2","unstructured":"Ambrose, C.D.: On Artin\u2019s primitive root conjecture, Doctoral thesis, Gottingen univ (2014)"},{"key":"583_CR3","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ffa.2016.12.002","volume":"45","author":"N Aydin","year":"2017","unstructured":"Aydin, N., Halilovi\u0107, A.: A generalization of quasi-twisted codes: Multi-twisted codes. Finite Fields Appl. 45, 96\u2013106 (2017)","journal-title":"Finite Fields Appl."},{"issue":"3","key":"583_CR4","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1002\/(SICI)1520-6610(2000)8:3<174::AID-JCD3>3.0.CO;2-T","volume":"8","author":"J Bierbrauer","year":"2000","unstructured":"Bierbrauer, J., Edel, Y.: Quantum twisted codes. J. Combin. Des. 8(3), 174\u2013188 (2000)","journal-title":"J. Combin. Des."},{"issue":"4","key":"583_CR5","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1109\/18.681315","volume":"44","author":"AR Calderbank","year":"1998","unstructured":"Calderbank, A.R., Rains, E.M., Shor, P.M., Sloane, N.J.A.: Quantum error correction via codes over GF(4). IEEE Trans. Inform. Theory 44(4), 1369\u20131387 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"583_CR6","doi-asserted-by":"crossref","unstructured":"Cao, Y., Chang, X., Cao, Y.: Constacyclic $$\\mathbb {F}_{q}$$-linear $$\\mathbb {F}_{q^{\\ell }}$$-codes. Appl. Algebra Engrg. Comm. Comput. 26(4), 369\u2013388 (2015)","DOI":"10.1007\/s00200-015-0257-4"},{"key":"583_CR7","doi-asserted-by":"crossref","unstructured":"Chauhan, V., Sharma, A.: Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents, Finite Fields Appl. 76, Paper No 101910 (2021)","DOI":"10.1016\/j.ffa.2021.101910"},{"issue":"4","key":"583_CR8","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0019-9958(69)90497-5","volume":"15","author":"CL Chen","year":"1969","unstructured":"Chen, C.L., Peterson, W.W., Weldon Jr., E.J.: Some results on quasi-cyclic codes. Inform. Control. 15(4), 407\u2013423 (1969)","journal-title":"Inform. Control."},{"issue":"1","key":"583_CR9","first-page":"39","volume":"28","author":"VV Chepyzhov","year":"1992","unstructured":"Chepyzhov, V.V.: New lower bounds for minimum distance of linear quasi-cyclic and almost linear cyclic codes. Probl. Peredachi Inf. 28(1), 39\u201351 (1992)","journal-title":"Probl. Peredachi Inf."},{"issue":"1","key":"583_CR10","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/TIT.2014.2368138","volume":"61","author":"Y Fan","year":"2014","unstructured":"Fan, Y., Lin, L.R.: Thresholds of random quasi-abelian codes. IEEE Trans. Inform. Theory 61(1), 82\u201390 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"583_CR11","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":"583_CR12","unstructured":"Guruswami, V., Rudra, A., Sudan, M.: Essential coding theory, Draft available at: http:\/\/www.cse.buffalo.edu\/faculty\/atri\/courses\/coding-theory\/book (2022)"},{"issue":"1","key":"583_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1093\/qmath\/37.1.27","volume":"37","author":"DR Heath-Brown","year":"1986","unstructured":"Heath-Brown, D.R.: Artin\u2019s conjecture for primitive roots. Quarterly J. Math. 37(1), 27\u201338 (1986)","journal-title":"Quarterly J. Math."},{"key":"583_CR14","first-page":"209","volume":"225","author":"C Hooley","year":"1967","unstructured":"Hooley, C.: On Artin\u2019s conjecture. J. Reine Angew. Math. 225, 209\u2013220 (1967)","journal-title":"J. Reine Angew. Math."},{"key":"583_CR15","doi-asserted-by":"crossref","unstructured":"Huffman, W.C.: Additive cyclic codes over $$\\mathbb {F}_{4}$$. Adv. Math. Commun. 1(4), 427\u2013459 (2007)","DOI":"10.3934\/amc.2007.1.427"},{"key":"583_CR16","doi-asserted-by":"crossref","unstructured":"Huffman, W.C.: Additive cyclic codes over $$\\mathbb {F}_{4}$$ of even length. Adv. Math. Commun. 2(3), 309\u2013343 (2008)","DOI":"10.3934\/amc.2008.2.309"},{"key":"583_CR17","unstructured":"Huffman, W.C.: Cyclic $$\\mathbb {F}_{q}$$linear $$\\mathbb {F}_{q^{t}}$$codes. Int. J. Inform. Coding Theory 1(3), 249\u2013284 (2010)"},{"issue":"3","key":"583_CR18","first-page":"18","volume":"13","author":"GA Kabatiansky","year":"1977","unstructured":"Kabatiansky, G.A.: On existence of good cyclic almost linear codes over nonprime fields. Probl. Peredachi Inf. 13(3), 18\u201321 (1977)","journal-title":"Probl. Peredachi Inf."},{"issue":"5","key":"583_CR19","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1109\/TIT.1974.1055262","volume":"20","author":"T Kasami","year":"1974","unstructured":"Kasami, T.: A Gilbert-Varshamov bound for quasi-cycle codes of rate 1\/2 (Corresp.). IEEE Trans. Inform. Theory 20(5), 679\u2013679 (1974)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"583_CR20","doi-asserted-by":"crossref","unstructured":"Kaur, T., Sharma, A.: Constacyclic additive codes over finite fields. Discrete Math. Algorithms Appl. 9(3) Article no. 1750037, pp. 1\u201335 (2017)","DOI":"10.1142\/S1793830917500379"},{"key":"583_CR21","unstructured":"Kruk, E.A.: Message transmission by generalized quasi-cyclic codes through discrete communication channels, PhD dissertation, Leningrad (1978)"},{"key":"583_CR22","unstructured":"Lang, S., Tate, J. (eds.): The collected papers of Emil Artin. Addison\u2013Wesley Publishing Co., Inc., Reading, Mass.-London (1965)"},{"issue":"6","key":"583_CR23","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1515\/integers-2012-0043","volume":"12","author":"P Moree","year":"2012","unstructured":"Moree, P.: Artin\u2019s primitive root conjecture - a survey. Integers 12(6), 1305\u20131416 (2012)","journal-title":"Integers"},{"issue":"6","key":"583_CR24","doi-asserted-by":"publisher","first-page":"1827","DOI":"10.1109\/18.782103","volume":"45","author":"EM Rains","year":"1999","unstructured":"Rains, E.M.: Nonbinary quantum codes. IEEE Trans. Inform. Theory 45(6), 1827\u20131832 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"583_CR25","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.ffa.2019.06.005","volume":"59","author":"A Sharma","year":"2019","unstructured":"Sharma, A., Chauhan, V.: Skew multi-twisted codes over finite fields and their Galois duals. Finite Fields Appl. 59, 297\u2013334 (2019)","journal-title":"Finite Fields Appl."},{"key":"583_CR26","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.ffa.2018.01.012","volume":"51","author":"A Sharma","year":"2018","unstructured":"Sharma, A., Chauhan, V., Singh, H.: Multi-twisted codes over finite fields and their dual codes. Finite Fields Appl. 51, 270\u2013297 (2018)","journal-title":"Finite Fields Appl."},{"key":"583_CR27","unstructured":"Sharma, A., Kaur, T.: On cyclic $$\\mathbb {F}_{q}$$-linear $$\\mathbb {F}_{q^{t}}$$-codes. Int. J. Inf. Coding Theory 4(1), 19\u201346 (2017)"},{"key":"583_CR28","doi-asserted-by":"crossref","unstructured":"Sharma, A., Kaur, T.: Enumeration of complementary-dual cyclic $$\\mathbb {F}_{q}$$-linear $$\\mathbb {F}_{q^{t}}$$-codes. Discrete Math. 341(4), 965\u2013980 (2018)","DOI":"10.1016\/j.disc.2017.12.006"},{"key":"583_CR29","doi-asserted-by":"publisher","unstructured":"Sharma, S., Sharma, A.: Multi-twisted additive codes over finite fields. Beitr. Algebra Geom. 1\u201334 (2021), https:\/\/doi.org\/10.1007\/s13366-021-00576-1","DOI":"10.1007\/s13366-021-00576-1"},{"key":"583_CR30","doi-asserted-by":"crossref","unstructured":"Sharma, S., Sharma, A.: Multi-twisted additive codes over finite fields with complementary duals. Probl. Inf. Transm. 58(1), 32\u201357 (2022)","DOI":"10.1134\/S0032946022010033"},{"key":"583_CR31","doi-asserted-by":"crossref","unstructured":"Shi, M., Wu, R., Sol\u00e9, P.: Asymptotically good additive cyclic codes exist. IEEE Commun. Lett. 22(10), 1980\u20131983 (2018)","DOI":"10.1109\/LCOMM.2018.2863370"},{"key":"583_CR32","volume-title":"Probability and computing: randomized algorithms and probabilistic analysis","author":"E Upfal","year":"2005","unstructured":"Upfal, E., Mitzenmacher, M.: Probability and computing: randomized algorithms and probabilistic analysis. Cambridge Univ. Press, Cambridge (2005)"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00583-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-022-00583-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00583-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T08:20:41Z","timestamp":1674807641000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-022-00583-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,19]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["583"],"URL":"https:\/\/doi.org\/10.1007\/s12095-022-00583-6","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,19]]},"assertion":[{"value":"10 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}