{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T22:55:32Z","timestamp":1770072932862,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T00:00:00Z","timestamp":1553212800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003819","name":"Natural Science Foundation of Hubei Province","doi-asserted-by":"publisher","award":["Q20174503"],"award-info":[{"award-number":["Q20174503"]}],"id":[{"id":"10.13039\/501100003819","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s12190-019-01254-1","type":"journal-article","created":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T14:03:41Z","timestamp":1553263421000},"page":"281-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Rank-metric complementary dual codes"],"prefix":"10.1007","volume":"61","author":[{"given":"Xiusheng","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hualu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,22]]},"reference":[{"key":"1254_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0012-365X(92)90563-U","volume":"106\/107","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":"1254_CR2","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-662-43826-8_4","volume-title":"Information Security Theory and Practice. Securing the Internet of Things","author":"Julien Bringer","year":"2014","unstructured":"Bringer, J., Carlet, C., Chabanne, H., Guilley, S., Maghrebi, H.: Orthogonal direct sum masking, a smartcard friendly computation paradigm in a code, with builtin protection against side-channel and fault attacks. In: Proceedings of WISTP 2014. Lecture Notes in Computer Science, vol. 8501, pp. 40\u201356 (2014)"},{"key":"1254_CR3","doi-asserted-by":"crossref","unstructured":"Carlet, C., Guilley, S.: Complementary dual codes for counter-measures to side-channel attacks. In: Post-Proceedings of the 4th International Castle Meeting, Palmela Castle, Portugal, September 15\u201318, 2014, Published by the Journal Advances in Mathematics of Communications (AMC), vol. 10(1), pp. 131\u2013150 (2016)","DOI":"10.3934\/amc.2016.10.131"},{"key":"1254_CR4","doi-asserted-by":"crossref","unstructured":"Carlet, C., Guilley, S.: Complementary dual codes for counter-measures to side-channel attacks. In: Proceedings of the 4th ICMCTA Meeting. Palmela, Portugal (2014)","DOI":"10.1007\/978-3-319-17296-5_9"},{"key":"1254_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0330-z","author":"K Guenda","year":"2017","unstructured":"Guenda, K., Jitman, S., Gulliver, T.A.: Constructions of good entanglement-assisted quantum error correcting codes. Des. Codes Cryptogr. (2017). \n                    https:\/\/doi.org\/10.1007\/s10623-017-0330-z","journal-title":"Des. Codes Cryptogr."},{"key":"1254_CR6","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. Discrete Math. 126, 391\u2013393 (1994)","journal-title":"Discrete Math."},{"key":"1254_CR7","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.disc.2004.05.005","volume":"304","author":"N Sendrier","year":"2004","unstructured":"Sendrier, N.: Linear codes with complementary duals meet the Gilbert\u2013Varshamov bound. Discrete Math. 304, 345\u2013347 (2004)","journal-title":"Discrete Math."},{"key":"1254_CR8","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.ffa.2009.01.002","volume":"15","author":"M Esmaeili","year":"2009","unstructured":"Esmaeili, M., Yari, S.: On complementary-daul quasi-cyclic codes. Finite Field Appl. 15, 357\u2013386 (2009)","journal-title":"Finite Field Appl."},{"key":"1254_CR9","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., Ozkaya, B., Sok, L., Sol\u00e9, 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":"7","key":"1254_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 fields. IEEE Trans. Inf. Theory 63(7), 4344\u20134356 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1254_CR11","unstructured":"Li, C., Ding, C., Liu, H.: Parameters of two clesses of LCD BCH codes, (2016). \n                    arXiv:1608.02670"},{"key":"1254_CR12","unstructured":"Li, C., Ding, C., Liu, H.: A family of reversible BCH codes, (2016). \n                    arXiv:1608.02169"},{"key":"1254_CR13","unstructured":"Boonniyoma, K., Jitman, S.: Complementary daul subfield linear codes over finite fields, (2016). \n                    arXiv:1605.06827"},{"key":"1254_CR14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2645759","author":"L Jin","year":"2016","unstructured":"Jin, L.: Construction of MDS codes with complementary duals. IEEE Trans. Inf. Theory (2016). \n                    https:\/\/doi.org\/10.1109\/TIT.2016.2645759","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1254_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0463-8","author":"C Carlet","year":"2018","unstructured":"Carlet, C., Mesnager, S., Tang, C., Qi, Y.: Euclidean and Hermitian LCD MDS codes. Des. Codes Cryptogr. (2018). \n                    https:\/\/doi.org\/10.1007\/s10623-018-0463-8","journal-title":"Des. Codes Cryptogr."},{"key":"1254_CR16","unstructured":"Chen, B., Liu, H.: New constructions of MDS codes with complementary duals, (2017). \n                    arXiv:1702.07831v1"},{"key":"1254_CR17","unstructured":"Sari, M., K\u00f6ro\u01e7lu: On MDS negacyclic LCD codes, (2016). \n                    arXiv:1611.06371"},{"key":"1254_CR18","unstructured":"Zhu, S., Pang, B., Sun, Z.: The reversible negacyclic codes over finite fields, (2016). \n                    arXiv:1610.08206"},{"key":"1254_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0437-2","author":"J Cruz de la","year":"2017","unstructured":"de la Cruz, J., Willems, W.: A note on group codes with complementary duals. Des. Codes Cryptogr. (2017). \n                    https:\/\/doi.org\/10.1007\/s10623-017-0437-2","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"1254_CR20","doi-asserted-by":"publisher","first-page":"2390","DOI":"10.1109\/TIT.2017.2766075","volume":"64","author":"S Mesnager","year":"2018","unstructured":"Mesnager, S., Tang, C., Qi, Y.: Complementary dual algebraic geometry codes. IEEE Trans. Inf. Theory 64(4), 2390\u20132397 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1254_CR21","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.ffa.2017.10.001","volume":"49","author":"X Liu","year":"2018","unstructured":"Liu, X., Fan, Y., Liu, H.: Galois LCD codes over finite fields. Finite Field Appl. 49, 227\u2013242 (2018)","journal-title":"Finite Field Appl."},{"key":"1254_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ffa.2015.01.004","volume":"15","author":"X Liu","year":"2015","unstructured":"Liu, X., Liu, H.: LCD codes over finite chain rings. Finite Field Appl. 15, 1\u201319 (2015)","journal-title":"Finite Field Appl."},{"key":"1254_CR23","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P Delsarte","year":"1978","unstructured":"Delsarte, P.: Bilinear forms over a finite field, with applications to coding theorey. J. Combin. Theory Ser. A 25, 226\u2013241 (1978)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1254_CR24","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R K\u00f6tter","year":"2008","unstructured":"K\u00f6tter, R., Kschischang, F.R.: Coding for erroes and erasures in randon network coding. IEEE Trans. Inf. Theory 54, 3579\u20133591 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1254_CR25","doi-asserted-by":"publisher","first-page":"5479","DOI":"10.1109\/TIT.2009.2032817","volume":"55","author":"D Silva","year":"2009","unstructured":"Silva, D., Kschischang, F.R.: On metris for error correction in network coding. IEEE Trans. Inf. Theory 55(12), 5479\u20135490 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1254_CR26","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TIT.2010.2090212","volume":"57","author":"D Silva","year":"2011","unstructured":"Silva, D., Kschischang, F.R.: Universal secure network coding via rank-metric codes. IEEE Trans. Inf. Theory 57(2), 1124\u20131135 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1254_CR27","first-page":"1","volume":"1","author":"E Gabidulin","year":"1985","unstructured":"Gabidulin, E.: Theory of codes with maximum rank distance. Probl. Inf. Trans. 1(2), 1\u201312 (1985)","journal-title":"Probl. Inf. Trans."},{"key":"1254_CR28","unstructured":"Durai Raja, R.S.: On linear codes with rank metric: constructions, properties, and applications. Ph.D. Dessertation, Department of Mathematics, Indian Institute of Technology-Chennai, India (May 2004)"},{"key":"1254_CR29","unstructured":"Devi, M.: On the class of T-direct codes: constructions, properties and applications. Ph.D. Dessertation, Department of Mathematics, Jaypee University of Information Technology, India, (August 2013)"},{"key":"1254_CR30","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.dam.2005.03.012","volume":"154","author":"E Gabidulin","year":"2006","unstructured":"Gabidulin, E., Pilipchuk, N.I.: Symmetric matrices and codes correcting rank error beyond the \n                    \n                      \n                    \n                    $$\\lfloor \\frac{d-1}{2}\\rfloor $$\n                    \n                      \n                        \n                          \u230a\n                          \n                            \n                              d\n                              -\n                              1\n                            \n                            2\n                          \n                          \u230b\n                        \n                      \n                    \n                   bound. Discrete Appl. Math. 154, 305\u2013312 (2006)","journal-title":"Discrete Appl. Math."},{"key":"1254_CR31","first-page":"589","volume":"5","author":"RS Raja Durai","year":"2013","unstructured":"Raja Durai, R.S., Devi, M.: On the class of \n                    \n                      \n                    \n                    $$\\cal{T}$$\n                    \n                      \n                        T\n                      \n                    \n                  -direct codes over \n                    \n                      \n                    \n                    $$GF(2^N)$$\n                    \n                      \n                        \n                          G\n                          F\n                          (\n                          \n                            2\n                            N\n                          \n                          )\n                        \n                      \n                    \n                  . Int. J. Comput. Inf. Syst. Ind. Manag. Appl. 5, 589\u2013596 (2013)","journal-title":"Int. J. Comput. Inf. Syst. Ind. Manag. Appl."},{"issue":"2","key":"1254_CR32","first-page":"2105","volume":"1","author":"A Kshevelskiy","year":"2005","unstructured":"Kshevelskiy, A., Gabidulin, E.: The new construction of rank code. Probl. Inf. Trans. 1(2), 2105\u20132108 (2005)","journal-title":"Probl. Inf. Trans."},{"key":"1254_CR33","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10623-015-0077-3","volume":"80","author":"A Ravagnani","year":"2016","unstructured":"Ravagnani, A.: Rank-metric codes and their duality theory. Des. Codes Cryptogr. 80, 179\u2013216 (2016)","journal-title":"Des. Codes Cryptogr."},{"key":"1254_CR34","volume-title":"The theory of Error-Correcting Codes, North Holland Mathematical Library","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of Error-Correcting Codes, North Holland Mathematical Library. Elsevier, Amsterdam (1977)"},{"key":"1254_CR35","first-page":"23","volume":"109","author":"D Jungnickel","year":"1990","unstructured":"Jungnickel, D., Menezes, A.J., Vanstone, S.A.: On the number of self-dual bases of \n                    \n                      \n                    \n                    $$GF(q^m)$$\n                    \n                      \n                        \n                          G\n                          F\n                          (\n                          \n                            q\n                            m\n                          \n                          )\n                        \n                      \n                    \n                   over \n                    \n                      \n                    \n                    $$GF(q)$$\n                    \n                      \n                        \n                          G\n                          F\n                          (\n                          q\n                          )\n                        \n                      \n                    \n                  . Proc. Am. Math. Soc. 109, 23\u201329 (1990)","journal-title":"Proc. Am. Math. Soc."},{"key":"1254_CR36","unstructured":"Raja Durai, R.S.: On Linear Codes with Rank Metric: Constructions, Properties, and Applications. Ph.D. Dessertation, Department of Mathematics, Indian Institute of Technology-Chennai, India (May 2004)"},{"key":"1254_CR37","doi-asserted-by":"crossref","unstructured":"Gadouleau, M., Yan, Z.: Properies of codes with the rank metric. In: IEEE Global Telecommunications Conference, New York. GLOBECOM 06, pp. 1\u20135 (2006)","DOI":"10.1109\/GLOCOM.2006.173"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-019-01254-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12190-019-01254-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-019-01254-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,21]],"date-time":"2020-03-21T00:14:09Z","timestamp":1584749649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12190-019-01254-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,22]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["1254"],"URL":"https:\/\/doi.org\/10.1007\/s12190-019-01254-1","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,22]]},"assertion":[{"value":"8 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}