Modified earliest decoding for random network codes

Suné Von Solms, Albert S.J. Helberg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

We present a practical, modified version of earliest decoding for random linear network coding networks. This decoding method has a lower complexity and decoding delay than traditional Gaussian elimination decoding schemes.

Original languageEnglish
Title of host publication2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event2011 International Symposium on Network Coding, NETCOD 2011 - Beijing, China
Duration: 25 Jul 201127 Jul 2011

Publication series

Name2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings

Conference

Conference2011 International Symposium on Network Coding, NETCOD 2011
Country/TerritoryChina
CityBeijing
Period25/07/1127/07/11

Keywords

  • Earliest Decoding
  • Network Coding
  • Random Linear Network Coding

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Modified earliest decoding for random network codes'. Together they form a unique fingerprint.

Cite this