{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T15:17:24Z","timestamp":1781623044849,"version":"3.54.5"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Norwegian-Estonian Research Cooperation Programme","award":["EMP133"],"award-info":[{"award-number":["EMP133"]}]},{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["240985\/F20"],"award-info":[{"award-number":["240985\/F20"]}],"id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["RU-1524\/2-1"],"award-info":[{"award-number":["RU-1524\/2-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1109\/tit.2019.2955504","type":"journal-article","created":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T01:08:46Z","timestamp":1574730526000},"page":"1281-1317","source":"Crossref","is-referenced-by-count":3,"title":["Adaptive Linear Programming Decoding of Nonbinary Linear Codes Over Prime Fields"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8236-6601","authenticated-orcid":false,"given":"Eirik","family":"Rosnes","sequence":"first","affiliation":[{"name":"Simula UiB, Bergen, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9133-7076","authenticated-orcid":false,"given":"Michael","family":"Helmling","sequence":"additional","affiliation":[{"name":"Mathematical Institute, University of Koblenz-Landau, Koblenz, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref38","article-title":"Decoding error-correcting codes via linear programming","author":"feldman","year":"2003"},{"key":"ref33","year":"2014","journal-title":"Gurobi"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8438-9_2"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133150"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048489"},{"key":"ref37","author":"horn","year":"2013","journal-title":"Matrix Analysis"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2016.7888132"},{"key":"ref35","author":"mackay","year":"2016","journal-title":"Encyclopedia of Sparse Graph Codes"},{"key":"ref34","first-page":"1","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"Proc Int Symp Commun Theory Appl (ISCTA)"},{"key":"ref10","first-page":"2449","article-title":"ADMM decoding of non-binary LDPC codes in \n$\\mathbb{F}_{2^{m}}$","author":"liu","year":"2014","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2554598"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2929944"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620477"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.101413.130826"},{"key":"ref16","first-page":"1","article-title":"Characterization of graph-cover pseudocodewords of codes over \n$\\mathbb{F}_{3}$","author":"skachek","year":"2010","journal-title":"Proc IEEE Inf Theory Workshop (ITW)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2204955"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875302"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404707"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541637"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030477"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2191697"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006384"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281372"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90003-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161920"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2211859"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025571"},{"key":"ref2","first-page":"1","article-title":"Towards Low-Complexity Linear-Programming Decoding","author":"vontobel","year":"2006","journal-title":"5th International Symposium on Turbo Codes and Related Topics"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.070213.120801"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282450"},{"key":"ref22","first-page":"754","article-title":"Fast linear-programming decoding of LDPC codes over GF(\n$2^{m}$\n)","author":"honda","year":"2012","journal-title":"Proc Int Symp Inf Theory Appl (ISITA)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2597287"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2011443"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8999759\/08911339.pdf?arnumber=8911339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:30:03Z","timestamp":1651080603000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8911339\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":38,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2955504","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3]]}}}