An Analytical Model for Perpetual Network Codes in Packet Erasure Channels

Peyman Pahlevani, Sergio Crisostomo, Daniel Enrique Lucani Rötter

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review


Perpetual codes provide a sparse, but structured coding for fast encoding and decoding. In this work, we illustrate that perpetual codes introduce linear dependent packet transmissions in the presence of an erasure channel. We demonstrate that the number of linear dependent packet transmissions is highly dependent on a parameter called the width (ω), which represents the number of consecutive non-zero coding coefficient present in each coded packet after a pivot element. We provide a mathematical analysis based on the width of the coding vector for the number of transmitted packets and validate it with simulation results. The simulations show that for ω = 5, generation size g = 256, and low erasure probability on the link, a destination can receive up to 70% overhead in average. Moreover, increasing the width, the overhead contracts, and for ω ≥ 60 it becomes negligible.

Original languageEnglish
Title of host publicationMultiple Access Communications - 9th International Workshop, MACOM 2016, Proceedings
Number of pages10
Publication date20 Dec 2016
ISBN (Print)978-3-319-51375-1
ISBN (Electronic)978-3-319-51376-8
Publication statusPublished - 20 Dec 2016
Externally publishedYes
Event9th International Workshop on Multiple Access Communications - Aalborg, Denmark
Duration: 21 Nov 201622 Nov 2016


Conference9th International Workshop on Multiple Access Communications
Internet address
SeriesLecture Notes in Computer Science


Dive into the research topics of 'An Analytical Model for Perpetual Network Codes in Packet Erasure Channels'. Together they form a unique fingerprint.

Cite this