{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:56:26Z","timestamp":1743018986766,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031229435"},{"type":"electronic","value":"9783031229442"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-22944-2_7","type":"book-chapter","created":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T18:03:58Z","timestamp":1673373838000},"page":"127-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Two Classes of\u00a0Constacyclic Codes with\u00a0Variable Parameters"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9392-9860","authenticated-orcid":false,"given":"Cunsheng","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8975-1163","authenticated-orcid":false,"given":"Zhonghua","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7717-6133","authenticated-orcid":false,"given":"Xiaoqiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,11]]},"reference":[{"issue":"10","key":"7_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 Crypt. 89(10), 2283\u20132294 (2021). https:\/\/doi.org\/10.1007\/s10623-021-00915-2","journal-title":"Des. Codes Crypt."},{"key":"7_CR2","first-page":"1269","volume-title":"Handbook of Coding Theory","author":"EF Assmus Jr","year":"1998","unstructured":"Assmus, E.F., Jr., Key, J.D.: Polynomial codes and finite geometries. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, vol. II, pp. 1269\u20131343. Elsevier, Amsterdam (1998)"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10623-013-9911-7","volume":"73","author":"S Ballet","year":"2014","unstructured":"Ballet, S., Rolland, R.: On low weight codewords of generalized affine and projective Reed-Muller codes. Des. Codes Cryptogr. 73, 271\u2013297 (2014)","journal-title":"Des. Codes Cryptogr."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-45624-4_8","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"TP Berger","year":"2001","unstructured":"Berger, T.P., de Maximy, L.: Cyclic projective reed-muller codes. In: Bozta\u015f, S., Shparlinski, I.E. (eds.) AAECC 2001. LNCS, vol. 2227, pp. 77\u201381. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45624-4_8"},{"key":"7_CR5","unstructured":"Blackford, E.R.: Negacyclic codes for the Lee metric. In: Proceedings of the Conference on Combinatorial Mathematics and its Applications, pp. 298\u2013316. Chapel Hill, NC (1968)"},{"issue":"9","key":"7_CR6","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":"7_CR7","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, 1217\u20131231 (2012)","journal-title":"Finite Fields Appl."},{"key":"7_CR8","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":"7_CR9","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."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.ffa.2018.06.006","volume":"53","author":"C Ding","year":"2018","unstructured":"Ding, C., Li, C., Xia, Y.: Another generalization of the Reed-Muller codes. Finite Fields Appl. 53, 147\u2013174 (2018)","journal-title":"Finite Fields Appl."},{"key":"7_CR11","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"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1016517611818","volume":"26","author":"P Ding","year":"2002","unstructured":"Ding, P., Key, J.D.: Subcodes of the projective generalized Reed-Muller codes spanned by minimum-weight vectors. Des. Codes Cryptogr. 26, 197\u2013211 (2002)","journal-title":"Des. Codes Cryptogr."},{"key":"7_CR13","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)"},{"key":"7_CR14","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."},{"key":"7_CR15","first-page":"284","volume":"30","author":"J Georgiades","year":"1982","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, 284\u2013285 (1982)","journal-title":"Atti Sent. Mat. Fis. Univ. Modena"},{"key":"7_CR16","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de"},{"key":"7_CR17","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)"},{"issue":"4","key":"7_CR18","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":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-19368-5_13","volume-title":"Coding Theory and Applications","author":"G Lachaud","year":"1988","unstructured":"Lachaud, G.: Projective reed-muller codes. In: Cohen, G., Godlewski, P. (eds.) Coding Theory 1986. LNCS, vol. 311, pp. 125\u2013129. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-19368-5_13"},{"issue":"3","key":"7_CR20","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":"7_CR21","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."},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"2447","DOI":"10.1007\/s10623-019-00630-z","volume":"87","author":"S Li","year":"2019","unstructured":"Li, S.: On the weight distribution of second order Reed-Muller codes and their relatives. Des. Codes Cryptogr. 87, 2447\u20132460 (2019)","journal-title":"Des. Codes Cryptogr."},{"key":"7_CR23","volume-title":"Finite Fields","author":"R Lidl","year":"1983","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Addison-Wesly, New York (1983)"},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Liu, Y., Li, R., Lv, L., Ma, Y.: A class of constacyclic BCH codes and new quantum codes. Quantum Inf. Process. 16(3), 1\u201316 (2017). https:\/\/doi.org\/10.1007\/s11128-017-1533-y","DOI":"10.1007\/s11128-017-1533-y"},{"issue":"6","key":"7_CR25","first-page":"1","volume":"334","author":"J Mi","year":"2021","unstructured":"Mi, J., Cao, X.: Constructing MDS Galois self-dual constacyclic codes over finite fields. Discret. Math. 334(6), 1\u201315 (2021)","journal-title":"Discret. Math."},{"key":"7_CR26","first-page":"6","volume":"3","author":"DE Muller","year":"1954","unstructured":"Muller, D.E.: Application of boolean algebra to switching circuit design and to error detection. IEEE Trans. Comput. 3, 6\u201312 (1954)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"7_CR27","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":"7_CR28","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"},{"key":"7_CR29","first-page":"38","volume":"4","author":"IS Reed","year":"1954","unstructured":"Reed, I.S.: A class of multiple-error-correcting codes and the decoding scheme. IRE Trans. Inf. Theory 4, 38\u201349 (1954)","journal-title":"IRE Trans. Inf. Theory"},{"issue":"10","key":"7_CR30","doi-asserted-by":"publisher","first-page":"1","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(10), 1\u201340 (2019). https:\/\/doi.org\/10.1007\/s11128-019-2440-1","journal-title":"Quantum Inf. Process."},{"issue":"2","key":"7_CR31","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."},{"issue":"1","key":"7_CR32","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":"7_CR33","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."},{"issue":"6","key":"7_CR34","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1109\/18.104317","volume":"37","author":"A S\u00f8rensen","year":"1991","unstructured":"S\u00f8rensen, A.: Projective Reed-Muller codes. IEEE Trans. Inf. Theory 37(6), 1567\u20131576 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR35","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s12095-019-00401-6","volume":"12","author":"S Sun","year":"2020","unstructured":"Sun, S., Zhu, S., Wang, L.: A class of constacyclic BCH codes. Cryptogr. Commun. 12, 265\u2013284 (2020)","journal-title":"Cryptogr. Commun."},{"issue":"10","key":"7_CR36","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(10), 2139\u20132165 (2018)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22944-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T10:15:06Z","timestamp":1673432106000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22944-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031229435","9783031229442"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22944-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAIFI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on the Arithmetic of Finite Fields","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waifi2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/waifi.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3 (invited papers from invited speakers)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}