Abstract
We study the asymptotically-achievable rate region of subspace codes for wireless network coding, where receivers have different link capacities due to the access ways or the faults of the intermediate links in the network. Firstly, an outer bound of the achievable rate region in a two-receiver network is derived from a combinatorial method. Subsequently, the achievability of the outer bound is proven by code construction, which is based on superposition coding. We show that the outer bound can be achieved asymptotically by using the code presented by Koetter and Kschischang, and the outer bound can be exactly attained in some points by using a q-analog Steiner structure. Finally, the asymptotically-achievable rate region is extended to the general case when the network has m receivers with different levels.
Highlights
Network coding, introduced in [1,2], has attracted a substantial amount of research attention
The asymptotically-achievable rate region of an [n, k, (M1, M2 ), (τ1, τ2 )]-broadcast error correction network codes (BECNC) with corresponding error-correcting capability τ1 and τ2 over field Fq consists of pairs (R1, R2 ) of non-negative numbers that satisfy the inequalities, R1 ≥ 0, R2 ≥ 0 (5)
We propose a network model based on a real-time media distribution system, where the receivers have different link capacities due to packets lost or a fault in intermediate nodes
Summary
Network coding, introduced in [1,2], has attracted a substantial amount of research attention. It is a technique in which the intermediate node is allowed to make a combination of its received packets before sending the combined packet out to the network. As the scale of the network grows, the complexity of network code construction increases . To address this issue, random network coding was proposed by Ho et al [4] without considering network topology, where the intermediate nodes select
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
