Hybrid noncoherent network coding

Vitaly Skachek, Olgica Milenkovic, Angelia Nedić

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 code.

Original languageEnglish (US)
Title of host publication2012 International Symposium on Network Coding, NetCod 2012
PublisherIEEE Computer Society
Pages7-12
Number of pages6
ISBN (Print)9781467318921
DOIs
StatePublished - 2012
Externally publishedYes
Event2012 International Symposium on Network Coding, NetCod 2012 - Cambridge, MA, United States
Duration: Jun 29 2012Jun 30 2012

Publication series

Name2012 International Symposium on Network Coding, NetCod 2012

Other

Other2012 International Symposium on Network Coding, NetCod 2012
CountryUnited States
CityCambridge, MA
Period6/29/126/30/12

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Hybrid noncoherent network coding'. Together they form a unique fingerprint.

Cite this