{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T17:33:35Z","timestamp":1769276015543,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T00:00:00Z","timestamp":1650931200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T00:00:00Z","timestamp":1650931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["247742"],"award-info":[{"award-number":["247742"]}],"id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["311646"],"award-info":[{"award-number":["311646"]}],"id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009448","name":"Universit\u00e0 degli Studi della Campania Luigi Vanvitelli","doi-asserted-by":"publisher","award":["VALERE"],"award-info":[{"award-number":["VALERE"]}],"id":[{"id":"10.13039\/501100009448","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009112","name":"Istituto Nazionale di Alta Matematica \u201dFrancesco Severi\u201d","doi-asserted-by":"publisher","award":["GNSAGA"],"award-info":[{"award-number":["GNSAGA"]}],"id":[{"id":"10.13039\/100009112","id-type":"DOI","asserted-by":"publisher"}]},{"name":"University of Bergen"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2022,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents encoding and decoding algorithms for several families of optimal rank metric codes whose codes are in restricted forms of symmetric, alternating and Hermitian matrices. First, we show the evaluation encoding is the right choice for these codes and then we provide easily reversible encoding methods for each family. Later unique decoding algorithms for the codes are described. The decoding algorithms are interpolation-based and can uniquely correct errors for each code with rank up to \u230a(<jats:italic>d<\/jats:italic>\u2212\u20091)\/2\u230b in polynomial-time, where<jats:italic>d<\/jats:italic>is the minimum distance of the code.<\/jats:p>","DOI":"10.1007\/s12095-022-00578-3","type":"journal-article","created":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T10:03:32Z","timestamp":1650967412000},"page":"1281-1300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Encoding and decoding of several optimal rank metric codes"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3981-7195","authenticated-orcid":false,"given":"Wrya K.","family":"Kadir","sequence":"first","affiliation":[]},{"given":"Chunlei","family":"Li","sequence":"additional","affiliation":[]},{"given":"Ferdinando","family":"Zullo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,26]]},"reference":[{"key":"578_CR1","doi-asserted-by":"publisher","first-page":"38479","DOI":"10.1109\/ACCESS.2021.3064503","volume":"9","author":"J De La Cruz","year":"2021","unstructured":"De La Cruz, J., Evilla, J.R., \u00d6zbudak, F.: Hermitian rank metric codes and duality. IEEE Access 9, 38479\u201338487 (2021)","journal-title":"IEEE Access"},{"issue":"3","key":"578_CR2","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 theory. J. Comb. Theory A 25(3), 226\u2013241 (1978)","journal-title":"J. Comb. Theory A"},{"issue":"1","key":"578_CR3","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/0097-3165(75)90090-4","volume":"19","author":"P Delsarte","year":"1975","unstructured":"Delsarte, P., Goethals, J.-M.: Alternating bilinear forms over GF(q). J. Comb. Theory A 19(1), 26\u201350 (1975)","journal-title":"J. Comb. Theory A"},{"key":"578_CR4","unstructured":"Dickson, L.: Linear Groups, with an Exposition of the Galois Field Theory - Scholar\u2019s Choice Edition. Creative Media Partners LLC (2015)"},{"issue":"1","key":"578_CR5","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin, E.M.: Theory of codes with maximum rank distance. Probl. Peredachi Informatsii 21(1), 3\u201316 (1985)","journal-title":"Probl. Peredachi Informatsii"},{"key":"578_CR6","doi-asserted-by":"crossref","unstructured":"Gabidulin, E.M., Paramonov, A., Tretjakov, O.: Ideals over a non-commutative ring and their application in cryptology. In: Advances in Cryptology \u2013 EUROCRYPT\u201991, pp 482\u2013489. Springer (1991)","DOI":"10.1007\/3-540-46416-6_41"},{"key":"578_CR7","doi-asserted-by":"crossref","unstructured":"Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Ideals over a non-commutative ring and their application in cryptology. In: Davies, D.W. (ed.) Advances in Cryptology \u2013 EUROCRYPT\u201991, pp 482\u2013489. Springer (1991)","DOI":"10.1007\/3-540-46416-6_41"},{"key":"578_CR8","doi-asserted-by":"crossref","unstructured":"Gorla, E., Ravagnani, A.: Codes endowed with the rank metric. In: Network Coding and Subspace Designs, pp 03\u201323. Springer (2018)","DOI":"10.1007\/978-3-319-70293-3_1"},{"key":"578_CR9","doi-asserted-by":"crossref","unstructured":"Kadir, W.K.: New communication models and decoding of maximum rank distance codes. In: 2021 XVII International Symposium \u201cProblems of Redundancy in Information and Control Systems, (REDUNDANCY), pp 125\u2013130 (2021)","DOI":"10.1109\/REDUNDANCY52534.2021.9606451"},{"key":"578_CR10","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1007\/s12095-020-00449-9","volume":"12","author":"WK Kadir","year":"2020","unstructured":"Kadir, W.K., Li, C.: On decoding additive generalized twisted gabidulin codes. Cryptogr. Commun. 12, 987\u20131009 (2020)","journal-title":"Cryptogr. Commun."},{"key":"578_CR11","doi-asserted-by":"crossref","unstructured":"Kadir, W.K., Li, C., Zullo, F.: On interpolation-based decoding of a class of maximum rank distance codes. In: 2021 IEEE International Symposium on Information Theory (ISIT), pp 31\u201336 (2021)","DOI":"10.1109\/ISIT45174.2021.9517980"},{"key":"578_CR12","doi-asserted-by":"crossref","unstructured":"Kshevetskiy, A., Gabidulin, E.: The new construction of rank codes. Proceedings. International Symposium on Information Theory, 2005 (2005)","DOI":"10.1109\/ISIT.2005.1523717"},{"key":"578_CR13","doi-asserted-by":"crossref","unstructured":"Li, C.: Interpolation-based decoding of nonlinear maximum rank distance codes. In: 2019 IEEE International Symposium on Information Theory (ISIT), pp 2054\u20132058 (2019)","DOI":"10.1109\/ISIT.2019.8849472"},{"key":"578_CR14","doi-asserted-by":"crossref","unstructured":"Li, C., Kadir, W.K.: On decoding additive generalized twisted Gabidulin codes. presented at the International Workshop on Coding and Cryptography (WCC) (2019)","DOI":"10.1007\/s12095-020-00449-9"},{"key":"578_CR15","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Encyclopedia of Mathematics and its Applications. Cambridge University Press, 2 edn. (1997)"},{"key":"578_CR16","doi-asserted-by":"crossref","unstructured":"Loidreau, P.: A Welch\u2013Berlekamp like algorithm for decoding Gabidulin codes. In: Ytrehus, \u00d8. (ed.) International Workshop on Coding and Cryptography (WCC), pp 36\u201345. Springer, Berlin, Heidelberg, (2006)","DOI":"10.1007\/11779360_4"},{"issue":"7","key":"578_CR17","doi-asserted-by":"publisher","first-page":"111871","DOI":"10.1016\/j.disc.2020.111871","volume":"343","author":"G Longobardi","year":"2020","unstructured":"Longobardi, G., Lunardon, G., Trombetti, R., Zhou, Y.: Automorphism groups and new constructions of maximum additive rank metric codes with restrictions. Discret. Math. 343(7), 111871 (2020)","journal-title":"Discret. Math."},{"key":"578_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jcta.2018.05.004","volume":"159","author":"G Lunardon","year":"2018","unstructured":"Lunardon, G., Trombetti, R., codes, Y. Zhou.: Generalized twisted Gabidulin. J. Comb. Theory A 159, 79\u2013106 (2018)","journal-title":"J. Comb. Theory A"},{"key":"578_CR19","doi-asserted-by":"crossref","unstructured":"Menichetti, G.: Roots of affine polynomials. In: Barlotti, A., Biliotti, M., Cossu, A., Korchmaros, G., Tallini, G. (eds.) Combinatorics \u201984, volume 123 of North-Holland Mathematics Studies, pp 303\u2013310, North-Holland (1986)","DOI":"10.1016\/S0304-0208(08)73149-9"},{"issue":"1","key":"578_CR20","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1109\/TIT.2016.2622277","volume":"63","author":"K Otal","year":"2017","unstructured":"Otal, K., \u00d6zbudak, F.: Additive rank metric codes. IEEE Trans. Inf. Theory 63(1), 164\u2013168 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"578_CR21","doi-asserted-by":"crossref","unstructured":"Otal, K., \u00d6zbudak, F.: Constructions of cyclic subspace codes and maximum rank distance codes. In: Network Coding and Subspace Designs, pp 43\u201366. Springer (2018)","DOI":"10.1007\/978-3-319-70293-3_3"},{"key":"578_CR22","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.ffa.2017.12.003","volume":"50","author":"K Otal","year":"2018","unstructured":"Otal, K., \u00d6zbudak, F.: Some new non-additive maximum rank distance codes. Finite Fields Appl. 50, 293\u2013303 (2018)","journal-title":"Finite Fields Appl."},{"key":"578_CR23","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.jsc.2017.11.012","volume":"89","author":"S Puchinger","year":"2018","unstructured":"Puchinger, S., Wachter-Zeh, A.: Fast operations on linearized polynomials and their applications in coding theory. J. Symb. Comput. 89, 194\u2013215 (2018)","journal-title":"J. Symb. Comput."},{"key":"578_CR24","unstructured":"Randrianarisoa, T.H.: A decoding algorithm for rank metric codes. arXiv:1712.07060 (2017)"},{"key":"578_CR25","doi-asserted-by":"crossref","unstructured":"Richter, G., Plass, S.: Fast decoding of rank-codes with rank errors and column erasures. In: International Symposium on Information Theory (ISIT), pp 398\u2013398 (2004)","DOI":"10.1109\/ISIT.2004.1365435"},{"key":"578_CR26","doi-asserted-by":"crossref","unstructured":"Rosenthal, J., Randrianarisoa, T.H.: A decoding algorithm for twisted Gabidulin codes. In: International Symposium on Information Theory (ISIT), pp 2771\u20132774. IEEE (2017)","DOI":"10.1109\/ISIT.2017.8007034"},{"issue":"2","key":"578_CR27","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/18.75248","volume":"37","author":"RM Roth","year":"1991","unstructured":"Roth, R.M.: Maximum-rank array codes and their application to crisscross error correction. IEEE Trans. Inf. Theory 37(2), 328\u2013336 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"578_CR28","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1016\/j.jcta.2010.05.006","volume":"117","author":"K-U Schmidt","year":"2010","unstructured":"Schmidt, K.-U.: Symmetric bilinear forms over finite fields of even characteristic. J. Comb. Theory A 117(8), 1011\u20131026 (2010)","journal-title":"J. Comb. Theory A"},{"issue":"2","key":"578_CR29","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/s10801-015-0595-0","volume":"42","author":"K-U Schmidt","year":"2015","unstructured":"Schmidt, K.-U.: Symmetric bilinear forms over finite fields with applications to coding theory. J. Algebraic Comb. 42(2), 635\u2013670 (2015)","journal-title":"J. Algebraic Comb."},{"issue":"7","key":"578_CR30","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1007\/s10623-017-0407-8","volume":"86","author":"K-U Schmidt","year":"2018","unstructured":"Schmidt, K.-U.: Hermitian rank distance codes. Des. Codes Crypt. 86(7), 1469\u20131481 (2018)","journal-title":"Des. Codes Crypt."},{"key":"578_CR31","doi-asserted-by":"publisher","first-page":"475","DOI":"10.3934\/amc.2016019","volume":"10","author":"J Sheekey","year":"2016","unstructured":"Sheekey, J.: A new family of linear maximum rank distance codes. Adv. Math. Commun. 10, 475 (2016)","journal-title":"Adv. Math. Commun."},{"key":"578_CR32","doi-asserted-by":"crossref","unstructured":"Sheekey, J., codes, M.R.D.: Constructions and connections. Combinatorics and Finite Fields: Difference Sets, Polynomials, Pseudorandomness and Applications, edited by Kai-Uwe Schmidt and Arne Winterhof, Berlin, Boston: De Gruyter, 2019, pp 255\u2013286 (2019)","DOI":"10.1515\/9783110642094-013"},{"issue":"9","key":"578_CR33","doi-asserted-by":"publisher","first-page":"6025","DOI":"10.1109\/TIT.2011.2162173","volume":"57","author":"V Sidorenko","year":"2011","unstructured":"Sidorenko, V., Richter, G., Bossert, M.: Linearized shift-register synthesis. IEEE Trans. Inf. Theory 57(9), 6025\u20136032 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"578_CR34","doi-asserted-by":"crossref","unstructured":"Silva, D., Kschischang, F.R.: Fast encoding and decoding of Gabidulin codes. In: International Symposium on Information Theory (ISIT), pp 2858\u20132862. IEEE (2009)","DOI":"10.1109\/ISIT.2009.5205272"},{"issue":"9","key":"578_CR35","doi-asserted-by":"publisher","first-page":"3951","DOI":"10.1109\/TIT.2008.928291","volume":"54","author":"D Silva","year":"2008","unstructured":"Silva, D., Kschischang, F.R., Koetter, R.: A rank-metric approach to error control in random network coding. IEEE Trans Inform Theory 54(9), 3951\u20133967 (2008)","journal-title":"IEEE Trans Inform Theory"},{"key":"578_CR36","doi-asserted-by":"crossref","unstructured":"Trombetti, R., Zhou, Y.: A new family of MRD codes in $$\\mathbb {F}_{q}^{2n\\times 2n}$$ with right and middle nuclei $$\\mathbb {F}_{q^{n}}$$. IEEE Trans. Inf. Theory 65(2), 1054\u20131062 (2019)","DOI":"10.1109\/TIT.2018.2853184"},{"key":"578_CR37","doi-asserted-by":"crossref","unstructured":"Trombetti, R., Zullo, F.: On maximum additive Hermitian rank-metric codes. Journal of Algebraic Combinatorics, pp. 1\u201321 (2020)","DOI":"10.1007\/s10801-020-00973-0"},{"key":"578_CR38","unstructured":"Welch, L.R., Berlekamp, E.R.: Error correction for algebraic block codes, Dec. 30 1986. US Patent 4,633,470"},{"issue":"5","key":"578_CR39","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1007\/s10623-020-00716-z","volume":"88","author":"Y Zhou","year":"2020","unstructured":"Zhou, Y.: On equivalence of maximum additive symmetric rank-distance codes. Des. Codes Crypt. 88(5), 841\u2013850 (2020)","journal-title":"Des. Codes Crypt."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00578-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-022-00578-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00578-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,22]],"date-time":"2024-09-22T23:46:36Z","timestamp":1727048796000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-022-00578-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,26]]},"references-count":39,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["578"],"URL":"https:\/\/doi.org\/10.1007\/s12095-022-00578-3","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,26]]},"assertion":[{"value":"20 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}