Hybrid noncoherent network coding

Vitaly Skachek, Olgica Milenkovic, Angelia Nedich

Research output: Contribution to journalArticle

7 Citations (Scopus)

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 network is much smaller than 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 consists 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 their subspace decoder counterparts.

Original languageEnglish (US)
Article number6423921
Pages (from-to)3317-3331
Number of pages15
JournalIEEE Transactions on Information Theory
Volume59
Issue number6
DOIs
StatePublished - 2013
Externally publishedYes

Fingerprint

Concatenated codes
Reed-Solomon codes
Network coding
Decoding
coding
Communication systems
symbol
communication system

Keywords

  • Error correction
  • noncoherent network coding
  • subspace codes
  • symbol errors

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Hybrid noncoherent network coding. / Skachek, Vitaly; Milenkovic, Olgica; Nedich, Angelia.

In: IEEE Transactions on Information Theory, Vol. 59, No. 6, 6423921, 2013, p. 3317-3331.

Research output: Contribution to journalArticle

Skachek, Vitaly ; Milenkovic, Olgica ; Nedich, Angelia. / Hybrid noncoherent network coding. In: IEEE Transactions on Information Theory. 2013 ; Vol. 59, No. 6. pp. 3317-3331.
@article{0ee02be3514f4f2fa5c36214adea805e,
title = "Hybrid noncoherent network coding",
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 network is much smaller than 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 consists 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 their subspace decoder counterparts.",
keywords = "Error correction, noncoherent network coding, subspace codes, symbol errors",
author = "Vitaly Skachek and Olgica Milenkovic and Angelia Nedich",
year = "2013",
doi = "10.1109/TIT.2013.2243899",
language = "English (US)",
volume = "59",
pages = "3317--3331",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Hybrid noncoherent network coding

AU - Skachek, Vitaly

AU - Milenkovic, Olgica

AU - Nedich, Angelia

PY - 2013

Y1 - 2013

N2 - 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 network is much smaller than 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 consists 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 their subspace decoder counterparts.

AB - 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 network is much smaller than 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 consists 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 their subspace decoder counterparts.

KW - Error correction

KW - noncoherent network coding

KW - subspace codes

KW - symbol errors

UR - http://www.scopus.com/inward/record.url?scp=84877880723&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84877880723&partnerID=8YFLogxK

U2 - 10.1109/TIT.2013.2243899

DO - 10.1109/TIT.2013.2243899

M3 - Article

AN - SCOPUS:84877880723

VL - 59

SP - 3317

EP - 3331

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 6

M1 - 6423921

ER -