Hybrid Noncoherent Network Coding
From MaRDI portal
Publication:2989176
DOI10.1109/TIT.2013.2243899zbMATH Open1364.94067arXiv1107.4581MaRDI QIDQ2989176FDOQ2989176
Authors: Vitaly Skachek, Olgica Milenkovic, Angelia Nedić 
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: We describe a novel extension of subspace codes for noncoherent networks, suitable for use when the network is viewed as a communication system that introduces both dimension and symbol errors. We show that when symbol erasures occur in a significantly large number of different basis vectors transmitted through the network and when the min-cut of the networks is much smaller then the length of the transmitted codewords, the new family of codes outperforms their subspace code counterparts. For the proposed coding scheme, termed hybrid network coding, we derive two upper bounds on the size of the codes. These bounds represent a variation of the Singleton and of the sphere-packing bound. We show that a simple concatenated scheme that represents a combination of subspace codes and Reed-Solomon codes is asymptotically optimal with respect to the Singleton bound. Finally, we describe two efficient decoding algorithms for concatenated subspace codes that in certain cases have smaller complexity than subspace decoders.
Full work available at URL: https://arxiv.org/abs/1107.4581
Recommendations
- On the Capacity of Noncoherent Network Coding
- Network coding
- Networked distributed source coding
- Noisy Network Coding
- Mixed Noisy Network Coding and Cooperative Unicasting in Wireless Networks
- Network coding and subspace designs
- Aspects of Random Network Coding
- Random network coding over composite fields
- Network Coding: A Computational Perspective
Cited In (1)
This page was built for publication: Hybrid Noncoherent Network Coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989176)
