Combinatorial joint source-channel coding

Traditional error correction and source coding has focused on the stochastic setting where separation based schemes are optimal, and current solutions for applications requiring both lossy compression and noise resilience reflect this approach. However, in the adversarial setting, with worst case errors, separation based schemes are far from being even asymptotically optimal. This work investigates fundamental limits, achievability and converse bounds, practical codes, and algorithms for joint source channel coding (JSCC) in the adversarial setting. Particular attention is paid to the cases of flip and erasure errors.

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2015

Author dc:creator

• Young, Andrew John, S.M. Massachusetts Institute of Technology

Advisor dc:contributor.advisor

• Yury Polyanskiy.

• Electrical Engineering and Computer Science.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/99830

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/99830