Subspace Coding for Networks with Different Level Messages

Entropy

Feng Cai¹  Ning Cai²  Wangmei Guo² 

[1] The State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China;

关键词: network coding;    error correcting;    achievable rate region;    projective spaces;    Kruskal–Katona theorem;    block design;   

DOI  :  10.3390/e17096462

来源: mdpi

【 摘 要 】

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.

【 授权许可】

CC BY   
© 2015 by the authors; licensee MDPI, Basel, Switzerland.