{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:19Z","timestamp":1773377659933,"version":"3.50.1"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174480","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"2688-2693","source":"Crossref","is-referenced-by-count":6,"title":["CodNN \u2013 Robust Neural Networks From Coded Classification"],"prefix":"10.1109","author":[{"given":"Netanel","family":"Raviv","sequence":"first","affiliation":[{"name":"Washington University in St. Louis,Department of Computer Science and Engineering,St. Louis,MO,USA,63130"}]},{"given":"Siddharth","family":"Jain","sequence":"additional","affiliation":[{"name":"California Institute of Technology,Department of Electrical Engineering,Pasadena,CA,USA,91125"}]},{"given":"Pulakesh","family":"Upadhyaya","sequence":"additional","affiliation":[{"name":"Texas A&M University,Department of Computer Science and Engineering,TX,USA"}]},{"given":"Jehoshua","family":"Bruck","sequence":"additional","affiliation":[{"name":"California Institute of Technology,Department of Electrical Engineering,Pasadena,CA,USA,91125"}]},{"given":"Anxiao Andrew","family":"Jiang","sequence":"additional","affiliation":[{"name":"Texas A&M University,Department of Computer Science and Engineering,TX,USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2844341"},{"key":"ref11","article-title":"The Principle of Majority Decision Logical Elements and the Complexity of their Circuits","author":"muroga","year":"1959","journal-title":"IFIP Congress"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1515\/9781400882618-003"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/72.363479"},{"key":"ref15","article-title":"A simple explanation for the existence of adversarial examples with small hamming distance","author":"shamir","year":"2019"},{"key":"ref16","article-title":"Intriguing Properties of Neural Networks","author":"szegedy","year":"2013"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2742698"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2017.39"},{"key":"ref3","article-title":"Explaining and Harnessing Adversarial Examples","author":"goodfellow","year":"2015","journal-title":"International Conference on Learning Representations (ICLR)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/DFTVS.1994.630028"},{"key":"ref5","first-page":"4107","article-title":"Binarized Neural Networks","author":"hubara","year":"2016","journal-title":"Proc Neural Information Processing Systems (NIPS)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1006\/jmaa.1997.5453"},{"key":"ref7","article-title":"Towards Deep Learning Models Resistant to Adversarial Attacks","author":"madry","year":"2018","journal-title":"International Conference on Learning Representations (ICLR)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00175"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.66"},{"key":"ref9","first-page":"125","article-title":"The easiest hard problem: Number partitioning","volume":"125","author":"mertens","year":"2006","journal-title":"Computational Complexity and Statistical Physics"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174480.pdf?arnumber=9174480","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:46Z","timestamp":1773347686000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174480\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174480","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}