Subspace Coding for Networks with Different Level Messages
AbstractWe 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. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Cai, F.; Cai, N.; Guo, W. Subspace Coding for Networks with Different Level Messages. Entropy 2015, 17, 6462-6480.
Cai F, Cai N, Guo W. Subspace Coding for Networks with Different Level Messages. Entropy. 2015; 17(9):6462-6480.Chicago/Turabian Style
Cai, Feng; Cai, Ning; Guo, Wangmei. 2015. "Subspace Coding for Networks with Different Level Messages." Entropy 17, no. 9: 6462-6480.