Results on combinatorial joint source-channel coding

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...

Full description

Bibliographic Details
Main Authors: Kochman, Yuval, Mazumdar, Arya, Polyanskiy, Yury
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers 2013
Online Access:http://hdl.handle.net/1721.1/78937
https://orcid.org/0000-0002-2109-0979
_version_ 1826192570629226496
author Kochman, Yuval
Mazumdar, Arya
Polyanskiy, Yury
author2 Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
author_facet Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Kochman, Yuval
Mazumdar, Arya
Polyanskiy, Yury
author_sort Kochman, Yuval
collection MIT
description 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.
first_indexed 2024-09-23T09:22:02Z
format Article
id mit-1721.1/78937
institution Massachusetts Institute of Technology
language en_US
last_indexed 2024-09-23T09:22:02Z
publishDate 2013
publisher Institute of Electrical and Electronics Engineers
record_format dspace
spelling mit-1721.1/789372022-09-30T14:16:36Z Results on combinatorial joint source-channel coding Kochman, Yuval Mazumdar, Arya Polyanskiy, Yury Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Mazumdar, Arya Polyanskiy, Yury 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. National Science Foundation (U.S.) (CCF-0939370) 2013-05-24T18:27:10Z 2013-05-24T18:27:10Z 2012-09 Article http://purl.org/eprint/type/ConferencePaper 978-1-4673-0224-1 http://hdl.handle.net/1721.1/78937 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. https://orcid.org/0000-0002-2109-0979 en_US http://dx.doi.org/10.1109/ITW.2012.6404637 2012 IEEE Information Theory Workshop Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/ application/pdf Institute of Electrical and Electronics Engineers Polyanskiy via Amy Stout
spellingShingle Kochman, Yuval
Mazumdar, Arya
Polyanskiy, Yury
Results on combinatorial joint source-channel coding
title Results on combinatorial joint source-channel coding
title_full Results on combinatorial joint source-channel coding
title_fullStr Results on combinatorial joint source-channel coding
title_full_unstemmed Results on combinatorial joint source-channel coding
title_short Results on combinatorial joint source-channel coding
title_sort results on combinatorial joint source channel coding
url http://hdl.handle.net/1721.1/78937
https://orcid.org/0000-0002-2109-0979
work_keys_str_mv AT kochmanyuval resultsoncombinatorialjointsourcechannelcoding
AT mazumdararya resultsoncombinatorialjointsourcechannelcoding
AT polyanskiyyury resultsoncombinatorialjointsourcechannelcoding