Simplified random network codes for multicast networks
Name
62296010-MIT.pdf
Description
Full printable version
Size
1.41 MB
Format
Adobe PDF
Checksum (MD5)
8bd8716e0450dca0782a9d323ad00f9d
Author(s)
Lee, Anna H
Advisor(s)
Muriel Médard.
Date Issued
2005
Publisher
Massachusetts Institute of Technology
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.
Description
Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
Includes bibliographical references (p. 43).
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
