{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T21:29:10Z","timestamp":1781213350245,"version":"3.54.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T00:00:00Z","timestamp":1562803200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T00:00:00Z","timestamp":1562803200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010909","name":"Young Scientists Fund","doi-asserted-by":"publisher","award":["11601475"],"award-info":[{"award-number":["11601475"]}],"id":[{"id":"10.13039\/501100010909","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772015"],"award-info":[{"award-number":["61772015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s12095-019-00385-3","type":"journal-article","created":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T13:14:28Z","timestamp":1562850868000},"page":"147-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Designed distances and parameters of new LCD BCH codes over finite fields"],"prefix":"10.1007","volume":"12","author":[{"given":"Fengwei","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qin","family":"Yue","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yansheng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,7,11]]},"reference":[{"issue":"3","key":"385_CR1","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1109\/TIT.2006.890730","volume":"53","author":"SA Aly","year":"2007","unstructured":"Aly, S.A., Klappenecker, A., Sarvepalli, P.K.: On quantum and classical BCH codes. IEEE Trans. Inf. Theory 53(3), 1183\u20131188 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"385_CR2","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1109\/18.50397","volume":"36","author":"P Charpin","year":"1990","unstructured":"Charpin, P.: On a class of primitive BCH-codes. IEEE Trans. Inf. Theory 36(1), 222\u2013228 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"385_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.3934\/amc.2016.10.131","volume":"10","author":"C Carlet","year":"2016","unstructured":"Carlet, C., Guilley, S.: Complementary dual codes for counter-measures to side-channel attacks. Adv. Math. Commun. 10, 131\u2013150 (2016)","journal-title":"Adv. Math. Commun."},{"issue":"10","key":"385_CR4","doi-asserted-by":"publisher","first-page":"5322","DOI":"10.1109\/TIT.2015.2470251","volume":"61","author":"C Ding","year":"2015","unstructured":"Ding, C.: Parameters of several classes of BCH codes. IEEE Trans. Inf. Theory 61(10), 5322\u20135330 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"385_CR5","doi-asserted-by":"publisher","first-page":"2351","DOI":"10.1109\/TIT.2015.2409838","volume":"61","author":"C Ding","year":"2015","unstructured":"Ding, C., Du, X., Zhou, Z.: The Bose and minimum distance of a class of BCH codes. IEEE Trans. Inf. Theory 61(5), 2351\u20132356 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"385_CR6","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1504\/IJICOT.2017.083827","volume":"4","author":"ST Dougherty","year":"2017","unstructured":"Dougherty, S.T., Kim, J. -L., \u00d6Zkaya, B., Sok, L., Sol\u00e8, P.: The combinatorics of LCD codes: Linear Programming bound and orthogonal matrices. Int. J. Inf. Coding Theory 4, 116\u2013128 (2017)","journal-title":"Int. J. Inf. Coding Theory"},{"issue":"3","key":"385_CR7","first-page":"216","volume":"13","author":"Y Dianwu","year":"1996","unstructured":"Dianwu, Y., Zhengming, H.: On the dimension and minimum distance of BCH codes over GF(q). J. Electron. 13(3), 216\u2013221 (1996)","journal-title":"J. Electron."},{"key":"385_CR8","doi-asserted-by":"crossref","unstructured":"Hou, X., Oggier, F.: On LCD codes and lattices. In: Proceedings of IEEE Int. Symp. Inf. Theory, pp. 1501\u20131505 (2016)","DOI":"10.1109\/ISIT.2016.7541549"},{"key":"385_CR9","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":"7","key":"385_CR10","doi-asserted-by":"publisher","first-page":"4344","DOI":"10.1109\/TIT.2017.2672961","volume":"63","author":"C Li","year":"2017","unstructured":"Li, C., Ding, C., Li, S.: LCD Cyclic codes over finite field. IEEE Trans. Inf. Theory 63(7), 4344\u20134356 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"385_CR11","first-page":"5699","volume":"63","author":"S Li","year":"2017","unstructured":"Li, S., Li, C., Ding, C.: Two Families of LCD BCH codes. IEEE Trans. Inf. Theory 63(9), 5699\u20135717 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"385_CR12","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). Discrete Math. 340, 1910\u20131927 (2017)","journal-title":"Discrete Math."},{"issue":"3","key":"385_CR13","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/S0019-9958(64)90438-3","volume":"7","author":"JL Massey","year":"1964","unstructured":"Massey, J.L.: Reversible codes. Inf. Control. 7(3), 369\u2013380 (1964)","journal-title":"Inf. Control."},{"issue":"\/107","key":"385_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0012-365X(92)90563-U","volume":"106","author":"JL Massey","year":"1992","unstructured":"Massey, J.L.: Linear codes with complementary duals. Discrete Math. 106(\/107), 337\u2013342 (1992)","journal-title":"Discrete Math."},{"key":"385_CR15","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. Elsevier, North- Holland (1977)"},{"key":"385_CR16","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.disc.2004.05.005","volume":"285","author":"N Sendrier","year":"2004","unstructured":"Sendrier, N.: Linear codes with complementary duals meet the Gilbert-Varshamov bound. Discret. Math. 285, 345\u2013347 (2004)","journal-title":"Discret. Math."},{"key":"385_CR17","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1970.1054517","volume":"16","author":"KK Tzeng","year":"1970","unstructured":"Tzeng, K.K., Hartmann, C.R.P.: On the minimum distance of certain reversible cyclic codes. IEEE Trans. Inf. Theory 16, 644\u2013646 (1970)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"385_CR18","doi-asserted-by":"publisher","first-page":"579","DOI":"10.3934\/amc.2018034","volume":"12","author":"H Yan","year":"2018","unstructured":"Yan, H., Liu, H., Li, C., Yang, S.: Parameters of LCD BCH codes with two lengths. Adv. Math. Commun. 12(3), 579\u2013594 (2018)","journal-title":"Adv. Math. Commun."},{"key":"385_CR19","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0012-365X(94)90283-6","volume":"126","author":"X Yang","year":"1994","unstructured":"Yang, X., Massey, J.L.: The condition for a cyclic code to have a complementary dual. Discret. Math. 126, 391\u2013393 (1994)","journal-title":"Discret. Math."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-019-00385-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-019-00385-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-019-00385-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T00:17:36Z","timestamp":1594340256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-019-00385-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,11]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["385"],"URL":"https:\/\/doi.org\/10.1007\/s12095-019-00385-3","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,11]]},"assertion":[{"value":"18 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}