2011/01/14 by S. M. Sadegh Tabatabaei Yazdi, Yazdi, S. M. Sadegh Tabatabaei, Serap A. Savari +1
Computer Science · Engineering · Mathematics · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Full-Duplex Wireless Communications #Information Theory (cs.IT) #Mobile Ad Hoc Networks #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1101.2937
12 pages, 2 figures, submitted to CISS 2011
openalex publication_date 2011/01/14 · arxiv created 2011/01/15 · arxiv updated 2015/03/17 · openalex created_date 2022/09/27 · openalex updated_date 2026/07/28
We propose a new way to construct a multicast coding scheme for linear deterministic relay networks. Our construction can be regarded as a generalization of the well-known multicast network coding scheme of Jaggi et al. to linear deterministic relay networks and is based on the notion of flow for a unicast session that was introduced by the authors in earlier work. We present randomized and deterministic polynomial--time versions of our algorithm and show that for a network with g destinations, our deterministic algorithm can achieve the capacity in \lceil log(g+1)\rceil uses of the network.