Interleaved subspace codes in fountain mode

Vladimir Sidorenko, Hannes Bartz, Antonia Wachter-Zeh

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

1 Citation (Scopus)

Abstract

We consider subspace codes obtained by lifting L-interleaved [n, k] Gabidulin codes. When used in networks with random linear coding, these codes are able to correct with high probability γ packet insertions and δ packet deletions provided that γ/L + δ ≤ n - k. We propose to use these subspace codes in the so called fountain mode. In this case we do not need to correct deletions and are able to correct with high probability a large number L(n - k) of packet insertions. We present a simplified decoder correcting insertions only.

Original languageEnglish
Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages799-803
Number of pages5
ISBN (Electronic)9781509040964
DOIs
Publication statusPublished - 9 Aug 2017
Externally publishedYes
Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
Duration: 25 Jun 201730 Jun 2017

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference2017 IEEE International Symposium on Information Theory, ISIT 2017
Country/TerritoryGermany
CityAachen
Period25/06/1730/06/17

Fingerprint

Dive into the research topics of 'Interleaved subspace codes in fountain mode'. Together they form a unique fingerprint.

Cite this