Efficient network code design for cyclic networks

Elona Erez, Meir Feder

Research output: Contribution to journalArticlepeer-review


This paper introduces an efficient polynomial-time code construction algorithm for cyclic networks, which achieves the optimal multicast rate. Until this work, no explicit capacity-achieving polynomial-time code construction for cyclic networks has been known. This new construction algorithm has the additional advantage that as sinks are added or removed from the network, it can modify the existing code in an efficient localized manner, which is beneficial also for acyclic networks. For decoding this code, a polynomial-time sequential decoder for convolutional network codes is also proposed.

Original languageEnglish
Article number5508610
Pages (from-to)3862-3878
Number of pages17
JournalIEEE Transactions on Information Theory
Issue number8
StatePublished - Aug 2010


  • Convolutional codes
  • cyclic networks
  • multicast
  • network coding
  • sequential decoding


Dive into the research topics of 'Efficient network code design for cyclic networks'. Together they form a unique fingerprint.

Cite this