{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T07:21:56Z","timestamp":1776496916209,"version":"3.51.2"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T00:00:00Z","timestamp":1710806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T00:00:00Z","timestamp":1710806400000},"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":["12171134 and U21A20428"],"award-info":[{"award-number":["12171134 and U21A20428"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10623-024-01380-3","type":"journal-article","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T19:02:47Z","timestamp":1710874967000},"page":"2085-2101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Negacyclic BCH codes of length $$\\frac{q^{2m}-1}{q+1}$$ and their duals"],"prefix":"10.1007","volume":"92","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":"Xinyue","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shixin","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongsheng","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,19]]},"reference":[{"issue":"4","key":"1380_CR1","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1109\/18.508853","volume":"42","author":"D Augot","year":"1996","unstructured":"Augot D., Levy-dit-Vehel F.: Bounds on the minimum distance of the duals of BCH codes. IEEE Trans. Inf. Theory 42(4), 1257\u20131260 (1996).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1380_CR2","unstructured":"Berlekamp E.R.: Negacyclic codes for the Lee metric. In: Proceedings of the Conference Combinatorial Mathematics and Its Applications, Chapel Hill, NC, pp. 298\u2013316 (1968)."},{"key":"1380_CR3","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":"1380_CR4","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. Des. Codes Cryptogr. 59, 111\u2013118 (2011).","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"1380_CR5","first-page":"24","volume":"14","author":"II Dumer","year":"1978","unstructured":"Dumer I.I., Zinoviev V.A.: Some new maximal codes over Galois field GF(4). Probl. Inf. Trans. 14(3), 24\u201334 (1978).","journal-title":"Probl. Inf. Trans."},{"issue":"7","key":"1380_CR6","doi-asserted-by":"publisher","first-page":"4484","DOI":"10.1109\/TIT.2023.3257123","volume":"69","author":"M Fan","year":"2023","unstructured":"Fan M., Li C., Ding C.: The Hermitian dual codes of several classes of BCH codes. IEEE Trans. Inf. Theory 69(7), 4484\u20134497 (2023).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1380_CR7","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1109\/TIT.2021.3125933","volume":"68","author":"B Gong","year":"2022","unstructured":"Gong B., Ding C., Li C.: The dual codes of several classes of BCH codes. IEEE Trans. Inf. Theory 68(2), 953\u2013964 (2022).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1380_CR8","first-page":"24","volume":"6","author":"VD Goppa","year":"1970","unstructured":"Goppa V.D.: A new class of linear error-correcting codes. Probl. Peredachi Inf. 6, 24\u201330 (1970).","journal-title":"Probl. Peredachi Inf."},{"key":"1380_CR9","unstructured":"Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de"},{"key":"1380_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s12095-019-00387-1","volume":"12","author":"G Guo","year":"2020","unstructured":"Guo G., Li R., Liu Y., Wang J.: A family of negacyclic BCH codes of length $$n=\\frac{q^{2m}-1}{2}$$. Cryptogr. Commun. 12, 187\u2013203 (2020).","journal-title":"Cryptogr. Commun."},{"key":"1380_CR11","doi-asserted-by":"publisher","first-page":"1850059","DOI":"10.1142\/S0219749918500594","volume":"16","author":"X Kai","year":"2018","unstructured":"Kai X., Li P., Zhu S.: Construction of quantum negacyclic BCH codes. Int. J. Quantum Inf. 16, 1850059 (2018).","journal-title":"Int. J. Quantum Inf."},{"issue":"1","key":"1380_CR12","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1109\/18.746798","volume":"45","author":"I Krasikov","year":"1999","unstructured":"Krasikov I., Litsyn S.: On the distance distribution of duals of BCH codes. IEEE Trans. Inf. Theory 45(1), 247\u2013250 (1999).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1380_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/A:1011220817609","volume":"23","author":"I Krasikov","year":"2001","unstructured":"Krasikov I., Litsyn S.: On the distance distributions of BCH codes and their duals. Des. Codes Cryptogr. 23(2), 223\u2013232 (2001).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"1380_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"},{"key":"1380_CR15","doi-asserted-by":"publisher","first-page":"1910","DOI":"10.1016\/j.disc.2017.04.001","volume":"340","author":"H Liu","year":"2017","unstructured":"Liu H., Ding C., Li C.: Dimensions of three types of BCH codes over GF(q). Discret. Math. 340, 1910\u20131927 (2017).","journal-title":"Discret. Math."},{"key":"1380_CR16","volume-title":"The Theory Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory Error-Correcting Codes. North-Holland, Amsterdam (1977)."},{"key":"1380_CR17","unstructured":"Sun Z., Ding C.: Several families of ternary negacyclic codes and their duals (2023). arXiv:2301.09783v2"},{"key":"1380_CR18","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."},{"key":"1380_CR19","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/s11128-019-2572-3","volume":"19","author":"J Wang","year":"2020","unstructured":"Wang J., Li R., Liu Y., Guo G.: Some negacyclic BCH codes and quantum codes. Quantum Inf. Process. 19, 74 (2020).","journal-title":"Quantum Inf. Process."},{"key":"1380_CR20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3310193","author":"X Wang","year":"2023","unstructured":"Wang X., Wang J., Li C., Wu Y.: Two classes of narrow-sense BCH codes and their duals. IEEE Trans. Inf. Theory (2023). https:\/\/doi.org\/10.1109\/TIT.2023.3310193.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1380_CR21","doi-asserted-by":"publisher","first-page":"2395","DOI":"10.1007\/s10623-023-01208-6","volume":"91","author":"X Wang","year":"2023","unstructured":"Wang X., Sun Z., Ding C.: Two families of negacyclic BCH codes. Des. Codes Cryptogr. 91, 2395\u20132420 (2023).","journal-title":"Des. Codes Cryptogr."},{"key":"1380_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2019.101581","volume":"60","author":"P Wu","year":"2019","unstructured":"Wu P., Li C., Peng W.: On some cyclic codes of length $$\\frac{q^{2m}-1}{q+1}$$. Finite Fields Appl. 60, 101581 (2019).","journal-title":"Finite Fields Appl."},{"key":"1380_CR23","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.ffa.2018.09.006","volume":"55","author":"Y Zhou","year":"2019","unstructured":"Zhou Y., Kai X., Zhu S., Li J.: On the minimum distance of negacyclic codes with two zeros. Finite Fields Appl. 55, 134\u2013150 (2019).","journal-title":"Finite Fields Appl."},{"issue":"10","key":"1380_CR24","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."},{"issue":"4","key":"1380_CR25","first-page":"29","volume":"22","author":"VA Zinoviev","year":"1986","unstructured":"Zinoviev V.A., Litsyn S.N.: On the dual distance of BCH codes. Probl. Peredachi Inf. 22(4), 29\u201334 (1986).","journal-title":"Probl. Peredachi Inf."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01380-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01380-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01380-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T17:08:14Z","timestamp":1719248894000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01380-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,19]]},"references-count":25,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["1380"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01380-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,19]]},"assertion":[{"value":"13 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2024","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 conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}