{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:40Z","timestamp":1759063600987,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006811","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"1658-1662","source":"Crossref","is-referenced-by-count":8,"title":["An improved bound on the zero-error list-decoding capacity of the 4\/3 channel"],"prefix":"10.1109","author":[{"given":"Marco","family":"Dalai","sequence":"first","affiliation":[]},{"given":"Venkatesan Guruswami","family":"Carnegie","sequence":"additional","affiliation":[]},{"given":"Jaikumar","family":"Radhakrishnan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(77)90083-8"},{"key":"ref11","first-page":"411","article-title":"Coding of an information source having ambiguous alphabet and the entropy of graphs","author":"k\u00f6rner","year":"1973","journal-title":"Trans 6th Prague Conf Information Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/0607062"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90002-Y"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(88)80048-9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.21233"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.335947"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0605009"},{"key":"ref8","first-page":"770","article-title":"Complexity of contact circuits realizing a function of logical algebra","volume":"8","author":"krichevskii","year":"1964","journal-title":"Sov Phys Dokl"},{"key":"ref7","first-page":"6037","article-title":"Nombre minimal de contacts de fermature nécessaires pour réaliser une fonction booléenne symétrique de $n$ variables","author":"hansel","year":"1964","journal-title":"C R A cad Sci Paris"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055985"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"ref9","first-page":"23","article-title":"On a problem of graph theory","volume":"2","author":"katona","year":"1967","journal-title":"Studia Sci Math Hungarica"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006811.pdf?arnumber=8006811","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T14:29:36Z","timestamp":1513175376000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006811\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006811","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}