2010 · 19 citations · 18 references
EngineeringComputer ScienceMathematicsAlgorithmsComputer NetworksInformation TheoryChannel CodingCoding TheoryError Control CodingError-correcting CodesNetwork Information TheorySource CodingCode DesignMulticast CommunicationMulticast ProtocolsMulticast TransmissionMulticastingNetwork CodingPolynomial Time ComplexityPolynomial-time Algorithms
We present a polynomial time algorithm for multicasting rate h to N receivers over deterministic networks. Our algorithm requires intermediate network nodes to perform coding operations over vectors of a finite length L, through multiplication with L × L binary coding matrices that play the same role as coding coefficients over graphs. Our code design consists in selecting these matrices so that each receiver is able to recover the source information. As a special case, we provide an alternative construction for a unicast algorithm over deterministic networks.
18
Rudolf Ahlswede, Ning Cai, Shuo Li et al. · IEEE Transactions on Information Theory · 2000 · 7.9K citations
An algebraic approach to network coding
R. Koetter, Muriel Médard · IEEE/ACM Transactions on Networking · 2003 · 2.4K citations
A Deterministic Approach to Wireless Relay Networks
Amir Salman Avestimehr, Suhas Diggavi, David Tse · ArXiv.org · 2007 · 244 citations · Full text