{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:39:32Z","timestamp":1762522772567,"version":"build-2065373602"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T00:00:00Z","timestamp":1673568000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T00:00:00Z","timestamp":1673568000000},"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":["Cryptogr. Commun."],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s12095-022-00624-0","type":"journal-article","created":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T09:04:32Z","timestamp":1673600672000},"page":"21-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["MDS constacyclic codes of length q +\u20091 over GF(q)"],"prefix":"10.1007","volume":"16","author":[{"given":"Xiaoqiang","family":"Wang","sequence":"first","affiliation":[]},{"given":"Cunsheng","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Hongwei","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Dabin","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,13]]},"reference":[{"key":"624_CR1","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1016\/j.ffa.2008.05.004","volume":"14","author":"T Blackford","year":"2008","unstructured":"Blackford, T.: Negacyclic duadic codes. Finite Fields Appl. 14, 930\u2013943 (2008)","journal-title":"Finite Fields Appl."},{"key":"624_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00147659","volume":"13","author":"LRA Casse","year":"1982","unstructured":"Casse, L. R. A., Glynn, D. G.: The solution to Beniamino Segre\u2019s problem ir,q, r =\u20093, q =\u20092h. Geom. Ded. 13, 157\u2013163 (1982)","journal-title":"Geom. Ded."},{"issue":"9","key":"624_CR3","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":"624_CR4","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":"624_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 +\u20091. J. Comb. Theory Ser. A 59, 130\u2013133 (1992)","journal-title":"J. Comb. Theory Ser. A"},{"key":"624_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":"3","key":"624_CR7","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1109\/TIT.1984.1056909","volume":"30","author":"V Da Rocha","year":"1984","unstructured":"Da Rocha, V.: Maximum distance separable multilevel codes. IEEE Trans. Inf. Theory 30(3), 547\u2013548 (1984)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"624_CR8","doi-asserted-by":"crossref","unstructured":"Ding, C., Helleseth, T., Kl\u00f8 ve, T., Wang X.: A general construction of authentication codes. IEEE Trans. Inf. Theory 53(6), 2229\u20132235 (2007)","DOI":"10.1109\/TIT.2007.896872"},{"issue":"9","key":"624_CR9","first-page":"1023","volume":"3","author":"C Ding","year":"1997","unstructured":"Ding, C., Laihonen, T., Renvall, A.: Linear multi-secret sharing schemes and error-correcting codes. J. Universal Computer Science 3(9), 1023\u20131036 (1997)","journal-title":"J. Universal Computer Science"},{"key":"624_CR10","doi-asserted-by":"publisher","DOI":"10.1142\/3254","volume-title":"Chinese Remainder Theorem: Applications in Computing, Coding and Cryptography","author":"C Ding","year":"1996","unstructured":"Ding, C., Pei, D., Salomaa, A.: Chinese Remainder Theorem: Applications in Computing, Coding and Cryptography. World Scientific, Singapore (1996)"},{"key":"624_CR11","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.jalgebra.2010.05.027","volume":"324","author":"HQ Dinh","year":"2010","unstructured":"Dinh, H. Q.: Constacyclic codes of length ps over $\\mathbb {F}_{p^{m}}+u \\mathbb {F}_{p^{m}}$. J. Algebra 324, 940\u2013950 (2010)","journal-title":"J. Algebra"},{"key":"624_CR12","first-page":"284","volume":"30","author":"J Georgiades","year":"1982","unstructured":"Georgiades, J.: Cyclic (q +\u20091,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"},{"issue":"4","key":"624_CR13","doi-asserted-by":"publisher","first-page":"779","DOI":"10.3934\/amc.2019045","volume":"13","author":"KC Gupta","year":"2019","unstructured":"Gupta, K. C., Pandey, S. K., Ray, I. G., Samanta, S.: Cryptographically significant MDS matrices over finite feilds: a brief survey and some generalized results. Adv. Math. Commun. 13(4), 779\u2013843 (2019)","journal-title":"Adv. Math. Commun."},{"issue":"4","key":"624_CR14","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"},{"issue":"1","key":"624_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2298\/FIL1901001K","volume":"33","author":"ME Koroglu","year":"2019","unstructured":"Koroglu, M. E., San, M.: On MDS negacyclic LCD codes. Filomat 33(1), 1\u201312 (2019)","journal-title":"Filomat"},{"key":"624_CR16","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1016\/j.laa.2016.02.014","volume":"496","author":"GG La Guardia","year":"2016","unstructured":"La Guardia, G. G.: On optimal constacyclic codes. Linear Algebra Appl. 496, 594\u2013610 (2016)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"624_CR17","doi-asserted-by":"publisher","first-page":"1703","DOI":"10.1109\/TIT.2016.2535180","volume":"62","author":"S Li","year":"2016","unstructured":"Li, S., Xiong, M., Ge, G.: Pseudocyclic codes and the construction of quantum MDS codes. IEEE Trans. Inf. Theory 62(4), 1703\u20131710 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"66","key":"624_CR18","first-page":"1","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), 1\u201316 (2017)","journal-title":"Quantum Inf. Process."},{"key":"624_CR19","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F. J., Sloane, N. J. A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)"},{"key":"624_CR20","unstructured":"Maruta, T.: On the uniqueness of cyclic MDS codes, Atti Sem. Mat. Fis. Univ. Modena XL 83\u201388 (1992)"},{"key":"624_CR21","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/S0195-6698(97)90000-7","volume":"19","author":"T Maruta","year":"1998","unstructured":"Maruta, T.: On the existence of cyclic and pseudo-cyclic MDS codes. Europ. J. Combinatorics 19, 159\u2013174 (1998)","journal-title":"Europ. J. Combinatorics"},{"issue":"6","key":"624_CR22","doi-asserted-by":"publisher","first-page":"1","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. Discrete Math. 344(6), 1\u201315 (2021)","journal-title":"Discrete Math."},{"issue":"2","key":"624_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":"624_CR24","volume-title":"Error-Correcting Codes","author":"WW Peterson","year":"1972","unstructured":"Peterson, W. W., Weldon, E. J.: Error-Correcting Codes, 2nd edn. MIT Press, Cambridge (1972)","edition":"2nd edn."},{"key":"624_CR25","first-page":"67","volume-title":"The access structure of some secret sharing schemes. Information Security and Privacy, LNCS 1172","author":"A Renvall","year":"1996","unstructured":"Renvall, A., Ding, C.: The access structure of some secret sharing schemes. Information Security and Privacy, LNCS 1172, pp 67\u201378. Springer, Berlin (1996)"},{"key":"624_CR26","first-page":"56","volume-title":"A nonlinear secret sharing scheme. Information Security and Privacy. LNCS 1172","author":"A Renvall","year":"1996","unstructured":"Renvall, A., Ding, C.: A nonlinear secret sharing scheme. Information Security and Privacy. LNCS 1172, pp 56\u201365. Springer, Berlin (1996)"},{"key":"624_CR27","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."},{"issue":"9","key":"624_CR28","doi-asserted-by":"publisher","first-page":"5792","DOI":"10.1109\/TIT.2022.3163813","volume":"68","author":"C Tang","year":"2022","unstructured":"Tang, C., Wang, Q., Ding, C.: The subfield subcodes and subfield codes of a family of MDS codes. IEEE Trans. Inf. Theory 68(9), 5792\u20135801 (2022)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00624-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-022-00624-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00624-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T05:23:11Z","timestamp":1706937791000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-022-00624-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,13]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["624"],"URL":"https:\/\/doi.org\/10.1007\/s12095-022-00624-0","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2023,1,13]]},"assertion":[{"value":"20 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2023","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 have no conficts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}