{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T20:41:53Z","timestamp":1778100113767,"version":"3.51.4"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,9,26]],"date-time":"2023-09-26T00:00:00Z","timestamp":1695686400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,26]],"date-time":"2023-09-26T00:00:00Z","timestamp":1695686400000},"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":["12071138"],"award-info":[{"award-number":["12071138"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["22ZR1419600"],"award-info":[{"award-number":["22ZR1419600"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Innovation Program of Shanghai Municipal Education Commission","award":["2021-01-07-00-08-E00101"],"award-info":[{"award-number":["2021-01-07-00-08-E00101"]}]},{"name":"Shanghai International Joint Lab of Trustworthy Intelligent Software","award":["22510750100"],"award-info":[{"award-number":["22510750100"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10623-023-01285-7","type":"journal-article","created":{"date-parts":[[2023,9,26]],"date-time":"2023-09-26T08:04:04Z","timestamp":1695715444000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Parameters of several families of binary duadic codes and their related codes"],"prefix":"10.1007","volume":"92","author":[{"given":"Hai","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengju","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haifeng","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,26]]},"reference":[{"key":"1285_CR1","first-page":"1269","volume-title":"Handbook Coding Theory","author":"E Assmus","year":"1998","unstructured":"Assmus E., Key J.D.: Polynomial codes and finite geometries. In: Pless V.S., Huffman W.C. (eds.) Handbook Coding Theory, vol. 1, pp. 1269\u20131343. Elsevier, Amsterdam (1998)."},{"issue":"4","key":"1285_CR2","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1109\/TIT.2011.2176915","volume":"58","author":"C Ding","year":"2012","unstructured":"Ding C., Ding C.: Cyclotomic constructions of cyclic codes with length being the product of two primes. IEEE Trans. Inf. Theory 58(4), 2231\u20132236 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1285_CR3","volume-title":"Codes from Difference Sets","author":"C Ding","year":"2018","unstructured":"Ding C.: Codes from Difference Sets. World Scientific, Singapore (2018)."},{"issue":"1","key":"1285_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.3233\/FI-1999-381212","volume":"38","author":"C Ding","year":"1999","unstructured":"Ding C., Lam K., Xing C.: Enumeration and construction of all duadic codes of length $$p^m$$. Fundamenta Informaticae 38(1), 149\u2013161 (1999).","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"1285_CR5","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1109\/18.748995","volume":"45","author":"C Ding","year":"1999","unstructured":"Ding C., Pless V.: Cyclotomy and duadic codes of prime lengths. IEEE Trans. Inf. Theory 45(2), 453\u2013466 (1999).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1285_CR6","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de. Accessed 23 February (2023)."},{"key":"1285_CR7","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":"5","key":"1285_CR8","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1109\/TIT.1984.1056944","volume":"30","author":"J Leon","year":"1984","unstructured":"Leon J., Masley J., Pless V.: Duadic codes. IEEE Trans. Inf. Theory 30(5), 709\u2013714 (1984).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1285_CR9","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/18.21270","volume":"34","author":"J Leon","year":"1988","unstructured":"Leon J.: A probabilistic algorithm for computing minimum weight of large error-correcting codes. IEEE Trans. Inf. Theory 34(5), 1354\u20131359 (1988).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1285_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2023.102270","volume":"91","author":"H Liu","year":"2023","unstructured":"Liu H., Li C., Ding C.: Five infinite families of binary cyclic codes and their related codes with good parameters. Finite Field Appl. 91, 102270 (2023).","journal-title":"Finite Field Appl."},{"key":"1285_CR11","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/0097-3165(87)90056-2","volume":"44","author":"V Pless","year":"1987","unstructured":"Pless V.: On weights in duadic codes. J. Comb. Theory Ser. A 44, 6\u201321 (1987).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"12","key":"1285_CR12","doi-asserted-by":"publisher","first-page":"7842","DOI":"10.1109\/TIT.2022.3193715","volume":"68","author":"C Tang","year":"2022","unstructured":"Tang C., Ding C.: Binary $$[n,(n + 1)\/2]$$ cyclic codes with good minimum distances. IEEE Trans. Inf. Theory 68(12), 7842\u20137849 (2022).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"1285_CR13","doi-asserted-by":"publisher","first-page":"6305","DOI":"10.1109\/TIT.2018.2829763","volume":"64","author":"M Xiong","year":"2018","unstructured":"Xiong M.: On cyclic codes of composite length and the minimum distance. IEEE Trans. Inf. Theory 64(9), 6305\u20136314 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1285_CR14","doi-asserted-by":"publisher","first-page":"5097","DOI":"10.1109\/TIT.2021.3066008","volume":"67","author":"M Xiong","year":"2021","unstructured":"Xiong M., Zhang A.: On cyclic codes of composite length and the minimum distance II. IEEE Trans. Inf. Theory 67(8), 5097\u20135103 (2021).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01285-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01285-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01285-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T18:26:45Z","timestamp":1704997605000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01285-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,26]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1285"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01285-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,26]]},"assertion":[{"value":"2 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}