Secure Successive Refinement with Degraded Side Information
2014 (English)In: 2014 IEEE International Symposium on Information Theory (ISIT), IEEE , 2014, 2674-2678 p.Conference paper (Refereed)
In this paper, we investigate the problem of successive refinement with side information (SI) under secrecy constraint. In particular, under classical successive refinement coding scheme, there are degraded SI sequences Y-n and Z(n) at two decoders and E-n at the eavesdropper. Based on the status of two switches, three different cases are investigated. In case 1 and 3, the eavesdropper only observes output of encoder 1 and 2, respectively, while in case 2, the eavesdropper observes outputs of both encoder 1 and 2. The Markov chain X - Y - (Z, E) holds in all cases. The equivocation is measured by the normalized entropy of source sequence conditioned on the observation of eavesdropper. We completely characterize the rate-distortion-equivocation regions for all three cases, and show that layered coding is optimal. Finally, a binary source example is given.
Place, publisher, year, edition, pages
IEEE , 2014. 2674-2678 p.
, IEEE International Symposium on Information Theory - Proceedings, ISSN 2157-8095
Markov processes, Binary sources, Coding scheme, Layered coding, Side information, Successive refinement
Computer and Information Science Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-160808DOI: 10.1109/ISIT.2014.6875319ISI: 000346496102163ScopusID: 2-s2.0-84906536027ISBN: 978-1-4799-5186-4OAI: oai:DiVA.org:kth-160808DiVA: diva2:791243
2014 IEEE International Symposium on Information Theory, ISIT 2014, Honolulu, HI, United States, 29 June 2014 through 4 July 2014
QC 201502272015-02-272015-02-272015-02-27Bibliographically approved