Premium
Layered subspace codes for random network coding
Author(s) -
Chen Chao,
Xie Hongmei,
Bai Baoming
Publication year - 2015
Publication title -
transactions on emerging telecommunications technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 47
ISSN - 2161-3915
DOI - 10.1002/ett.2648
Subject(s) - subspace topology , decoding methods , algorithm , computer science , linear network coding , superposition principle , linear code , coding (social sciences) , error detection and correction , single antenna interference cancellation , theoretical computer science , block code , mathematics , artificial intelligence , computer network , statistics , mathematical analysis , network packet
Subspace codes were introduced by Kötter and Kschischang for error control in random linear network coding. In this paper, a layered type of subspace codes is considered, which can be viewed as a superposition of multiple component subspace codes. Exploiting the layered structure, we develop two decoding methods for these codes. The first method operates by separately decoding each component code. The second method is similar to the successive interference cancellation algorithm for conventional superposition coding and further permits an iterative version. We show that both methods decode not only deterministically up to but also probabilistically beyond the error‐correction capability of the overall code. Finally, we present possible applications of layered subspace codes in several network coding scenarios. Copyright © 2013 John Wiley & Sons, Ltd.