DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cho, Kang-Hee | ko |
dc.contributor.author | Lee, Si-Hyeon | ko |
dc.date.accessioned | 2020-11-30T06:10:18Z | - |
dc.date.available | 2020-11-30T06:10:18Z | - |
dc.date.created | 2020-11-24 | - |
dc.date.created | 2020-11-24 | - |
dc.date.issued | 2020-06-22 | - |
dc.identifier.citation | 2020 IEEE International Symposium on Information Theory, ISIT 2020, pp.816 - 821 | - |
dc.identifier.uri | http://hdl.handle.net/10203/277730 | - |
dc.description.abstract | In this paper, the covert communication scenario over K-user-pair discrete memoryless interference channels with a warden is studied. We assume that the wardens channel output distribution induced by K "off input symbols, which are sent when no communication occurs, is not a convex combination of those induced by any other combination of input symbols (otherwise, the square-root law does not hold). We derive the exact covert capacity region and show that a simple point-topoint based scheme with treating interference as noise is optimal. In addition, we analyze the secret key length required for the reliable and covert communication with the desired rates, and present a channel condition where the secret key between each user pair is unnecessary. | - |
dc.language | English | - |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
dc.title | Treating Interference as Noise is Optimal for Covert Communication over Interference Channels | - |
dc.type | Conference | - |
dc.identifier.wosid | 000714963400140 | - |
dc.identifier.scopusid | 2-s2.0-85089943717 | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 816 | - |
dc.citation.endingpage | 821 | - |
dc.citation.publicationname | 2020 IEEE International Symposium on Information Theory, ISIT 2020 | - |
dc.identifier.conferencecountry | US | - |
dc.identifier.conferencelocation | Virtual | - |
dc.identifier.doi | 10.1109/ISIT44484.2020.9174271 | - |
dc.contributor.localauthor | Lee, Si-Hyeon | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.