Simplified random network codes for multicast networks
Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/33306 |
| _version_ | 1826189851910733824 |
|---|---|
| author | Lee, Anna H |
| author2 | Muriel Médard. |
| author_facet | Muriel Médard. Lee, Anna H |
| author_sort | Lee, Anna H |
| collection | MIT |
| description | Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005. |
| first_indexed | 2024-09-23T08:24:57Z |
| format | Thesis |
| id | mit-1721.1/33306 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T08:24:57Z |
| publishDate | 2006 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/333062022-01-13T07:54:29Z Simplified random network codes for multicast networks Lee, Anna H Muriel Médard. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Electrical Engineering and Computer Science. 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.and S.B. 2006-07-13T15:14:03Z 2006-07-13T15:14:03Z 2005 2005 Thesis http://hdl.handle.net/1721.1/33306 62296010 eng 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 43 p. 1474466 bytes 1474509 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Lee, Anna H Simplified random network codes for multicast networks |
| title | Simplified random network codes for multicast networks |
| title_full | Simplified random network codes for multicast networks |
| title_fullStr | Simplified random network codes for multicast networks |
| title_full_unstemmed | Simplified random network codes for multicast networks |
| title_short | Simplified random network codes for multicast networks |
| title_sort | simplified random network codes for multicast networks |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/33306 |
| work_keys_str_mv | AT leeannah simplifiedrandomnetworkcodesformulticastnetworks |