{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:23Z","timestamp":1773377003546,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195341","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Decoding Algorithms for Tensor Codes"],"prefix":"10.1109","author":[{"given":"Lucien","family":"Fran\u00e7ois","sequence":"first","affiliation":[{"name":"University College,Department of Mathematics and Statistics,Dublin"}]},{"given":"Eimear","family":"Byrne","sequence":"additional","affiliation":[{"name":"University College,Department of Mathematics and Statistics,Dublin"}]},{"given":"Alain","family":"Couvreur","sequence":"additional","affiliation":[{"name":"Institut Polytechnique de Paris,Inria, Laboratoire LIX >École Polytechnique"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2018.05.004"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2016019"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.556603"},{"key":"ref4","article-title":"Error correction for algebraic block codes","volume-title":"uS Patent 4,633,470","author":"Welch","year":"1986"},{"key":"ref5","first-page":"1569","volume-title":"Decoding of Cyclic Codes and Codes on Curves, ser. Handbook of Coding Theory","volume":"II","author":"Blahut","year":"1998"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/11779360_4"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9781139172769"},{"key":"ref8","first-page":"1","article-title":"Theory of codes with maximum rank distance (translation)","volume":"21","author":"Gabidulin","year":"1985","journal-title":"Problems of Information Transmission"},{"key":"ref9","volume-title":"Algebraic Complexity Theory, ser. Grundlehren der mathematischen Wissenschaften","author":"B\u00fcrgisser","year":"2013"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1201\/b12770"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0041-0_16"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0077-3"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511987045"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9659-5"},{"key":"ref15","volume-title":"Matrix Computations, ser. Johns Hopkins Studies in the Mathematical Sciences","author":"Golub","year":"2013"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195341.pdf?arnumber=11195341","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:56Z","timestamp":1773347396000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195341\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195341","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}