2026-09-18T21:59:14Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/333062026-06-06T01:04:17Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Muriel Médard.
Lee, Anna H
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2006-07-13T15:14:03Z
2006-07-13T15:14:03Z
2005
2005
http://hdl.handle.net/1721.1/33306
62296010
Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
Includes bibliographical references (p. 43).
Network coding is a method of data transmission across a network which involves coding at intermediate nodes. Network coding is particularly attractive for multicast. Building on the work done on random linear network codes, we develop a constrained, simplified code construction suitable for multicast in wireless networks. We analyze bounds on sufficient code size and code success probability via an algebraic framework for network coding. We also present simulation results that compare generalized random network codes with our code construction. Issues unique to the simplified code are explored and a relaxation of the code to improve code performance is discussed.
by Anna H. Lee.
M.Eng.
S.B.
43 p.
1474466 bytes
1474509 bytes
application/pdf
application/pdf
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.
Simplified random network codes for multicast networks
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="0faec5b8-6b26-4248-b52d-51018fcbfb15">
<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>Simplified random network codes for multicast networks</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2005</PublicationDate>
<Authors>
<Author>
<DisplayName>Lee, Anna H</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>Network coding is a method of data transmission across a network which involves coding at intermediate nodes. Network coding is particularly attractive for multicast. Building on the work done on random linear network codes, we develop a constrained, simplified code construction suitable for multicast in wireless networks. We analyze bounds on sufficient code size and code success probability via an algebraic framework for network coding. We also present simulation results that compare generalized random network codes with our code construction. Issues unique to the simplified code are explored and a relaxation of the code to improve code performance is discussed.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>