{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T06:31:24Z","timestamp":1725431484585},"reference-count":3,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/isit.2004.1365550","type":"proceedings-article","created":{"date-parts":[[2004,12,23]],"date-time":"2004-12-23T09:34:17Z","timestamp":1103794457000},"page":"513-513","source":"Crossref","is-referenced-by-count":4,"title":["Binary shaping for low-duty-cycle communications"],"prefix":"10.1109","author":[{"given":"R.J.","family":"Barron","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref3","first-page":"809","article-title":"Coding Schemes for the Binary Symmetric Channel with Known Interference","author":"caire","year":"2003","journal-title":"41st Allerton Conference"},{"key":"ref2","article-title":"Approaching the Dirty Paper Limit for Cancelling Known Interference","author":"erez","year":"2003","journal-title":"41st Allerton Conference"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.810639"}],"event":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","location":"Chicago, Illinois, USA"},"container-title":["International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9423\/29909\/01365550.pdf?arnumber=1365550","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T02:56:06Z","timestamp":1489460166000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1365550\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":3,"URL":"https:\/\/doi.org\/10.1109\/isit.2004.1365550","relation":{},"subject":[]}}