{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:58:03Z","timestamp":1773377883236,"version":"3.50.1"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849435","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2169-2173","source":"Crossref","is-referenced-by-count":19,"title":["Embedding Covert Information on a Given Broadcast Code"],"prefix":"10.1109","author":[{"given":"David","family":"Kibloff","sequence":"first","affiliation":[{"name":"Laboratoire CITI, a joint laboratory between the Institut National de Recherche en Informatique et en Automatique (INRIA), the Universit&#x00E9; de Lyon and the Institut National de Sciences Apliqu&#x00E9;es (INSA) de Lyon, Villeurbanne, 69621, France"}]},{"given":"Samir M.","family":"Perlaza","sequence":"additional","affiliation":[{"name":"Laboratoire CITI, a joint laboratory between the Institut National de Recherche en Informatique et en Automatique (INRIA), the Universit&#x00E9; de Lyon and the Institut National de Sciences Apliqu&#x00E9;es (INSA) de Lyon, Villeurbanne, 69621, France"}]},{"given":"Ligong","family":"Wang","sequence":"additional","affiliation":[{"name":"Laboratoire ETIS, a joint laboratory between the Universit&#x00E9; Paris Seine, Universit&#x00E9; de Cergy-Pontoise, ENSEA and CNRS, Cergy-Pontoise, 95014, France"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2548471"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2530089"},{"key":"ref10","author":"fano","year":"1961","journal-title":"Transmission of Information A Statistical Theory of Communication"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8278022"},{"key":"ref5","article-title":"Time-division transmission is optimal for covert communication over broadcast channels","author":"tan","year":"2017"},{"key":"ref8","article-title":"Second-order asymptotics in covert communication","author":"tahmasbi","year":"2017"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2907190"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620765"},{"key":"ref9","first-page":"9249","article-title":"Broadcast codes can be enhanced to perform covert communications","author":"kibloff","year":"2019","journal-title":"INRIA Grenoble - Rh&#x00F4;ne-Alpes Tech Rep"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130923"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849435.pdf?arnumber=8849435","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:27Z","timestamp":1773347727000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849435\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849435","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}