Results on combinatorial joint source-channel coding

Author(s)
Kochman, Yuval; Mazumdar, Arya; Polyanskiy, Yury
Thumbnail
Downloadjscc_itw.pdf (158.3Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/
Metadata
Show full item record
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.
Date issued
2012-09
URI
http://hdl.handle.net/1721.1/78937
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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
ISBN
978-1-4673-0224-1
Collections