liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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
Successive Encoding of Correlated Sources
Linköping University, Department of Electrical Engineering. Linköping University, The Institute of Technology.
Bell Laboratories, Murray Hill, USA / Mathematical Institute of the Hungari an Academy of Sciences, Budapest, Hungary.
1982 (English)Report (Other academic)
Abstract [en]

The encoding of a discrete memoryless multiple source  for reconstruction of a sequence  with  is considered. We require that the encoding should be such that  is encoded first without any consideration of  , while in a seeond part of the encoding this latter sequence is encoded based on knowledge of the outcome of the first encoding. The resulting scheme is called successive encoding. We find general outer and inner bounds for the corresponding set of achievable rates along with a complete single letter characterization for the special case  . Comparisons with the Slepian-Wolf problem [3] and the Ahlswede-Körner-Wyner side information problem [2 ], [9) are carried out.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 1982. , 23 p.
Series
LiTH-ISY-I, ISSN 0281-6253 ; 505
National Category
Computational Mathematics Telecommunications Discrete Mathematics Signal Processing Communication Systems
Identifiers
URN: urn:nbn:se:liu:diva-131840ISRN: LiTH-ISY-I-505OAI: oai:DiVA.org:liu-131840DiVA: diva2:1033964
Available from: 2016-10-10 Created: 2016-10-10 Last updated: 2016-10-10Bibliographically approved

Open Access in DiVA

Successive Encoding of Correlated Sources(3046 kB)30 downloads
File information
File name FULLTEXT02.pdfFile size 3046 kBChecksum SHA-512
46881e6e37d054f96cc436a9aaa52ba19c0ac523d5020fd5c2def088e4ecd607704369d1d56d184bd309786422f42aa14404057f724510651bb0bf7a44eb2200
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Eriksson, T.
By organisation
Department of Electrical EngineeringThe Institute of Technology
Computational MathematicsTelecommunicationsDiscrete MathematicsSignal ProcessingCommunication Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 30 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 22 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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