{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:55:47Z","timestamp":1742928947050,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811668890"},{"type":"electronic","value":"9789811668906"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-16-6890-6_49","type":"book-chapter","created":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T14:02:28Z","timestamp":1646488948000},"page":"673-687","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Application of\u00a0$$\\mathscr {T}$$-Direct Codes in\u00a0Multiple-Rate Codes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6917-9112","authenticated-orcid":false,"given":"Ashwini","family":"Kumar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8625-0462","authenticated-orcid":false,"given":"R. S.","family":"Raja Durai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,6]]},"reference":[{"issue":"1\u20132","key":"49_CR1","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s12190-017-1155-7","volume":"58","author":"A Boripan","year":"2018","unstructured":"Boripan A, Jitman S, Udomkavanich P (2018) Characterization and enumeration of complementary dual abelian codes. J Appl Math Comput 58(1\u20132):527\u2013544","journal-title":"J Appl Math Comput"},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1137\/0209059","volume":"9","author":"A Lempel","year":"1980","unstructured":"Lempel A, Seroussi G (1980) Factorization of symmetric matrices and trace-orthogonal bases in finite fields. SIAM J Comput 9:758\u2013767","journal-title":"SIAM J Comput"},{"key":"49_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0401021","volume":"1","author":"A Lempel","year":"1988","unstructured":"Lempel A, Weinberger M (1988) Self-complementary normal bases in finite fields. SIAM J Discret Math 1:193\u2013198","journal-title":"SIAM J Discret Math"},{"key":"49_CR4","doi-asserted-by":"publisher","first-page":"1220","DOI":"10.1109\/18.86978","volume":"37","author":"A Lempel","year":"1991","unstructured":"Lempel A, Seroussi G (1991) Explicit formulas for self-complementary normal bases in certain finite fields. IEEE Trans Inf Theory 37:1220\u20131222","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"49_CR5","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 (2016) Complementary dual codes for countermeasures to side-channel attacks. Adv Math Commun 10(1):131\u2013150","journal-title":"Adv Math Commun"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Jungnickel D, Menezes AJ, Vanstone SA (1990) On the number of self-dual bases of $$\\mathbf{GF}(q^m)$$ over $$\\mathbf{GF}(q)$$. Proc Am Math Soc 109:23\u201329","DOI":"10.1090\/S0002-9939-1990-1007501-X"},{"key":"49_CR7","first-page":"1","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin EM (1985) Theory of codes with maximum rank distance. Probl Inf Transm 21:1\u201312","journal-title":"Probl Inf Transm"},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"Bringer J, Carlet C, Chabanne H, Guilley S, Maghrebi H (2014) Orthogonal direct sum masking: a smartcard friendly computation paradigm in a code, with built-in protection against side-channel and fault attacks. In: Information security theory and practice international workshop 8501 (LNCS, 2014), vol 8501, pp\u00a040\u201356","DOI":"10.1007\/978-3-662-43826-8_4"},{"issue":"3","key":"49_CR9","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/S0019-9958(64)90438-3","volume":"7","author":"JL Massey","year":"1964","unstructured":"Massey JL (1964) Reversible codes. Inf Control 7(3):369\u2013380","journal-title":"Inf Control"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Massey JL (1992) Linear codes with complementary duals. Discret Math 106 and 107:337\u2013342","DOI":"10.1016\/0012-365X(92)90563-U"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Gadouleau M, Yan Z (2008) On the decoder error probability of bounded rank-distance decoders for maximum rank distance codes. IEEE Trans Inf Theory 54:3202\u20133206","DOI":"10.1109\/TIT.2008.924697"},{"key":"49_CR12","doi-asserted-by":"publisher","first-page":"3873","DOI":"10.1109\/TIT.2008.928284","volume":"54","author":"M Gadouleau","year":"2008","unstructured":"Gadouleau M, Yan Z (2008) Packing and covering properties of rank metric codes. IEEE Trans Inf Theory 54:3873\u20133883","journal-title":"IEEE Trans Inf Theory"},{"key":"49_CR13","doi-asserted-by":"publisher","first-page":"5479","DOI":"10.1109\/TIT.2009.2032817","volume":"55","author":"D Silva","year":"2009","unstructured":"Silva D, Kschishang FR (2009) On metrics for error correction in network coding. IEEE Trans Inf Theory 55:5479\u20135490","journal-title":"IEEE Trans Inf Theory"},{"key":"49_CR14","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TIT.2010.2090212","volume":"57","author":"D Silva","year":"2011","unstructured":"Silva D, Kschischang FR (2011) Universal secure network coding via rank-metric codes. IEEE Trans Inf Theory 57:1124\u20131135","journal-title":"IEEE Trans Inf Theory"},{"key":"49_CR15","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.disc.2004.05.005","volume":"285","author":"M Sendrier","year":"2004","unstructured":"Sendrier M (2004) Linear codes with complementary duals meet the Gilbert-Varshamov bound. Discret Math 285:345\u2013347","journal-title":"Discret Math"},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"Shi M, Daitao H (2018) On LCD MRD codes. IEICE Trans Fundam E101-A(9):1599\u20131602","DOI":"10.1587\/transfun.E101.A.1599"},{"key":"49_CR17","unstructured":"Devi M (2013) On the class of $$\\cal{T}$$-Direct codes: constructions, properties and applications. Ph.D. dessertation, Department of Mathematics, Jaypee University of Information Technology, India. http:\/\/hdl.handle.net\/10603\/35221"},{"key":"49_CR18","unstructured":"Loidreau P (2008) Properties of codes in rank metric. In: Proceedings of the eleventh international workshop on algebraic and combinatorial coding theory. Bulgaria, pp\u00a0192\u2013198"},{"key":"49_CR19","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/18.75248","volume":"37","author":"RM Roth","year":"1991","unstructured":"Roth RM (1991) Maximum-rank array codes and their application to crisscross error correction. IEEE Trans Inf Theory 37:328\u2013336","journal-title":"IEEE Trans Inf Theory"},{"key":"49_CR20","unstructured":"Kandasamy WBV, Smarandache F, Sujatha R, Raja Durai RS (2012) Erasure techniques in MRD codes. ZIP Publishing, Columbus, OH"},{"key":"49_CR21","doi-asserted-by":"crossref","unstructured":"Tse D, Viswanath P (2005) Fundamentals of wireless communication. Cambridge University Press, Cambridge, U.K","DOI":"10.1017\/CBO9780511807213"},{"key":"49_CR22","unstructured":"Raja Durai RS (2004) On linear codes with rank metric: constructions, properties, and applications. Ph.D. dessertation, Department of Mathemtics, Indian Institute of Technology\u2014Chennai, India"},{"key":"49_CR23","unstructured":"Raja Durai RS, Devi M (2013) On the class of $$\\cal{T}$$-Direct codes over $$\\mathbf{GF}(2^{\\cal{N}})$$. Int J Comput Inf Syst Ind Manag Appl 5:589\u2013596"},{"key":"49_CR24","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming RW (1950) Error detecting and error correcting codes. Bell Syst Tech J 29:147\u2013160","journal-title":"Bell Syst Tech J"},{"key":"49_CR25","unstructured":"Bhasin S, Danger, J-L, Guilley S, Najm Z, Ngo XT (2015) Linear complementary dual code improvement to strengthen encoded circuit against hardware Trojan horses. IEEE Int Symp Hardw Oriented Secur Trust 82\u201387"},{"key":"49_CR26","unstructured":"Vasantha WB, Raja Durai RS (2002) $$\\cal{T}$$-Direct codes: an application to $$\\cal{T}$$-user BAC. In: Proceedings of IEEE information theory workshop. Bangalore, p 214"},{"issue":"1\u20133","key":"49_CR27","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 JL (1994) The condition for a cyclic code to have a complementary dual. Discret Math 126(1\u20133):391\u2013393","journal-title":"Discret Math"},{"key":"49_CR28","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 (2018) Galois LCD codes over finite fields. Finite Fields Their Appl 49:227\u2013242","journal-title":"Finite Fields Their Appl"},{"issue":"1\u20132","key":"49_CR29","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s12190-019-01254-1","volume":"61","author":"X Liu","year":"2019","unstructured":"Liu X, Liu H (2019) Rank-metric complementary dual codes. J Appl Math Comput 61(1\u20132):281\u2013295","journal-title":"J Appl Math Comput"},{"key":"49_CR30","doi-asserted-by":"publisher","unstructured":"Raja Durai RS, Devi M, Kumar A (2020) Multiple-rate error-correcting coding scheme. Appl Algebr Eng, Commun Comput. https:\/\/doi.org\/10.1007\/s00200-020-00435-x","DOI":"10.1007\/s00200-020-00435-x"},{"key":"49_CR31","doi-asserted-by":"publisher","unstructured":"Devi M, Raja Durai RS, Kumar A, Hongjun Xu H Some important results on $$\\cal{T}$$-Direct codes. Discret Math, Algorithms Appl https:\/\/doi.org\/10.1142\/S1793830921500671","DOI":"10.1142\/S1793830921500671"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Seventh International Conference on Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-6890-6_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T14:08:30Z","timestamp":1646489310000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-6890-6_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811668890","9789811668906"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-6890-6_49","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}