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
Multi-stage coding for channels with a rewrite option and reversible input
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
2012 (English)In: Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, IEEE , 2012, 3063-3067 p.Conference paper, Published paper (Refereed)
Abstract [en]

We consider a problem of constrained multi-stage coding for channels with a rewrite option. It is a natural extension of Weissman's channels with action-dependent states to the multistage coding case where an encoder in each stage observes its own message as well as all previous-stage messages, inputs, and outputs. In addition to decoding all messages at the final stage, the new reconstruction constraint introduced in Sumszyk and Steinberg's information embedding with reversible stegotext is imposed on the problem such that the decoder is required to be able to reconstruct all channel input sequences reliably. The complete characterization of the channel capacity region is given for the two-stage case, while the inner and outer bounds to the capacity regions for the cases of three or more stages are provided. For the two-stage case, a discussion regarding the rate constraint of the message in the second stage is also given in which we can draw a connection to the two-stage coding condition which appears in our previous study on channel with action-dependent state and reversible input.

Place, publisher, year, edition, pages
IEEE , 2012. 3063-3067 p.
Series
IEEE International Symposium on Information Theory - Proceedings
Keyword [en]
Capacity regions, Channel capacity region, Channel inputs, Information embedding, Multi-stage, Natural extension, Outer bounds, Rate constraints
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-104967DOI: 10.1109/ISIT.2012.6284125ISI: 000312544303032Scopus ID: 2-s2.0-84867546358ISBN: 978-146732579-0 (print)OAI: oai:DiVA.org:kth-104967DiVA: diva2:570317
Conference
2012 IEEE International Symposium on Information Theory, ISIT 2012, 1 July 2012 through 6 July 2012, Cambridge, MA
Funder
ICT - The Next Generation
Note

QC 20121119

Available from: 2012-11-19 Created: 2012-11-14 Last updated: 2013-04-15Bibliographically 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
Kittichokechai, KittipongOechtering, Tobias J.Skoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 72 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