Instantly decodable network codes for cooperative index coding problem over general topologies
We consider a group of n wireless clients and a set of k messages. Each client initially holds a subset of messages and is interested in an arbitrary subset of messages. Each client cooperates with other clients to obtain the set of messages it wants by exchanging instantly decodable network coded (IDNC) packets. This problem setting is known as the cooperative index coding problem. Clients are assumed to be connected through an arbitrary topology. In the absence of any known algorithm to...[Show more]
|Collections||ANU Research Publications|
|Source:||2014 Australian Communications Theory Workshop, AusCTW 2014|
|01_Etemadi Tajbakhsh _Instantly_decodable_network_2014.pdf||293.65 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.