{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T14:27:45Z","timestamp":1769524065358,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T00:00:00Z","timestamp":1684195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T00:00:00Z","timestamp":1684195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62002093"],"award-info":[{"award-number":["62002093"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12001175"],"award-info":[{"award-number":["12001175"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hong Kong Research Grants Council","award":["16301522"],"award-info":[{"award-number":["16301522"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10623-023-01242-4","type":"journal-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T09:02:24Z","timestamp":1684227744000},"page":"2821-2843","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Several families of irreducible constacyclic and cyclic codes"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8975-1163","authenticated-orcid":false,"given":"Zhonghua","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoqiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cunsheng","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,16]]},"reference":[{"key":"1242_CR1","doi-asserted-by":"publisher","first-page":"2283","DOI":"10.1007\/s10623-021-00915-2","volume":"89","author":"K Abdukhalikov","year":"2021","unstructured":"Abdukhalikov K., Ho D.: Extended cyclic codes, maximal arcs and ovoids. Des. Codes Cryptogr. 89, 2283\u20132294 (2021).","journal-title":"Des. Codes Cryptogr."},{"key":"1242_CR2","unstructured":"Berlekamp E.R.: Negacyclic codes for the Lee metric. In: Proceedings of the Conference on Combinatorial Mathematics and Its Applications, pp. 298\u2013316. University of North Carolina Press, Chapel Hill (1968)."},{"issue":"6","key":"1242_CR3","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/j.ffa.2012.10.001","volume":"18","author":"B Chen","year":"2012","unstructured":"Chen B., Fan Y., Lin L., Liu H.: Constacyclic codes over finite fields. Finite Fields Appl. 18(6), 1217\u20131231 (2012).","journal-title":"Finite Fields Appl."},{"issue":"9","key":"1242_CR4","doi-asserted-by":"publisher","first-page":"4895","DOI":"10.1109\/TIT.2015.2451656","volume":"61","author":"B Chen","year":"2015","unstructured":"Chen B., Dinh H.Q., Fan Y., Ling S.: Polyadic constacyclic codes. IEEE Trans. Inf. Theory 61(9), 4895\u20134904 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1242_CR5","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0097-3165(92)90104-3","volume":"59","author":"C Dahl","year":"1992","unstructured":"Dahl C., Pedersen J.P.: Cyclic and pseudo-cyclic MDS codes of length $$q+1$$. J. Comb. Theory Ser. A 59, 130\u2013133 (1992).","journal-title":"J. Comb. Theory Ser. A"},{"key":"1242_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10623-010-9470-0","volume":"59","author":"D Danev","year":"2011","unstructured":"Danev D., Dodunekov S., Radkova D.: A family of constacyclic ternary quasi-perfect codes with covering radius 3. Des. Codes Cryptogr. 59, 111\u2013118 (2011).","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"1242_CR7","doi-asserted-by":"publisher","first-page":"4715","DOI":"10.1109\/TIT.2019.2907276","volume":"65","author":"C Ding","year":"2019","unstructured":"Ding C., Heng Z.: The subfield codes of ovoid codes. IEEE Trans. Inf. Theory 65(8), 4715\u20134729 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1242_CR8","doi-asserted-by":"publisher","DOI":"10.1142\/12697","volume-title":"Designs from Linear Codes","author":"C Ding","year":"2022","unstructured":"Ding C., Tang C.: Designs from Linear Codes, 2nd edn World Scientific, Singapore (2022).","edition":"2"},{"issue":"4","key":"1242_CR9","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/j.disc.2012.11.009","volume":"313","author":"C Ding","year":"2013","unstructured":"Ding C., Yang J.: Hamming weights in irreducible cyclic codes. Discr. Math. 313(4), 434\u2013446 (2013).","journal-title":"Discr. Math."},{"key":"1242_CR10","first-page":"129","volume":"33","author":"X Dong","year":"2010","unstructured":"Dong X., Yin S.: The trace representation of $$\\lambda $$-constacyclic codes over $${\\mathbb{F} }_{q}$$. J. Liaoning Normal Univ. (Nat. Sci. Ed.) 33, 129\u2013131 (2010).","journal-title":"J. Liaoning Normal Univ. (Nat. Sci. Ed.)"},{"key":"1242_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ffa.2017.06.009","volume":"47","author":"W Fang","year":"2017","unstructured":"Fang W., Wen J., Fu F.: A $$q$$-polynomial approach to constacyclic codes. Finite Fields Appl. 47, 161\u2013182 (2017).","journal-title":"Finite Fields Appl."},{"issue":"2","key":"1242_CR12","first-page":"284","volume":"30","author":"J Georgiades","year":"1983","unstructured":"Georgiades J.: Cyclic $$(q+1, k)$$-codes of odd order $$q$$ and even dimension $$k$$ are not optimal. Atti Sent. Mat. Fis. Univ. Modena 30(2), 284\u2013285 (1983).","journal-title":"Atti Sent. Mat. Fis. Univ. Modena"},{"key":"1242_CR13","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1007\/s10623-018-0507-0","volume":"87","author":"Z Heng","year":"2019","unstructured":"Heng Z., Ding C.: A construction of $$q$$-ary linear codes with irreducible cyclic codes. Des. Codes Cryptogr. 87, 1087\u20131108 (2019).","journal-title":"Des. Codes Cryptogr."},{"key":"1242_CR14","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":"1242_CR15","doi-asserted-by":"publisher","DOI":"10.1142\/6400","volume-title":"Codes for Error Detection","author":"T K\u00f8lve","year":"2007","unstructured":"K\u00f8lve T.: Codes for Error Detection. World Scientfic, Singapore (2007)."},{"issue":"4","key":"1242_CR16","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1109\/18.53751","volume":"36","author":"A Krishna","year":"1990","unstructured":"Krishna A., Sarwate D.V.: Pseudocyclic maximum-distance-separable codes. IEEE Trans. Inf. Theory 36(4), 880\u2013884 (1990).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1242_CR17","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/s10623-017-0356-2","volume":"86","author":"F Li","year":"2018","unstructured":"Li F., Yue Q.: The primitive idempotents and weight distributions of irreducible constacyclic codes. Des. Codes Cryptogr. 86, 771\u2013784 (2018).","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"1242_CR18","doi-asserted-by":"publisher","first-page":"471","DOI":"10.3934\/amc.2017039","volume":"11","author":"F Li","year":"2017","unstructured":"Li F., Yue Q., Liu F.: The weight distribution of constacyclic codes. Adv. Math. Commun. 11(3), 471\u2013480 (2017).","journal-title":"Adv. Math. Commun."},{"key":"1242_CR19","volume-title":"Finite Fields","author":"R Lidl","year":"1983","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Addison-Wesly, New York (1983)."},{"key":"1242_CR20","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/s11128-017-1533-y","volume":"16","author":"Y Liu","year":"2017","unstructured":"Liu Y., Li R., Lv L., Ma Y.: A class of constacyclic BCH codes and new quantum codes. Quantum Inf. Process. 16, 66 (2017).","journal-title":"Quantum Inf. Process."},{"issue":"6","key":"1242_CR21","doi-asserted-by":"publisher","first-page":"112388","DOI":"10.1016\/j.disc.2021.112388","volume":"344","author":"J Mi","year":"2021","unstructured":"Mi J., Cao X.: Constructing MDS Galois self-dual constacyclic codes over finite fields. Discr. Math. 344(6), 112388 (2021).","journal-title":"Discr. Math."},{"issue":"3","key":"1242_CR22","doi-asserted-by":"publisher","first-page":"251","DOI":"10.4064\/aa-39-3-251-264","volume":"39","author":"G Myerson","year":"1981","unstructured":"Myerson G.: Period polynomials and Gauss sums for finite fields. Acta Arith. 39(3), 251\u2013264 (1981).","journal-title":"Acta Arith."},{"issue":"2","key":"1242_CR23","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/18.75254","volume":"37","author":"JP Pedersen","year":"1991","unstructured":"Pedersen J.P., Dahl C.: Classification of pseudo-cyclic MDS codes. IEEE Trans. Inf. Theory 37(2), 365\u2013370 (1991).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1242_CR24","volume-title":"Error-Correcting Codes","author":"WW Peterson","year":"1972","unstructured":"Peterson W.W., Weldon E.J. Jr.: Error-Correcting Codes, 2nd edn MIT Press, Cambridge (1972).","edition":"2"},{"issue":"1","key":"1242_CR25","doi-asserted-by":"publisher","first-page":"123","DOI":"10.3934\/amc.2018008","volume":"12","author":"A Sharma","year":"2018","unstructured":"Sharma A., Rani S.: Trace description and Hamming weights of irreducible constacyclic codes. Adv. Math. Commun. 12(1), 123\u2013141 (2018).","journal-title":"Adv. Math. Commun."},{"key":"1242_CR26","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s12095-019-00362-w","volume":"12","author":"Z Shi","year":"2020","unstructured":"Shi Z., Fu F.: The primitive idempotents of irreducible constacyclic codes and LCD cyclic codes. Cryptogr. Commun. 12, 29\u201352 (2020).","journal-title":"Cryptogr. Commun."},{"key":"1242_CR27","unstructured":"Singh M.: Weight distributions of all irreducible $$\\mu $$-constacyclic codes of length $$\\ell ^n$$. https:\/\/arxiv.org\/abs\/1806.10600v1."},{"key":"1242_CR28","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s12095-019-00401-6","volume":"12","author":"Z Sun","year":"2020","unstructured":"Sun Z., Zhu S., Wang L.: A class of constacyclic BCH codes. Cryptogr. Commun. 12, 265\u2013284 (2020).","journal-title":"Cryptogr. Commun."},{"key":"1242_CR29","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s11128-019-2440-1","volume":"18","author":"L Wang","year":"2019","unstructured":"Wang L., Sun Z., Zhu S.: Hermitian dual-containing narrow-sense constacyclic BCH codes and quantum codes. Quantum Inf. Process. 18, 323 (2019).","journal-title":"Quantum Inf. Process."},{"issue":"2","key":"1242_CR30","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.ffa.2007.01.003","volume":"14","author":"J Wolfmann","year":"2008","unstructured":"Wolfmann J.: Projective two-weight irreducible cyclic and constacyclic codes. Finite Fields Appl. 14(2), 351\u2013360 (2008).","journal-title":"Finite Fields Appl."},{"key":"1242_CR31","doi-asserted-by":"publisher","first-page":"2139","DOI":"10.1007\/s10623-017-0441-6","volume":"86","author":"S Zhu","year":"2018","unstructured":"Zhu S., Sun Z., Li P.: A class of negacyclic BCH codes and its application to quantum codes. Des. Codes Cryptogr. 86, 2139\u20132165 (2018).","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01242-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01242-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01242-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T12:08:12Z","timestamp":1693224492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01242-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,16]]},"references-count":31,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1242"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01242-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,16]]},"assertion":[{"value":"28 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2023","order":4,"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 there are no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}