2009/02/19 by Arunkumar Subramanian, Steven W. McLaughlin, Stephen McLaughlin +2 · 1 citation
Computer Science · Engineering · Mathematics · #Cellular Automata and Applications #Chaos-based Image/Signal Encryption #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.0902.3286
Submitted to the 2009 IEEE International Symposium on Information Theory
arxiv created 2009/02/19 · openalex publication_date 2009/02/19 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper considers the problem of perfectly secure communication on a modified version of Wyner's wiretap channel II where both the main and wiretapper's channels have some erasures. A secret message is to be encoded into n channel symbols and transmitted. The main channel is such that the legitimate receiver receives the transmitted codeword with exactly n - ν erasures, where the positions of the erasures are random. Additionally, an eavesdropper (wire-tapper) is able to observe the transmitted codeword with n - μ erasures in a similar fashion. This paper studies the maximum achievable information rate with perfect secrecy on this channel and gives a coding scheme using nested codes that achieves the secrecy capacity.