{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:56:59Z","timestamp":1729637819112,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8007113","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"3165-3169","source":"Crossref","is-referenced-by-count":1,"title":["Explicit bounds on the length of optimal X-codes"],"prefix":"10.1109","author":[{"given":"Yu","family":"Tsunoda","sequence":"first","affiliation":[]},{"given":"Yuichiro","family":"Fujiwara","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"166","article-title":"Bounds on the length of disjunctive codes","volume":"18","author":"d'yachkov","year":"1982","journal-title":"Probl Contr Inf Theory"},{"journal-title":"The Probabilistic Method","year":"2016","author":"alon","key":"ref11"},{"key":"ref12","first-page":"1","article-title":"Lovász Local Lemma - a survey","volume":"7913","author":"szegedy","year":"2013","journal-title":"Computer Science - Theory and Applications Proceedings of the 8th International Computer Science Symposium in Russia ser Lecture Notes in Computer Science"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/100799642"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2245939"},{"journal-title":"Bounds on separating redundancy","year":"2016","author":"tsunoda","key":"ref16"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02772959"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(95)00296-9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.823341"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2003.1188267"},{"key":"ref8","first-page":"101","article-title":"Analysis and design of optimal combinational compactors","author":"wohl","year":"2003","journal-title":"Proc 21st IEEE VLSI Test Symp"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2005.154"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"ref1","article-title":"X-codes: Theory and applications of unknowable inputs","author":"lumetta","year":"2003","journal-title":"Center for Reliable and High-Performance Computing Univ of Illinois at Urbana Champaign Tech Rep CRHC-03–08 (also UILU-ENG-03-2217)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048468"}],"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\/08007113.pdf?arnumber=8007113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T14:58:42Z","timestamp":1602860322000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8007113\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8007113","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}