{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:01:46Z","timestamp":1774990906932,"version":"3.50.1"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"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,9]]},"DOI":"10.1109\/allerton.2019.8919845","type":"proceedings-article","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T04:23:39Z","timestamp":1575606219000},"page":"1082-1089","source":"Crossref","is-referenced-by-count":5,"title":["One-shot achievability and converse bounds of Gaussian random coding in AWGN channels under covert constraint"],"prefix":"10.1109","author":[{"given":"Xinchun","family":"Yu","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University,School of Electronic Information and Electrical Engineering,Shanghai,China"}]},{"given":"Shuangqing","family":"Wei","sequence":"additional","affiliation":[{"name":"Louisiana State University,School of Electrical Engineering and Computer Science,Baton Rouge,USA"}]},{"given":"Yuan","family":"Luo","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University,School of Electronic Information and Electrical Engineering,Shanghai,China"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620765"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2548471"},{"key":"ref10","author":"lehmann","year":"2005","journal-title":"Testing Statistical Hypotheses"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541694"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.804056"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CNS.2017.8228657"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref7","article-title":"First and Second Order Asymptotics in Covert Communications","author":"tahmasbi","year":"2018","journal-title":"IEEE Trans Inf Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2530089"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919845"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130923"}],"event":{"name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2019,9,24]]},"end":{"date-parts":[[2019,9,27]]}},"container-title":["2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8911248\/8919648\/08919845.pdf?arnumber=8919845","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:52:19Z","timestamp":1774986739000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8919845\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/allerton.2019.8919845","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}