Combinatorial joint source-channel coding
Name
927348900-MIT.pdf
Description
Full printable version
Size
3.17 MB
Format
Adobe PDF
Checksum (MD5)
d15b4798bdafb039b8cc23034121f293
Author(s)
Young, Andrew John, S.M. Massachusetts Institute of Technology
Advisor(s)
Yury Polyanskiy.
Alternative Title
Combinatorial JSCC
Date Issued
2015
Publisher
Massachusetts Institute of Technology
Abstract
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).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
