{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:17:21Z","timestamp":1740133041038,"version":"3.37.3"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100007210","name":"RWTH ERS Start-Up project \u201cEfficient exact maximumlikelihood decoding and minimum-distance computation for binary linear codes\u201d","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007210","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Excellence Initiative of the German federal and state governments"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1109\/lcomm.2020.3000046","type":"journal-article","created":{"date-parts":[[2020,6,4]],"date-time":"2020-06-04T19:55:36Z","timestamp":1591300536000},"page":"2096-2099","source":"Crossref","is-referenced-by-count":2,"title":["Exact Separation of Forbidden-Set Cuts Associated With Redundant Parity Checks of Binary Linear Codes"],"prefix":"10.1109","volume":"24","author":[{"given":"Christian","family":"Puchert","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7744-836X","authenticated-orcid":false,"given":"Andreas M.","family":"Tillmann","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048489"},{"key":"ref11","first-page":"1","article-title":"Integer Programming as a Tool for Analysis of Channel Codes","author":"scholl","year":"2013","journal-title":"Proc of SCC"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90063-8"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(89)90052-X"},{"article-title":"Mathematical programming approaches for decoding of binary linear codes","year":"2011","author":"tanatmis","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90003-5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2191697"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63976-5_8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006384"},{"journal-title":"Database of Channel Codes and ML Simulation Results","year":"2019","author":"helmling","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.04.090164"},{"article-title":"The SCIP optimization suite 6.0","year":"2018","author":"gleixner","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205846"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875302"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2010.5613894"},{"key":"ref8","article-title":"A branch-price-and-cut algorithm for optimal decoding of LDPC codes","author":"kabakulak","year":"2018","journal-title":"arXiv 1803 04798"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557412"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460090308"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557459"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2204955"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090818"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2530706"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78240-4"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040941"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2193661"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/9218024\/09108224.pdf?arnumber=9108224","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T15:47:32Z","timestamp":1651074452000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9108224\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":29,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2020.3000046","relation":{},"ISSN":["1089-7798","1558-2558","2373-7891"],"issn-type":[{"type":"print","value":"1089-7798"},{"type":"electronic","value":"1558-2558"},{"type":"electronic","value":"2373-7891"}],"subject":[],"published":{"date-parts":[[2020,10]]}}}