Abstract
If the warden Willie attempting to detect the transmission knows the statistics of his receiver noise, Alice can transmit no more than O(√n) covert bits reliably to Bob in n channel uses of an AWGN channel. However, if Willie does not know his noise statistics exactly, Alice can covertly transmit O(n) bits. In this letter, Willie lacks knowledge of his channel statistics but observes T(n) length-n codeword slots, where some number may be used by Alice to attempt covert transmission. We show that Willie can often limit Alice to the same performance scaling as when he knows his channel statistics.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
