2026-09-19T04:07:12Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/998302022-01-13T07:54:01Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Yury Polyanskiy.
Young, Andrew John, S.M. Massachusetts Institute of Technology
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2015-11-09T19:51:36Z
2015-11-09T19:51:36Z
2015
2015
http://hdl.handle.net/1721.1/99830
927348900
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).
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.
by Andrew John Young.
S.M.
74 pages
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Combinatorial joint source-channel coding
Combinatorial JSCC
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="7b228d70-17ed-43b7-adc7-1d5e4ba72dbb">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Combinatorial joint source-channel coding</Title>
<Subtitle>Combinatorial JSCC</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2015</PublicationDate>
<Authors>
<Author>
<DisplayName>Young, Andrew John, S.M. Massachusetts Institute of Technology</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>