{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:42Z","timestamp":1773376962692,"version":"3.50.1"},"reference-count":26,"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"}],"funder":[{"DOI":"10.13039\/501100002347","name":"German Federal Ministry of Education and Research","doi-asserted-by":"publisher","award":["16KIS2065"],"award-info":[{"award-number":["16KIS2065"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195569","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":1,"title":["List-Decodability of Random (Linear) Sum-Rank Metric Codes"],"prefix":"10.1109","author":[{"given":"Yang","family":"Liu","sequence":"first","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich (TUM),Germany"}]},{"given":"Anna","family":"Baumeister","sequence":"additional","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich (TUM),Germany"}]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich (TUM),Germany"}]}],"member":"263","reference":[{"issue":"4","key":"ref1","first-page":"29","article-title":"List concatenated decoding","volume":"17","author":"Zyablov","year":"1981","journal-title":"Problems of Information Transmission"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1109\/TIT.2010.2095170","article-title":"On the listdecodability of random linear codes","volume":"57","author":"Guruswami","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"ref3","article-title":"Essential coding theory","volume":"2","author":"Guruswami","year":"2012","journal-title":"Draft"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/TIT.2014.2371915","article-title":"On list-decodability of random rank metric codes and subspace codes","volume":"61","author":"Ding","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref5","first-page":"1505","article-title":"On the list-decodability of random linear rank-metric codes","volume-title":"2018 IEEE International Symposium on Information Theory (ISIT)","author":"Guruswami","year":"2017"},{"key":"ref6","article-title":"List-decodable codes:(randomized) constructions and applications","volume-title":"School Comput. Sci.","volume":"113","author":"Resch","year":"2020"},{"key":"ref7","volume-title":"List decoding for noisy channels","author":"Elias","year":"1957"},{"key":"ref8","first-page":"90","article-title":"List decoding","volume-title":"Quarterly Progress Report","volume":"48","author":"Wozencraft","year":"1958"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/WINC.2010.5507933","article-title":"Multishot codes for network coding using rank-metric codes","volume-title":"2010 Third IEEE International Workshop on Wireless Network Coding","author":"Da N\u00f3brega","year":"2010"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/18.61123","article-title":"Error-correcting codes for list decoding","volume":"37","author":"Elias","year":"1991","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1109\/18.995539","article-title":"Combinatorial bounds for list decoding","volume":"48","author":"Guruswami","year":"2002","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/120896773"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488716"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591797"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"1522","DOI":"10.1109\/TIT.2020.3041650","article-title":"Improved list-decodability of random linear binary codes","volume":"67","author":"Li","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT63088.2025.11195569","volume-title":"On the list-decodability of random (linear) sum-rank metric codes","author":"Liu","year":"2025"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","article-title":"Coding for errors and erasures in random network coding","volume":"54","author":"Koetter","year":"2007","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1561\/0100000120","article-title":"Codes in the sum-rank metric: Fundamentals and applications","volume":"19","author":"Mart\u00ednez-Pe\u00f1as","year":"2022","journal-title":"Found. Trends Commun. Inf. Theory"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/ISIT44484.2020.9174497","article-title":"Generic decoding in the sum-rank metric","volume-title":"2020 IEEE International Symposium on Information Theory (ISIT)","author":"Puchinger","year":"2020"},{"key":"ref20","first-page":"119","article-title":"Bounds and genericity of sum-rank-metric codes","volume-title":"2021 XVII International Symposium \u201cProblems of Redundancy in Information and Control Systems\u201d (REDUNDANCY)","author":"Ott","year":"2021"},{"key":"ref21","article-title":"Sum-rank metric codes","volume":"abs\/2304.12095","author":"Gorla","year":"2023","journal-title":"ArXiv"},{"key":"ref22","article-title":"Covering codes, list-decodable codes and strong singletonlike bounds in the sum-rank metric","volume":"abs\/2311.07831","author":"Chen","year":"2023","journal-title":"ArXiv"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"6456","DOI":"10.1109\/TIT.2021.3074190","article-title":"Fundamental properties of sum-rank-metric codes","volume":"67","author":"Byrne","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/Allerton49937.2022.9929421","article-title":"Covering properties of sum-rank metric codes","volume-title":"2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","author":"Ott","year":"2022"},{"key":"ref25","article-title":"Geometrical properties of balls in sum-rank metric","volume":"abs\/2303.11887","author":"Ott","year":"2023","journal-title":"ArXiv"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"1846","DOI":"10.1109\/FOCS61266.2024.00111","article-title":"Random gabidulin codes achieve list decoding capacity in the rank metric","volume-title":"2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)","author":"Guo","year":"2024"}],"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\/11195569.pdf?arnumber=11195569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:39Z","timestamp":1773347379000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195569\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195569","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}