{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:09Z","timestamp":1740122529849,"version":"3.37.3"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T00:00:00Z","timestamp":1644969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T00:00:00Z","timestamp":1644969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100009112","name":"Istituto Nazionale di Alta Matematica \u201cFrancesco Severi\u201d","doi-asserted-by":"publisher","award":["GNSAGA"],"award-info":[{"award-number":["GNSAGA"]}],"id":[{"id":"10.13039\/100009112","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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10623-022-01022-6","type":"journal-article","created":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T15:02:36Z","timestamp":1645023756000},"page":"957-982","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the list decodability of rank-metric codes containing Gabidulin codes"],"prefix":"10.1007","volume":"90","author":[{"given":"Paolo","family":"Santonastaso","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5087-2363","authenticated-orcid":false,"given":"Ferdinando","family":"Zullo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,16]]},"reference":[{"issue":"2","key":"1022_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00493-016-3531-6","volume":"38","author":"D Bartoli","year":"2018","unstructured":"Bartoli D., Giulietti M., Marino G., Polverino O.: Maximum scattered linear sets and complete caps in Galois spaces. Combinatorica 38(2), 255\u2013278 (2018).","journal-title":"Combinatorica"},{"issue":"1","key":"1022_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.26493\/1855-3974.2137.7fa","volume":"19","author":"D Bartoli","year":"2020","unstructured":"Bartoli D., Zanella C., Zullo F.: A new family of maximum scattered linear sets in $${\\rm PG}(1, q^6)$$. Ars Math. Contemp. 19(1), 125\u2013145 (2020).","journal-title":"Ars Math. Contemp."},{"key":"1022_CR3","doi-asserted-by":"crossref","unstructured":"Bartoli D., Zhou Y.: Asymptotics of Moore exponent sets. J. Comb. Theory Ser. A 175 (2020).","DOI":"10.1016\/j.jcta.2020.105281"},{"key":"1022_CR4","unstructured":"Bombar M., Couvreur A.: Decoding supercodes of Gabidulin codes and applications to cryptanalysis, arXiv:2103.02700."},{"issue":"1","key":"1022_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1109\/TIT.2009.2034780","volume":"56","author":"E Ben-Sasson","year":"2010","unstructured":"Ben-Sasson E., Kopparty S., Radhakrishnan J.: Subspace polynomials and limits to list decoding of Reed-Solomon codes. IEEE Trans. Inf. Theory 56(1), 113\u2013120 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1022_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.laa.2018.02.027","volume":"548","author":"B Csajb\u00f3k","year":"2018","unstructured":"Csajb\u00f3k B., Marino G., Polverino O., Zanella C.: A new family of MRD-codes. Linear Algebra Appl. 548, 203\u2013220 (2018).","journal-title":"Linear Algebra Appl."},{"issue":"6","key":"1022_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ffa.2018.11.009","volume":"5","author":"B Csajb\u00f3k","year":"2019","unstructured":"Csajb\u00f3k B., Marino G., Polverino O., Zullo F.: A characterization of linearized polynomials with maximum kernel. Finite Fields Appl. 5(6), 109\u2013130 (2019).","journal-title":"Finite Fields Appl."},{"key":"1022_CR8","doi-asserted-by":"crossref","unstructured":"Csajb\u00f3k B., Marino G., Polverino O., Zhou Y.: Maximum rank-distance codes with maximum left and right idealisers. Discret. Math.343(9) (2020).","DOI":"10.1016\/j.disc.2020.111985"},{"key":"1022_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ffa.2018.08.001","volume":"54","author":"B Csajb\u00f3k","year":"2018","unstructured":"Csajb\u00f3k B., Marino G., Zullo F.: New maximum scattered linear sets of the projective line. Finite Fields Appl. 54, 133\u2013150 (2018).","journal-title":"Finite Fields Appl."},{"key":"1022_CR10","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 Ser. A 25, 226\u2013241 (1978).","journal-title":"J. Comb. Theory Ser. A"},{"key":"1022_CR11","unstructured":"Elias P.: List decoding for noisy channels. In: Massachusetts Inst. Technol. Cambridge, MA, USA, Tech. Rep. 335 (1957)."},{"issue":"3","key":"1022_CR12","first-page":"3","volume":"21","author":"E Gabidulin","year":"1985","unstructured":"Gabidulin E.: Theory of codes with maximum rank distance. Probl. Inf. Transm. 21(3), 3\u201316 (1985).","journal-title":"Probl. Inf. Transm."},{"key":"1022_CR13","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.laa.2019.03.030","volume":"575","author":"L Giuzzi","year":"2019","unstructured":"Giuzzi L., Zullo F.: Identifiers for MRD-codes. Linear Algebra Appl. 575, 66\u201386 (2019).","journal-title":"Linear Algebra Appl."},{"key":"1022_CR14","doi-asserted-by":"publisher","first-page":"2212","DOI":"10.1016\/j.laa.2008.11.021","volume":"430","author":"R Gow","year":"2009","unstructured":"Gow R., Quinlan R.: Galois extensions and subspaces of alterning bilinear forms with special rank properties. Linear Algebra Appl. 430, 2212\u20132224 (2009).","journal-title":"Linear Algebra Appl."},{"key":"1022_CR15","doi-asserted-by":"publisher","DOI":"10.1561\/9781601980052","volume-title":"Algorithmic Results in List Decoding","author":"V Guruswami","year":"2006","unstructured":"Guruswami V.: Algorithmic Results in List Decoding. Now Publishers Inc., Boston (2006)."},{"issue":"5","key":"1022_CR16","doi-asserted-by":"publisher","first-page":"2707","DOI":"10.1109\/TIT.2016.2544347","volume":"62","author":"V Guruswami","year":"2016","unstructured":"Guruswami V., Wang C., Xing C.: Explicit list-decodable rank metric and subspace codes via subspace designs. IEEE Trans. Inf. Theory 62(5), 2707\u20132717 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1022_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1515\/jmc-2015-0049","volume":"14","author":"M Huang","year":"2020","unstructured":"Huang M., Kosters M., Petit C., Yeo S., Yun Y.: Quasi-subfield polynomials and the elliptic curve discrete logarithm problem. J. Math. Cryptol. 14(1), 25\u201338 (2020).","journal-title":"J. Math. Cryptol."},{"issue":"4","key":"1022_CR18","doi-asserted-by":"publisher","first-page":"1604","DOI":"10.1109\/18.923744","volume":"47","author":"J Justesen","year":"2001","unstructured":"Justesen J., Hoholdt T.: Bounds on list decoding of MDS codes. IEEE Trans. Inf. Theory 47(4), 1604\u20131609 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1022_CR19","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":"1022_CR20","doi-asserted-by":"crossref","unstructured":"Kadir W.K., Li C., Zullo F.: On interpolation-based decoding of maximum rank distance codes. In: International Symposium on Information Theory, 2021. ISIT 2021. Proceedings.","DOI":"10.1109\/ISIT45174.2021.9517980"},{"key":"1022_CR21","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R Koetter","year":"2008","unstructured":"Koetter R., Kschischang F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54, 3579\u20133591 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1022_CR22","doi-asserted-by":"crossref","unstructured":"Kshevetskiy A., Gabidulin E.: The new construction of rank codes. In: International Symposium on Information Theory, 2005. ISIT 2005. Proceedings, pp. 2105\u20132108 (2005).","DOI":"10.1109\/ISIT.2005.1523717"},{"key":"1022_CR23","unstructured":"Lidl R., Niederreiter H.: Finite Fields, volume\u00a020 of Encyclopedia of Mathematics and its Applications, 2nd ed.. Cambridge University Press, Cambridge (1997)."},{"key":"1022_CR24","doi-asserted-by":"crossref","unstructured":"Loidreau P.: A Welch-Berlekamp like algorithm for decoding Gabidulin codes. In: Coding and Cryptography. Springer, Berlin, pp. 36\u201345 (2006).","DOI":"10.1007\/11779360_4"},{"key":"1022_CR25","unstructured":"Longobardi G., Marino G., Trombetti R., Zhou Y.: A large family of maximum scattered linear sets of PG$$(1,q^n)$$ and their associated MRD codes, arXiv:2102.08287."},{"key":"1022_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-020-01011-9","author":"G Longobardi","year":"2021","unstructured":"Longobardi G., Zanella C.: Linear sets and MRD-codes arising from a class of scattered linearized polynomials. J. Algebr. Comb. (2021). https:\/\/doi.org\/10.1007\/s10801-020-01011-9.","journal-title":"J. Algebr. Comb."},{"key":"1022_CR27","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., Zhou Y.: Generalized twisted Gabidulin codes. J. Comb. Theory Ser. A 159, 79\u2013106 (2018).","journal-title":"J. Comb. Theory Ser. A"},{"key":"1022_CR28","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.laa.2020.01.004","volume":"591","author":"G Marino","year":"2020","unstructured":"Marino G., Montanucci M., Zullo F.: MRD-codes arising from the trinomial $$x^q + x^{q^3}+ cx^{q^5} \\in \\mathbb{F}_{q^6}[x]$$. Linear Algebra Appl. 591, 99\u2013114 (2020).","journal-title":"Linear Algebra Appl."},{"key":"1022_CR29","doi-asserted-by":"publisher","unstructured":"McGuire G., Mueller D.: Results on linearized trinomials having certain rank. In: Finite Fields and their Applications. De Gruyter, Berlin. https:\/\/doi.org\/10.1515\/9783110621730-010.","DOI":"10.1515\/9783110621730-010"},{"key":"1022_CR30","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ffa.2019.02.003","volume":"57","author":"G McGuire","year":"2019","unstructured":"McGuire G., Sheekey J.: A Characterization of the number of roots of linearized and projective polynomials in the field of coefficients. Finite Fields Appl. 57, 68\u201391 (2019).","journal-title":"Finite Fields Appl."},{"key":"1022_CR31","unstructured":"Neri A., Santonastaso P., Zullo F.: Extending two families of maximum rank distance codes, arXiv:2104.07602."},{"key":"1022_CR32","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. Inform. Theory 63, 164\u2013168 (2017).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1022_CR33","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":"1022_CR34","unstructured":"Randrianarisoa T.H.: A decoding algorithm for rank metric codes, arXiv:1712.07060."},{"key":"1022_CR35","doi-asserted-by":"crossref","unstructured":"Randrianarisoa T.H., Rosenthal J.: A decoding algorithm for twisted Gabidulin codes. In: IEEE International Symposium on Information Theory (ISIT), pp. 2771\u20132774 (2017).","DOI":"10.1109\/ISIT.2017.8007034"},{"issue":"4","key":"1022_CR36","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.1109\/TIT.2016.2532343","volume":"62","author":"N Raviv","year":"2016","unstructured":"Raviv N., Wachter-Zeh A.: Some Gabidulin codes cannot be list decoded efficiently at any radius. IEEE Trans. Inf. Theory 62(4), 1605\u20131615 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1022_CR37","doi-asserted-by":"crossref","unstructured":"Renner J., Jerkovits T., Bartz H., Puchinger S., Loidreau P., Wachter-Zeh A.: Randomized decoding of Gabidulin codes beyond the unique decoding radius. In: International Conference on Post-Quantum Cryptography. Springer, Cham (2020).","DOI":"10.1007\/978-3-030-44223-1_1"},{"issue":"6","key":"1022_CR38","doi-asserted-by":"publisher","first-page":"1279","DOI":"10.1007\/s10623-021-00861-z","volume":"89","author":"J Renner","year":"2021","unstructured":"Renner J., Puchinger S., Wachter-Zeh A.: LIGA: A cryptosystem based on the hardness of rank-metric list and interleaved decoding. Des. Codes Cryptogr. 89(6), 1279\u20131319 (2021).","journal-title":"Des. Codes Cryptogr."},{"key":"1022_CR39","unstructured":"Richter G., Plass S.: Error and erasure decoding of rank-codes with a modified Berlekamp-Massey algorithm. In: 5th International ITG Conference on Source and Channel Coding, pp. 249\u2013256 (2004)."},{"issue":"2","key":"1022_CR40","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. Inform. Theory 37(2), 328\u2013336 (1991).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"1022_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2021.106842","volume":"226","author":"P Santonastaso","year":"2022","unstructured":"Santonastaso P., Zullo F.: Linearized trinomials with maximum kernel. J. Pure Appl. Algebra 226(3), 106842 (2022).","journal-title":"J. Pure Appl. Algebra"},{"key":"1022_CR42","doi-asserted-by":"crossref","unstructured":"Sheekey J.: New semifields and new MRD codes from skew polynomial rings. J. Lond. Math. Soc. (2) 101(1), 432\u2013456 (2020).","DOI":"10.1112\/jlms.12281"},{"key":"1022_CR43","volume-title":"Combinatorics and Finite Fields: Difference Sets","author":"J Sheekey","year":"2020","unstructured":"Sheekey J.: MRD codes: constructions and connections. In: Schmidt K.-U., Winterhof A. (eds.) Combinatorics and Finite Fields: Difference Sets. Polynomials, Pseudorandomness and Applications, Radon Series on Computational and Applied Mathematics (2020)."},{"issue":"3","key":"1022_CR44","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(3), 475\u2013488 (2016).","journal-title":"Adv. Math. Commun."},{"issue":"9","key":"1022_CR45","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., Koetter R.: A rank-metric approach to error control in random network coding. IEEE Trans. Inf. Theory 54(9), 3951\u20133967 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1022_CR46","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1109\/TIT.2018.2853184","volume":"65","author":"R Trombetti","year":"2019","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. Inform. Theory 65(2), 1054\u20131062 (2019).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"1022_CR47","doi-asserted-by":"publisher","first-page":"5379","DOI":"10.1109\/TIT.2020.2966974","volume":"66","author":"R Trombetti","year":"2020","unstructured":"Trombetti R., Zullo F.: On the list decodability of rank metric codes. IEEE Trans. Inform. Theory 66(9), 5379\u20135386 (2020).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"1022_CR48","doi-asserted-by":"publisher","first-page":"7268","DOI":"10.1109\/TIT.2013.2274653","volume":"59","author":"A Wachter-Zeh","year":"2013","unstructured":"Wachter-Zeh A.: Bounds on list decoding of rank-metric codes. IEEE Trans. Inform. Theory 59(11), 7268\u20137276 (2013).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1022_CR49","unstructured":"Wachter-Zeh A., Afanassiev V.B., Sidorenko V.R.: Fast decoding of Gabidulin codes. In: Int. Workshop Coding Cryptogr. (WCC) Paris France, pp. 433\u2014442 (2011)."},{"issue":"1","key":"1022_CR50","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10623-012-9659-5","volume":"66","author":"A Wachter-Zeh","year":"2013","unstructured":"Wachter-Zeh A., Afanassiev V.B., Sidorenko V.R.: Fast decoding of Gabidulin codes. Des. Codes Cryptogr. 66(1), 57\u201373 (2013).","journal-title":"Des. Codes Cryptogr."},{"key":"1022_CR51","unstructured":"Wachter-Zeh A., Sidorenko V.R., Bossert M.: A fast linearized euclidean algorithm for decoding Gabidulin codes. In: Int. Workshop Alg. Combin. Coding Theory (ACCT) Novosibirsk, Russia, pp. 298\u2013303 (2010)."},{"key":"1022_CR52","unstructured":"Wozencraft J.M.: List decoding. In: Massachusetts Inst. Technol., Cambridge, MA, USA, Tech. Rep (1958)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01022-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01022-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01022-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T19:26:28Z","timestamp":1726687588000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01022-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,16]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["1022"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01022-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,2,16]]},"assertion":[{"value":"12 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}