2026-09-19T09:09:25Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1203872026-06-06T00:49:18Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Yury Polyanskiy.
Gu, Yuzhou
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2019-02-14T15:23:27Z
2019-02-14T15:23:27Z
2018
2018
http://hdl.handle.net/1721.1/120387
1084659753
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 53-54).
Adder MAC is a simple noiseless multiple-access channel (MAC), where if users send messages X₁, . . . ,X[subscript h] [epsilon] {0, 1}[superscript n], then the receiver receives Y = X₁ + · · · + X[subscript h] with addition over Z. Communication over the noiseless adder MAC has been studied for more than fifty years. There are two models of particular interest: uniquely decodable code tuples, and B[subscript h]-codes. In spite of the similarities between these two models, lower bounds and upper bounds of the optimal sum rate of uniquely decodable code tuple asymptotically match as number of users goes to infinity, while there is a gap of factor two between lower bounds and upper bounds of the optimal rate of B[subscript h]-codes. The best currently known B[subscript h]-codes for h >/- 3 are constructed using random coding. In this thesis, we study variants of the random coding method and related problems, in hope of achieving B[subscript h]-codes with better rate. Our contribution include the following. 1. We determine the rate achieved by changing the underlying distribution used in random coding. 2. We determine the rate of a list-decoding version of B[subscript h]-codes achieved by the random coding method. 3. We study several related problems about Rényi entropy.
by Yuzhou Gu.
M.Eng.
54 pages
eng
Massachusetts Institute of Technology
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Zero-error communication over adder MAC
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="3c3ebdf6-4a38-43c0-b545-41315da576dd">
<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>Zero-error communication over adder MAC</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2018</PublicationDate>
<Authors>
<Author>
<DisplayName>Gu, Yuzhou</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>Adder MAC is a simple noiseless multiple-access channel (MAC), where if users send messages X₁, . . . ,X[subscript h] [epsilon] {0, 1}[superscript n], then the receiver receives Y = X₁ + · · · + X[subscript h] with addition over Z. Communication over the noiseless adder MAC has been studied for more than fifty years. There are two models of particular interest: uniquely decodable code tuples, and B[subscript h]-codes. In spite of the similarities between these two models, lower bounds and upper bounds of the optimal sum rate of uniquely decodable code tuple asymptotically match as number of users goes to infinity, while there is a gap of factor two between lower bounds and upper bounds of the optimal rate of B[subscript h]-codes. The best currently known B[subscript h]-codes for h >/- 3 are constructed using random coding. In this thesis, we study variants of the random coding method and related problems, in hope of achieving B[subscript h]-codes with better rate. Our contribution include the following. 1. We determine the rate achieved by changing the underlying distribution used in random coding. 2. We determine the rate of a list-decoding version of B[subscript h]-codes achieved by the random coding method. 3. We study several related problems about Rényi entropy.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>