DocumentCode :
588247
Title :
Results on combinatorial joint source-channel coding
Author :
Kochman, Yuval ; Mazumdar, Arya ; Polyanskiy, Yury
Author_Institution :
Sch. of Comput. Sci. & Eng., Hebrew Univ. of Jerusalem, Jerusalem, Israel
fYear :
2012
fDate :
3-7 Sept. 2012
Firstpage :
10
Lastpage :
14
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.
Keywords :
combined source-channel coding; error correction codes; combinatorial joint source-channel coding; error-reducing codes; isometric embeddings; list-decodable codes; low complexity Markov decoders; repetition construction; Compounds; Conferences; Decoding; Encoding; Error correction codes; Markov processes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop (ITW), 2012 IEEE
Conference_Location :
Lausanne
Print_ISBN :
978-1-4673-0224-1
Electronic_ISBN :
978-1-4673-0222-7
Type :
conf
DOI :
10.1109/ITW.2012.6404637
Filename :
6404637
Link To Document :
بازگشت