{"630494":{"#nid":"630494","#data":{"type":"event","title":"Ph.D. Dissertation Defense - Ishaque Kadampot","body":[{"value":"\u003Cp\u003E\u003Cstrong\u003ETitle\u003C\/strong\u003E\u003Cem\u003E:\u0026nbsp; \u003C\/em\u003E\u003Cem\u003EOptimal Codes For Information-theoretically Covert Communication\u003C\/em\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003ECommittee:\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003EDr. Matthieu Bloch, ECE, Chair , Advisor\u003C\/p\u003E\r\n\r\n\u003Cp\u003EDr. John Barry, ECE\u003C\/p\u003E\r\n\r\n\u003Cp\u003EDr. Stephen Ralph, ECE\u003C\/p\u003E\r\n\r\n\u003Cp\u003EDr. Faramarz Fekri, ECE\u003C\/p\u003E\r\n\r\n\u003Cp\u003EDr. Yao Xie, ISyE\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EAbstract:\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003EWe consider a problem of coding for covert communication, which involves ensuring reliable communication between two legitimate parties while simultaneously guaranteeing a low probability of detection by an eavesdropper. Specifically, we develop an optimal low-complexity coding scheme that achieves the information-theoretic limits of covert communication over binary-input discrete memoryless channels. We first demonstrate the non-triviality of designing codes for covert communication by showing the impossibility of achieving information-theoretic limits using linear codes without a shared secret key for a regime in which information theory proves the possibility of covert communication without a secret key. We then circumvent this impossibility by introducing non-linearity into the coding scheme through the use of pulse position modulation (PPM) and multilevel coding (MLC). This MLC-PPM scheme exhibits several appealing properties; in particular, for an appropriate decoder, the channel at a given level is independent of the total number of levels and the codeword length. We exploit these properties to show how one can use families of channel capacity- and channel resolvability-achieving codes to concretely instantiate a covert communication scheme.\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Optimal Codes For Information-theoretically Covert Communication "}],"uid":"28475","created_gmt":"2020-01-04 19:04:15","changed_gmt":"2020-01-06 12:36:54","author":"Daniela Staiculescu","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2020-01-08T14:30:00-05:00","event_time_end":"2020-01-08T16:00:00-05:00","event_time_end_last":"2020-01-08T16:00:00-05:00","gmt_time_start":"2020-01-08 19:30:00","gmt_time_end":"2020-01-08 21:00:00","gmt_time_end_last":"2020-01-08 21:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"434381","name":"ECE Ph.D. Dissertation Defenses"}],"categories":[],"keywords":[{"id":"100811","name":"Phd Defense"},{"id":"1808","name":"graduate students"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1788","name":"Other\/Miscellaneous"}],"invited_audience":[{"id":"78771","name":"Public"}],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}}}