Results on combinatorial joint source-channel coding
Name
jscc_itw.pdf
Size
158.3 KB
Format
Adobe PDF
Checksum (MD5)
3c66b0bf89906fdd451f8facacae139d
Author(s)
Kochman, Yuval
Mazumdar, Arya
Polyanskiy, Yury
Date Issued
September 2012
Journal
2012 IEEE Information Theory Workshop
Publisher
Institute of Electrical and Electronics Engineers
Citation
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.
Version
Author's final manuscript
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ITW.2012.6404637
