Results on combinatorial joint source-channel coding

Yuval Kochman*, Arya Mazumdar, Yury Polyanskiy

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Scopus citations

Abstract

This paper continues the investigation of the combinatorial formulation of the joint source-channel coding problem. In particular, the connections are drawn to error-reducing codes, isometric embeddings and list-decodable codes. The optimal performance for the repetition construction is derived and is shown to be achievable by low complexity Markov decoders. The compound variation of the problem is proposed and some initial results are put forward.

Original languageAmerican English
Title of host publication2012 IEEE Information Theory Workshop, ITW 2012
Pages10-14
Number of pages5
DOIs
StatePublished - 2012
Event2012 IEEE Information Theory Workshop, ITW 2012 - Lausanne, Switzerland
Duration: 3 Sep 20127 Sep 2012

Publication series

Name2012 IEEE Information Theory Workshop, ITW 2012

Conference

Conference2012 IEEE Information Theory Workshop, ITW 2012
Country/TerritorySwitzerland
CityLausanne
Period3/09/127/09/12

Fingerprint

Dive into the research topics of 'Results on combinatorial joint source-channel coding'. Together they form a unique fingerprint.

Cite this