List and probabilistic unique decoding of folded subspace codes

Hannes Bartz, Vladimir Sidorenko

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

5 Zitate (Scopus)

Abstract

A new class of folded subspace codes for noncoherent network coding is presented. The codes can correct insertions and deletions beyond the unique decoding radius for any code rate R ϵ [0, 1]. An efficient interpolation-based decoding algorithm for this code construction is given which allows to correct insertions and deletions up to the normalized radius s (1 - ((1/h + h)/(h - s + 1))R), where h is the folding parameter and s ≤ h is a decoding parameter. The algorithm serves as a list decoder or as a probabilistic unique decoder that outputs a unique solution with high probability. An upper bound on the average list size of (folded) subspace codes and on the decoding failure probability is derived. A major benefit of the decoding scheme is that it enables probabilistic unique decoding up to the list decoding radius.

OriginalspracheEnglisch
TitelProceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
Herausgeber (Verlag)Institute of Electrical and Electronics Engineers Inc.
Seiten11-15
Seitenumfang5
ISBN (elektronisch)9781467377041
DOIs
PublikationsstatusVeröffentlicht - 28 Sept. 2015
VeranstaltungIEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hongkong
Dauer: 14 Juni 201519 Juni 2015

Publikationsreihe

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

Konferenz

KonferenzIEEE International Symposium on Information Theory, ISIT 2015
Land/GebietHongkong
OrtHong Kong
Zeitraum14/06/1519/06/15

Fingerprint

Untersuchen Sie die Forschungsthemen von „List and probabilistic unique decoding of folded subspace codes“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren