Simplified random network codes for multicast networks
Author(s)
Lee, Anna H![Thumbnail](/bitstream/handle/1721.1/33306/62296010-MIT.pdf.jpg?sequence=5&isAllowed=y)
DownloadFull printable version (1.406Mb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Advisor
Muriel Médard.
Terms of use
Metadata
Show full item recordAbstract
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.
Description
Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005. Includes bibliographical references (p. 43).
Date issued
2005Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer SciencePublisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.