{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:37:41Z","timestamp":1773376661043,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206683","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"2368-2373","source":"Crossref","is-referenced-by-count":0,"title":["Two new algorithms for error support recovery of low rank parity check codes"],"prefix":"10.1109","author":[{"given":"Ermes","family":"Franch","sequence":"first","affiliation":[{"name":"University of Bergen,Department of Informatics,Norway"}]},{"given":"Chunlei","family":"Li","sequence":"additional","affiliation":[{"name":"University of Bergen,Department of Informatics,Norway"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2511786"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2616127"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/11779360_4"},{"key":"ref14","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref11","article-title":"ROLLO (merger of Rank-Ouroboros, LAKE and LOCKER)","author":"melchor","year":"2020","journal-title":"Second round submission to the NIST post-quantum cryptography call"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.37236\/6106"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.818023"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-020-00449-9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9659-5"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2933535"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9003-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63697-9_7"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11659-4_6"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06734-6_1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1561\/9781638280019"},{"key":"ref3","author":"gabidulin","year":"2021","journal-title":"Rank Codes"},{"key":"ref6","article-title":"Low rank parity check codes and their application to cryptography","author":"gaborit","year":"0","journal-title":"proceedings of the workshop on coding and cryptography WCC’2013 Bergen Norway 2013"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_41"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206683.pdf?arnumber=10206683","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:25Z","timestamp":1773347245000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206683\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206683","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}