An improved polynomial time linear network coding algorithm

Jie Yang*, Lili Yang

*Corresponding author for this work

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

Abstract

An improved linear network coding algorithm is proposed which breaks through the limitation of polynomial-time algorithm for multicasting application in wireless or cyclic networks. Examples show that the algorithm can increase channel utilization by exploiting the broadcasting character of wireless channels. Moreover, it could be implemented in a cyclic network directly.

Original languageEnglish
Title of host publicationFuture Wireless Networks and Information Systems
Pages571-576
Number of pages6
EditionVOL. 1
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event2011 International Conference on Future Wireless Networks and Information Systems, ICFWI 2011 - Macao, China
Duration: 30 Nov 20111 Dec 2011

Publication series

NameLecture Notes in Electrical Engineering
NumberVOL. 1
Volume143 LNEE
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Conference

Conference2011 International Conference on Future Wireless Networks and Information Systems, ICFWI 2011
Country/TerritoryChina
CityMacao
Period30/11/111/12/11

Keywords

  • IPTA
  • Linear network coding
  • cyclic network
  • multicast application
  • wireless network

Fingerprint

Dive into the research topics of 'An improved polynomial time linear network coding algorithm'. Together they form a unique fingerprint.

Cite this