DocumentCode :
2273083
Title :
Simplified random network codes for multicast networks
Author :
Lee, Anna H. ; Médard, Muriel
Author_Institution :
Lab. for Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA
fYear :
2005
fDate :
4-9 Sept. 2005
Firstpage :
1725
Lastpage :
1729
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 via an algebraic framework for network coding. We also present simulation results that compare unconstrained 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
Keywords :
algebraic codes; data communication; linear codes; multicast communication; radio networks; random codes; algebraic framework; code performance improvement; data transmission; intermediate nodes; multicast networks; unconstrained random network codes; wireless networks; Broadcasting; Buildings; Data communication; Galois fields; Laboratories; Network coding; Network topology; Routing; Wireless networks; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-9151-9
Type :
conf
DOI :
10.1109/ISIT.2005.1523640
Filename :
1523640
Link To Document :
بازگشت