2012/08/20 by Zhifang Zhang, Zhang, Zhifang
Computer Science · Engineering · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Full-Duplex Wireless Communications #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1208.3966
openalex publication_date 2012/08/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Random linear network code has to sacrifice part of bandwidth to transfer the coding vectors, thus a head of size k log|T| is appended to each packet. We present a distributed random network coding approach based on the Chinese remainder theorem for general multicast networks. It uses a couple of modulus as the head, thus reduces the size of head to O(log k). This makes it more suitable for scenarios where the number of source nodes is large and the bandwidth is limited. We estimate the multicast rate and show it is satisfactory in performance for randomly designed networks.