Further results on the asymptotic complexity of an iterative coding scheme

The purpose of this paper is to demonstrate that it is possible to communicate over a memoryless channel of capacity C at any rate R < C with a probability of error less than 2^{-E(R)\nu},E(R)>0 , per block of a length approximately proportional to \nu^{2} and with a computational decoding com...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory Jg. 12; H. 2; S. 168 - 171
1. Verfasser: Ziv, J.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: IEEE 01.04.1966
Schlagworte:
Channel capacity
Complexity theory
Delays
Encoding
Iterative decoding
Iterative methods
Maximum likelihood decoding
Memoryless systems
Probabilistic logic
Symbols
ISSN:0018-9448, 1557-9654
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The purpose of this paper is to demonstrate that it is possible to communicate over a memoryless channel of capacity C at any rate R < C with a probability of error less than 2^{-E(R)\nu},E(R)>0 , per block of a length approximately proportional to \nu^{2} and with a computational decoding complexity which is asymptotically proportional to \nu^{2} when \nu is large. The decoding scheme presented in this paper is based on a two-cycle iteration of a decoding procedure which has been described in an earlier paper [1 ].
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.1966.1053878