Subspace Coding for Networks with Different Level MessagesReportar como inadecuado




Subspace Coding for Networks with Different Level Messages - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

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





*

Author to whom correspondence should be addressed.



Academic Editor: Raúl Alcaraz Martínez

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. View Full-Text

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





Autor: Feng Cai * , Ning Cai and Wangmei Guo

Fuente: http://mdpi.com/



DESCARGAR PDF




Documentos relacionados