{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:58:47Z","timestamp":1774990727232,"version":"3.50.1"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541755","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"2529-2533","source":"Crossref","is-referenced-by-count":1,"title":["Distance verification for LDPC codes"],"prefix":"10.1109","author":[{"given":"Ilya","family":"Dumer","sequence":"first","affiliation":[{"name":"ECE Department, University of California at Riverside, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexey A.","family":"Kovalev","sequence":"additional","affiliation":[{"name":"Department of Physics & Astronomy, University of Nebraska-Lincoln, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonid P.","family":"Pryadko","sequence":"additional","affiliation":[{"name":"Department of Physics & Astronomy, University of California at Riverside, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824918"},{"key":"ref11","first-page":"3","article-title":"Complexity of decoding for linear codes","volume":"19","author":"evseev","year":"1983","journal-title":"Probl Peradach Inform"},{"key":"ref12","first-page":"157","article-title":"On syndrome decoding of linear codes","volume":"2","author":"dumer","year":"0","journal-title":"Proc Ninth All-Union Symp Redundancy in Information Systems Nauka"},{"key":"ref13","first-page":"24","article-title":"On syndrome decoding of linear codes","volume":"25","author":"dumer","year":"1989","journal-title":"Probl Peradach Inform"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057777"},{"key":"ref15","first-page":"43","article-title":"A public-key cryptosystem based on algebraic coding theory","author":"mceliece","year":"1978","journal-title":"JPL Tech Rep DSN Progress Report"},{"key":"ref16","first-page":"275","article-title":"An observation on the security of mcelieces public-key cryptosystem","author":"lee","year":"1988","journal-title":"Advances in Cryptology-EUROCRYPT 1988"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.21270"},{"key":"ref18","first-page":"103","article-title":"Decoding complexity bound for linear block codes;","volume":"25","author":"kruk","year":"1989","journal-title":"Probl Peredachi Inf"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.57202"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1007\/978-3-642-29011-4_31","article-title":"Decoding random binary linear codes in 2 n\/20: How 1 + 1 = 0 improves information set decoding","volume":"7237","author":"becker","year":"2012","journal-title":"EUROCRYPT 2012 ser LNCS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595332"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_42"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536421"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.992777"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875000"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.806118"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"},{"key":"ref20","author":"erdos","year":"1974","journal-title":"Probabilistic Methods in Combinatorics"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820012"},{"key":"ref21","first-page":"50","article-title":"Weight distributions: How deviant can you be?","author":"di","year":"0","journal-title":"Proc Int Symp Information Theory (ISIT 2001) Washington DC"},{"key":"ref24","first-page":"50","article-title":"On minimum distance decoding of linear codes","author":"dumer","year":"1991","journal-title":"Fifth Soviet-Swedish intern workshop Information theory"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0019850"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_6"},{"key":"ref25","first-page":"649","article-title":"Complexity issues in coding theory","author":"barg","year":"1998","journal-title":"Handbook of Coding Theory"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541755.pdf?arnumber=7541755","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:51:21Z","timestamp":1774986681000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541755\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541755","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}