{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:55:48Z","timestamp":1747191348421,"version":"3.40.5"},"reference-count":28,"publisher":"Wiley","license":[{"start":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T00:00:00Z","timestamp":1698451200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"University of Kerala","award":["9E-C-3330"],"award-info":[{"award-number":["9E-C-3330"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Electrical and Computer Engineering"],"published-print":{"date-parts":[[2023,10,28]]},"abstract":"<jats:p>Rank distance codes are known to be applicable in various applications such as distributed data storage, cryptography, space time coding, and mainly in network coding. Rank distance codes defined over finite fields have attracted considerable attention in recent years. However, in some scenarios where codes over finite fields are not sufficient, it is demonstrated that codes defined over the real number field are preferred. In this paper, we proposed a new class of rank distance codes over the real number field <jats:inline-formula>\n                     <a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\">\n                        <a:mi mathvariant=\"double-struck\">R<\/a:mi>\n                     <\/a:math>\n                  <\/jats:inline-formula>. The real array rank distance (RARD) codes we constructed here can be used for all the applications mentioned above whenever the code alphabet is the real field <jats:inline-formula>\n                     <d:math xmlns:d=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\">\n                        <d:mi mathvariant=\"double-struck\">R<\/d:mi>\n                     <\/d:math>\n                  <\/jats:inline-formula>. From the class of RARD codes, we extract a subclass of equidistant constant rank codes which is applicable in network coding. Also, we determined an upper bound for the dimension of RARD codes leading the way to obtain some optimal RARD codes. Moreover, we established examples of some RARD codes and optimal RARD codes.<\/jats:p>","DOI":"10.1155\/2023\/9952813","type":"journal-article","created":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T20:05:07Z","timestamp":1698523507000},"page":"1-9","source":"Crossref","is-referenced-by-count":1,"title":["Construction of a Class of Real Array Rank Distance Codes"],"prefix":"10.1155","volume":"2023","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7847-5597","authenticated-orcid":true,"given":"N. Suresh","family":"Babu","sequence":"first","affiliation":[{"name":"Department of Mathematics, University College, University of Kerala, Thiruvananthapuram, Pin 695034, Kerala, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1257-7558","authenticated-orcid":true,"given":"B.","family":"Ravivarma","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University College, University of Kerala, Thiruvananthapuram, Pin 695034, Kerala, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0894-8472","authenticated-orcid":true,"given":"E. M.","family":"Elsayed","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Science, King AbdulAziz University, P.O. Box 80203, Jeddah 21589, Saudi Arabia"},{"name":"Department of Mathematics, Faculty of Science, Mansoura University, Mansoura 35516, Egypt"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3596-7428","authenticated-orcid":true,"given":"K. G.","family":"Sreekumar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Kerala, Thiruvananthapuram, Pin 695034, India"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-70293-3","volume-title":"Network Coding and Subspace Designs","author":"M. Greferath","year":"2018"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/3905094"},{"key":"4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511755279","volume-title":"Coding Theory: A First Course","author":"S. Ling","year":"2004"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/3076517"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"volume-title":"Introduction to Coding Theory","year":"1998","author":"L. Van","key":"7"},{"article-title":"Rank codes","year":"2021","author":"E. M. Gabidulin","key":"8"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1155\/2011\/857847"},{"first-page":"1","article-title":"Multishot codes for network coding using rank-metric codes","author":"R. W. N\u00f3brega","key":"10"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2015.2480848"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2010.2090212"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/jsac.1984.1146063"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2020.3029396"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/26.387423"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1137\/0613023"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2004.839491"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/tc.1984.1676475"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(88)90027-5"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/12.54836"},{"key":"21","unstructured":"BabuN. S.Studies on rank distance codes1995Chennai, IndiaIIT MadrasPh. D Dissertation"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2009.04.012"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1561\/0100000119"},{"key":"24","first-page":"227","article-title":"Rank-metric codes","volume-title":"Concise Encyclopedia of Coding Theory","author":"E. Gorla","year":"2021"},{"article-title":"Rank distance bicodes and their generalization, Swedish Physics Archive(Book)","year":"2010","author":"Vasantha Kandasamy","key":"25"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2008.928291"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.01.024"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1017\/s030821050003064x"}],"container-title":["Journal of Electrical and Computer Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2023\/9952813.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2023\/9952813.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2023\/9952813.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,11]],"date-time":"2023-11-11T04:57:19Z","timestamp":1699678639000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/jece\/2023\/9952813\/"}},"subtitle":[],"editor":[{"given":"Islam","family":"Abdellah","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2023,10,28]]},"references-count":28,"alternative-id":["9952813","9952813"],"URL":"https:\/\/doi.org\/10.1155\/2023\/9952813","relation":{},"ISSN":["2090-0155","2090-0147"],"issn-type":[{"type":"electronic","value":"2090-0155"},{"type":"print","value":"2090-0147"}],"subject":[],"published":{"date-parts":[[2023,10,28]]}}}