DocumentCode
2769627
Title
Network coding gain of combination networks
Author
Ngai, Chi Kin ; Yeung, Raymond W.
Author_Institution
Dept. of Inf. Eng., Chinese Univ. of Hong Kong, China
fYear
2004
fDate
24-29 Oct. 2004
Firstpage
283
Lastpage
287
Abstract
Network coding theory shows that the multicast rate in a network can be increased if coding is allowed in the network nodes. Thus the capacity of a network with network coding is generally larger than that with routing alone. We quantify this gain in closed form for a class of networks called combination networks. From this result, it can readily be deduced that network coding gain can be unbounded.
Keywords
channel capacity; combinatorial mathematics; data communication; encoding; multicast communication; telecommunication networks; combination networks; multicast rate; network capacity; network coding gain; network coding theory; network nodes; Cellular neural networks; Data storage systems; Decoding; Electronic mail; Fault tolerant systems; Network coding; Out of order; Routing; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop, 2004. IEEE
Print_ISBN
0-7803-8720-1
Type
conf
DOI
10.1109/ITW.2004.1405315
Filename
1405315
Link To Document