{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:24Z","timestamp":1759638444165},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1109\/tit.2009.2034813","type":"journal-article","created":{"date-parts":[[2010,1,7]],"date-time":"2010-01-07T16:40:32Z","timestamp":1262882432000},"page":"350-366","source":"Crossref","is-referenced-by-count":20,"title":["Silence-Based Communication"],"prefix":"10.1109","volume":"56","author":[{"given":"Anand K.","family":"Dhulipala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christina","family":"Fragouli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alon","family":"Orlitsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/0406009"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1051"},{"key":"ref12","article-title":"simultaneous messages vs. communication","author":"babai","year":"1995","journal-title":"Proc 12th Symp Theoretical Aspects of Computer Science"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/7.18637"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1016\/j.jpdc.2004.04.002","article-title":"distributed computing paradigms for collaborative signal and information processing in sensor networks","volume":"64","author":"xu","year":"2004","journal-title":"J Parallel Distrib Comput"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365156"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843543"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/WIOPT.2006.1666455"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2006.03.022"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IREPGIT.1954.6373407"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574948"},{"key":"ref27","first-page":"92","article-title":"bounds on the expected cost of one-to-one codes","author":"savari","year":"2004","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"ref3","first-page":"16","author":"orlitsky","year":"1986","journal-title":"Complexity in Information Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63514"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90037-X"},{"key":"ref8","author":"graham","year":"1990","journal-title":"Ramsey Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(92)90047-M"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808737"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.22"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932395"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321883"},{"key":"ref21","first-page":"460","article-title":"a linear-time ordering procedure with applications to variable length encoding","author":"cot","year":"1974","journal-title":"Proc 8th Princeton Conf Information Sciences and Systems"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(71)90155-0"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/321592.321601"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.57201"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/TIT.1961.1057615","article-title":"minimum-redundancy coding for the discrete noiseless channel","volume":"it 7","author":"karp","year":"1961","journal-title":"IRE Trans Inf Theory"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5361455\/05361506.pdf?arnumber=5361506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:00:35Z","timestamp":1633914035000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5361506\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":28,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2009.2034813","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}