Please use this identifier to cite or link to this item:
Title: A random linear network coding approach to multicast
Authors: Ho, T.
Médard, M.
Koetter, R.
Karger, D.R.
Effros, M.
Shi, J.
Leong, B. 
Keywords: Distributed compression
Distributed networking
Network coding
Random linear coding
Issue Date: 2006
Citation: Ho, T., Médard, M., Koetter, R., Karger, D.R., Effros, M., Shi, J., Leong, B. (2006). A random linear network coding approach to multicast. IEEE Transactions on Information Theory 52 (10) : 4413-4430. ScholarBank@NUS Repository.
Abstract: We present a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks. Network nodes independently and randomly select linear mappings from inputs onto output links over some field. We show that this achieves capacity with probability exponentially approaching 1 with the code length. We also demonstrate that random linear coding performs compression when necessary in a network, generalizing error exponents for linear Slepian-Wolf coding in a natural way. Benefits of this approach are decentralized operation and robustness to network changes or link failures. We show that this approach can take advantage of redundant network capacity for improved success probability and robustness. We illustrate some potential advantages of random linear network coding over routing in two examples of practical scenarios: distributed network operation and networks with dynamically varying connections. Our derivation of these results also yields a new bound on required field size for centralized network coding on general multicast networks. © 2006 IEEE.
Source Title: IEEE Transactions on Information Theory
ISSN: 00189448
DOI: 10.1109/TIT.2006.881746
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Jan 21, 2021


checked on Jan 21, 2021

Page view(s)

checked on Jan 20, 2021

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.