Results on combinatorial joint source-channel coding
Author(s)Kochman, Yuval; Mazumdar, Arya; Polyanskiy, Yury
MetadataShow full item record
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.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2012 IEEE Information Theory Workshop
Institute of Electrical and Electronics Engineers
Kochman, Yuval, Arya Mazumdar, and Yury Polyanskiy. Results on Combinatorial Joint Source-channel Coding. In 2012 IEEE Information Theory Workshop, 10-14. Institute of Electrical and Electronics Engineers, 2012. doi:10.1109/ITW.2012.6404637.
Author's final manuscript