{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:55:12Z","timestamp":1773377712449,"version":"3.50.1"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834785","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2696-2701","source":"Crossref","is-referenced-by-count":0,"title":["Learning to Broadcast with Layered Division Multiplexing"],"prefix":"10.1109","author":[{"given":"Roy","family":"Karasik","sequence":"first","affiliation":[{"name":"Technion,Department of Electrical and Computer Engineering,Haifa,Israel,32000"}]},{"given":"Osvaldo","family":"Simeone","sequence":"additional","affiliation":[{"name":"King&#x2019;s College London,King&#x2019;s Communications, Learning &amp; Information Processing (KCLIP) Lab, Centre for Telecommunications Research,Department of Engineering,London,U.K.,WC2R 2LS"}]},{"given":"Shlomo","family":"Shamai Shitz","sequence":"additional","affiliation":[{"name":"Technion,Department of Electrical and Computer Engineering,Haifa,Israel,32000"}]}],"member":"263","reference":[{"key":"ref10","first-page":"111","article-title":"Optimal rate allocation for superposition coding in quasi-static fading channels","author":"liu","year":"2002","journal-title":"Proc IEEE Int Symp Inform Theory (ISIT)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2865408"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SAM48682.2020.9104259"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2009.080850"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.2612"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2933515"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3026386"},{"key":"ref19","article-title":"Learning to broadcast for ultra-reliable communication with differential quality of service via the conditional value at risk","author":"karasik","year":"2021","journal-title":"arXiv preprint arXiv 2112 06814"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TBC.2015.2505408"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046220"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ECMSM.2017.7945910"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TBC.2015.2492459"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3023275"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITST.2017.7972212"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TBC.2015.2459665"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.3390\/e23010120"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.817834"},{"key":"ref20","article-title":"Generalization bounds and algorithms for learning to communicate over additive noise channels","author":"weinberger","year":"2021","journal-title":"IEEE Trans Inf Theory"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834785.pdf?arnumber=9834785","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:56Z","timestamp":1773347696000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834785\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834785","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}