Combinatorial joint source-channel coding
Author(s)
Young, Andrew John, S.M. Massachusetts Institute of Technology![Thumbnail](/bitstream/handle/1721.1/99830/927348900-MIT.pdf.jpg?sequence=3&isAllowed=y)
DownloadFull printable version (3.170Mb)
Alternative title
Combinatorial JSCC
Other Contributors
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Advisor
Yury Polyanskiy.
Terms of use
Metadata
Show full item recordAbstract
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.
Description
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015. Cataloged from PDF version of thesis. Includes bibliographical references (pages 73-74).
Date issued
2015Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer SciencePublisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.