TY - GEN
T1 - Results on combinatorial joint source-channel coding
AU - Kochman, Yuval
AU - Mazumdar, Arya
AU - Polyanskiy, Yury
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84873154187&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84873154187&partnerID=8YFLogxK
U2 - 10.1109/ITW.2012.6404637
DO - 10.1109/ITW.2012.6404637
M3 - Conference contribution
AN - SCOPUS:84873154187
SN - 9781467302234
T3 - 2012 IEEE Information Theory Workshop, ITW 2012
SP - 10
EP - 14
BT - 2012 IEEE Information Theory Workshop, ITW 2012
T2 - 2012 IEEE Information Theory Workshop, ITW 2012
Y2 - 3 September 2012 through 7 September 2012
ER -