{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T04:28:34Z","timestamp":1780547314533,"version":"3.54.1"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1109\/tit.2021.3088712","type":"journal-article","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T20:16:22Z","timestamp":1623788182000},"page":"5149-5167","source":"Crossref","is-referenced-by-count":15,"title":["Sum-Rank BCH Codes and Cyclic-Skew-Cyclic Codes"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2626-8139","authenticated-orcid":false,"given":"Umberto","family":"Martinez-Penas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9230-6"},{"key":"ref38","first-page":"147","article-title":"Codes correcteurs d’erreurs","volume":"2","author":"hocquenghem","year":"1959","journal-title":"Chiffres"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.14317\/jami.2013.337"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2012.6.39"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2008.2.273"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93806-4_13"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(60)90287-4"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1023\/B:ACAP.0000027534.61242.09"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055531"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1049\/cje.2017.03.008"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(97)00006-X"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(72)90223-9"},{"key":"ref29","first-page":"133","article-title":"On finite rings over which every free codes is splitting","volume":"58","author":"hirano","year":"2016","journal-title":"Math J Okayama Univ"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2912165"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/WINC.2010.5507933"},{"key":"ref20","article-title":"Reed–Solomon-Gabidulin codes","author":"caruso","year":"2018","journal-title":"arXiv 1812 09147"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055435"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref24","author":"macwilliams","year":"1983","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523305"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-007-0043-z"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-020-00789-w"},{"key":"ref51","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2021.3067318","article-title":"Fast decoding of codes in the rank, subspace, and sum-rank metric","author":"bartz","year":"2021","journal-title":"IEEE Trans Inf Theory"},{"key":"ref53","article-title":"Sum-rank product codes and bounds on the minimum distance","author":"alfarano","year":"2021","journal-title":"arXiv 2105 15086"},{"key":"ref52","article-title":"Error correction of algebraic block codes","author":"berlekamp","year":"1986"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref40","volume":"20","author":"lidl","year":"1983","journal-title":"Finite Fields"},{"key":"ref12","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems Inf Transmiss"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946011020049"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2424930"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555949"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007033"},{"key":"ref17","first-page":"507","article-title":"Faster decoding of rank metric convolutional codes","author":"napp","year":"2018","journal-title":"Proc Int Symp Math Theory Netw Syst"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0346-4"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2018.02.005"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174329"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.846403"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3005430"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2924888"},{"key":"ref8","first-page":"114","article-title":"A public-key cryptosystem based on algebraic coding theory","volume":"44","author":"mceliece","year":"1978","journal-title":"Deep Space Network Progress Report"},{"key":"ref7","first-page":"1057","article-title":"Private information retrieval from locally repairable databases with colluding servers","author":"mart\u00ednez-pe\u00f1as","year":"2019","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref49","article-title":"Residues of skew rational functions and linearized Goppa codes","author":"caruso","year":"2019","journal-title":"arXiv 1908 08430"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref46","first-page":"193","article-title":"A general theory of Vandermonde matrices","volume":"4","author":"lam","year":"1986","journal-title":"Expo Math"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-016-0262-z"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-019-00619-8"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(88)90063-4"},{"key":"ref42","author":"lang","year":"2005","journal-title":"Undergraduate Algebra"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.2307\/1968173"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2008.2.55"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-0406-7"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9487479\/09455357.pdf?arnumber=9455357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:17Z","timestamp":1652194457000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9455357\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":53,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3088712","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8]]}}}