Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Secure Successive Refinement with Degraded Side Information
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-0036-9049
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-7926-5081
2014 (English)In: 2014 IEEE International Symposium on Information Theory (ISIT), IEEE , 2014, 2674-2678 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.
Series
IEEE International Symposium on Information Theory - Proceedings, ISSN 2157-8095
Keyword [en]
Markov processes, Binary sources, Coding scheme, Layered coding, Side information, Successive refinement
National Category
Computer and Information Science Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-160808DOI: 10.1109/ISIT.2014.6875319ISI: 000346496102163Scopus ID: 2-s2.0-84906536027ISBN: 978-1-4799-5186-4 (print)OAI: oai:DiVA.org:kth-160808DiVA: diva2:791243
Conference
2014 IEEE International Symposium on Information Theory, ISIT 2014, Honolulu, HI, United States, 29 June 2014 through 4 July 2014
Note

QC 20150227

Available from: 2015-02-27 Created: 2015-02-27 Last updated: 2016-12-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Oechtering, Tobias J.Skoglund, Mikael

Search in DiVA

By author/editor
Xu, DerekKittichokechai, KittipongOechtering, Tobias J.Skoglund, Mikael
By organisation
ACCESS Linnaeus CentreCommunication Theory
Computer and Information ScienceElectrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 41 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf