{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T00:36:55Z","timestamp":1775608615668,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T00:00:00Z","timestamp":1592697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T00:00:00Z","timestamp":1592697600000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10623-020-00772-5","type":"journal-article","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T13:02:37Z","timestamp":1592744557000},"page":"1521-1539","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Hamming and simplex codes for the sum-rank metric"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2626-8139","authenticated-orcid":false,"given":"Umberto","family":"Mart\u00ednez-Pe\u00f1as","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,21]]},"reference":[{"issue":"4","key":"772_CR1","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1016\/j.jpaa.2014.04.026","volume":"219","author":"A Barra","year":"2015","unstructured":"Barra A., Gluesing-Luerssen H.: MacWilliams extension theorems and the local-global property for codes over Frobenius rings. J. Pure Appl. Algebra 219(4), 703\u2013728 (2015).","journal-title":"J. Pure Appl. Algebra"},{"issue":"11","key":"772_CR2","doi-asserted-by":"publisher","first-page":"3016","DOI":"10.1109\/TIT.2003.819322","volume":"49","author":"TP Berger","year":"2003","unstructured":"Berger T.P.: Isometries for rank distance and permutation group of Gabidulin codes. IEEE Trans. Inform. Theory 49(11), 3016\u20133019 (2003).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"772_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01215286","volume":"145","author":"A Beutelspacher","year":"1975","unstructured":"Beutelspacher A.: Partial spreads in finite projective spaces and partial designs. Math. Z. 145(3), 211\u2013229 (1975). Oct.","journal-title":"Math. Z."},{"issue":"1","key":"772_CR4","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/BF01920229","volume":"12","author":"A Beutelspacher","year":"1979","unstructured":"Beutelspacher A.: On $$t$$-covers in finite projective spaces. J. Geom. 12(1), 10\u201316 (1979).","journal-title":"J. Geom."},{"issue":"3","key":"772_CR5","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(3), 226\u2013241 (1978).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"7","key":"772_CR6","doi-asserted-by":"publisher","first-page":"3140","DOI":"10.1109\/18.737544","volume":"44","author":"T Etzion","year":"1998","unstructured":"Etzion T.: Perfect byte-correcting codes. IEEE Trans. Info. Theory 44(7), 3140\u20133146 (1998). Nov.","journal-title":"IEEE Trans. Info. Theory"},{"issue":"1","key":"772_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1109\/18.179360","volume":"39","author":"T Etzion","year":"1993","unstructured":"Etzion T., Greenberg G.: Constructions for perfect mixed codes and other covering codes. IEEE Trans. Info. Theory 39(1), 209\u2013214 (1993).","journal-title":"IEEE Trans. Info. Theory"},{"issue":"1","key":"772_CR8","first-page":"1","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin E.M.: Theory of codes with maximum rank distance. Problems Inf. Transm. 21(1), 1\u201312 (1985).","journal-title":"Problems Inf. Transm."},{"issue":"11","key":"772_CR9","doi-asserted-by":"publisher","first-page":"6925","DOI":"10.1109\/TIT.2012.2208937","volume":"58","author":"P Gopalan","year":"2012","unstructured":"Gopalan P., Huang C., Simitci H., Yekhanin S.: On the locality of codeword symbols. IEEE Trans. Info. Theory 58(11), 6925\u20136934 (2012). Nov.","journal-title":"IEEE Trans. Info. Theory"},{"key":"772_CR10","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.ffa.2013.11.007","volume":"26","author":"E Gorla","year":"2014","unstructured":"Gorla E., Ravagnani A.: Partial spreads in random network coding. Finite Fields Appl. 26, 104\u2013115 (2014).","journal-title":"Finite Fields Appl."},{"issue":"2","key":"772_CR11","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 R.W.: Error detecting and error correcting codes. Bell Syst. Tech. J. 29(2), 147\u2013160 (1950). April.","journal-title":"Bell Syst. Tech. J."},{"issue":"4","key":"772_CR12","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/S0019-9958(71)90464-5","volume":"18","author":"M Herzog","year":"1971","unstructured":"Herzog M., Schonheim J.: Linear and nonlinear single-error-correcting perfect mixed codes. Inf. Control 18(4), 364\u2013368 (1971).","journal-title":"Inf. Control"},{"key":"772_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)."},{"issue":"8","key":"772_CR14","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 errors and erasures in random network coding. IEEE Trans. Inf. Theory 54(8), 3579\u20133591 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"772_CR15","unstructured":"Loidreau P.: Properties of codes in rank metric. In: Eleventh International Workshop on Algebraic and Combinatorial Coding Theory ACCT2008, Pamporovo, Bulgaria, June (2008)."},{"issue":"5","key":"772_CR16","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1109\/TIT.2005.846403","volume":"51","author":"H-F Lu","year":"2005","unstructured":"Lu H.-F., Kumar P.V.: A unified construction of space-time codes with optimal rate-diversity tradeoff. IEEE Trans. Inf. Theory 51(5), 1709\u20131730 (2005). May.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"772_CR17","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.jalgebra.2018.02.005","volume":"504","author":"U Mart\u00ednez-Pe\u00f1as","year":"2018","unstructured":"Mart\u00ednez-Pe\u00f1as U.: Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring. J. Algebra 504, 587\u2013612 (2018).","journal-title":"J. Algebra"},{"key":"772_CR18","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1007\/s10623-019-00619-8","volume":"87","author":"U Mart\u00ednez-Pe\u00f1as","year":"2019","unstructured":"Mart\u00ednez-Pe\u00f1as U.: Theory of supports for linear codes endowed with the sum-rank metric. Des. Codes Cryptogr. 87, 2295\u20132320 (2019).","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"772_CR19","doi-asserted-by":"publisher","first-page":"4785","DOI":"10.1109\/TIT.2019.2912165","volume":"65","author":"U Mart\u00ednez-Pe\u00f1as","year":"2019","unstructured":"Mart\u00ednez-Pe\u00f1as U., Kschischang F.R.: Reliable and secure multishot network coding using linearized Reed\u2013Solomon codes. IEEE Trans. Info. Theory 65(8), 4785\u20134803 (2019). Aug.","journal-title":"IEEE Trans. Info. Theory"},{"key":"772_CR20","doi-asserted-by":"publisher","first-page":"7790","DOI":"10.1109\/TIT.2019.2924888","volume":"65","author":"U Mart\u00ednez-Pe\u00f1as","year":"2019","unstructured":"Mart\u00ednez-Pe\u00f1as U., Kschischang F.R.: Universal and dynamic locally repairable codes with maximal recoverability via sum-rank codes. IEEE Trans. Info. Theory 65, 7790\u20137805 (2019).","journal-title":"IEEE Trans. Info. Theory"},{"key":"772_CR21","doi-asserted-by":"crossref","unstructured":"N\u00f3brega R.W., Uch\u00f4a-Filho B.F.: Multishot codes for network coding using rank-metric codes. In: Proc. 2010 Third IEEE International Workshop on Wireless Network Coding, pp. 1\u20136 (2010).","DOI":"10.1109\/WINC.2010.5507933"},{"issue":"1","key":"772_CR22","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1109\/TIT.2013.2288784","volume":"60","author":"AS Rawat","year":"2014","unstructured":"Rawat A.S., Koyluoglu O.O., Silberstein N., Vishwanath S.: Optimal locally repairable and secure codes for distributed storage systems. IEEE Trans. Inf. Theory 60(1), 212\u2013236 (2014). Jan.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"772_CR23","doi-asserted-by":"crossref","unstructured":"Sidorenko V.,\u00a0Schmidt G.,\u00a0Gabidulin E.,\u00a0Bossert M.,\u00a0Afanassiev V.: On polyalphabetic block codes. In: Proc. IEEE Info. Theory Workshop (2005).","DOI":"10.1109\/ITW.2005.1531889"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00772-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-020-00772-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00772-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,20]],"date-time":"2021-06-20T23:20:13Z","timestamp":1624231213000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-020-00772-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,21]]},"references-count":23,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["772"],"URL":"https:\/\/doi.org\/10.1007\/s10623-020-00772-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,21]]},"assertion":[{"value":"26 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}