Attaining Capacity with iterated $(U |U + V )$ codes based on AG codes and Koetter-Vardy soft decoding - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Attaining Capacity with iterated $(U |U + V )$ codes based on AG codes and Koetter-Vardy soft decoding

Abstract

In this paper we show how to attain the capacity of discrete symmetric channels with polynomial time decoding complexity by considering iterated (U | U + V) constructions with algebraic geometry (AG) code components. These codes are decoded with a recursive computation of the a posteriori probabilities of the code symbols together with decoding the AG components with the Koetter-Vardy algorithm. We show that, when the number of levels of the iterated (U | U + V) construction tends to infinity, we attain the capacity of any discrete symmetric channel. Moreover the error probability decays quasi-exponentially with the codelength in the case of Reed-Solomon code constituents and exponentially with Tsfasman-Vl˘ aduts-Zink code constituents.
Fichier principal
Vignette du fichier
Isit2017.pdf (481.24 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01661977 , version 1 (12-12-2017)

Identifiers

Cite

Irene Marquez-Corbella, Jean-Pierre Tillich. Attaining Capacity with iterated $(U |U + V )$ codes based on AG codes and Koetter-Vardy soft decoding. ISIT 2017 - IEEE International Symposium on Information Theory, Jun 2017, Aachen, Germany. pp.6--10, ⟨10.1109/ISIT.2017.8006479⟩. ⟨hal-01661977⟩

Collections

INRIA INRIA2
127 View
149 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More