Universal Decoding for Asynchronous Slepian-Wolf Encoding

Research output: Contribution to journalArticlepeer-review


We consider the problem of (almost) lossless source coding of two correlated memoryless sources using separate encoders and a joint decoder, that is, Slepian-Wolf (S-W) coding. In our setting, the encoding and decoding are asynchronous, i.e., there is a certain relative delay between the two sources. Neither the source parameters nor the relative delay are known to the encoders and the decoder. Since we assume that both encoders implement standard random binning, which does not require such knowledge anyway, the focus of this work is on the decoder. Our main contribution is in proposing a universal decoder, that independent of the unknown source parameters and the relative delay, and at the same time, is asymptotically as good as the optimal maximum a posteriori probability (MAP) decoder in the sense of the random coding error exponent achieved. Consequently, the achievable rate region is also the same as if the source parameters and the delay were known to the decoder.

Original languageEnglish
Article number9310221
Pages (from-to)2652-2662
Number of pages11
JournalIEEE Transactions on Information Theory
Issue number5
StatePublished - May 2021


  • Slepian-Wolf coding
  • asynchronous coding
  • delay
  • error exponent
  • universal decoding

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Universal Decoding for Asynchronous Slepian-Wolf Encoding'. Together they form a unique fingerprint.

Cite this