{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:46:36Z","timestamp":1730274396230,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513328","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T15:57:25Z","timestamp":1282233445000},"page":"310-314","source":"Crossref","is-referenced-by-count":0,"title":["Gaussian causal dirty paper capacity is at most log (1 + SNR over e)"],"prefix":"10.1109","author":[{"given":"Mustafa","family":"Kesal","sequence":"first","affiliation":[]},{"given":"Uri","family":"Erez","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Channel coding in the presence of side information","volume":"4","author":"keshet","year":"2007","journal-title":"Foundations and Trends in Communications and Information Theory"},{"key":"ref11","article-title":"Gaussian causal dirty paper capacity is at most $\\log(1+{{\\rm SNR}\\over{e}})$","author":"kesal","year":"0","journal-title":"IEEE Transactions on Information Theory"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref12"},{"journal-title":"Inequalities","year":"1934","author":"hardy","key":"ref13"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056659"},{"key":"ref3","first-page":"19","article-title":"Coding for channels with random parameters","volume":"9","author":"gel'fand","year":"1980","journal-title":"Problems of Control and Inform Theory"},{"key":"ref6","article-title":"Fundamentals of Watermarking and Data Hiding","author":"moulin","year":"2004","journal-title":"ICIP Tutorial"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856935"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261631"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2003.809366"},{"key":"ref2","first-page":"52","article-title":"Coding in memories with defective cells","volume":"10","author":"kuznetsov","year":"1974","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.24.0289"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261632"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513328.pdf?arnumber=5513328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T16:38:34Z","timestamp":1489855114000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513328\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513328","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}