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...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on information theory Ročník 12; číslo 2; s. 168 - 171
Hlavný autor:	Ziv, J.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 01.04.1966
Predmet:	Channel capacity Complexity theory Delays Encoding Iterative decoding Iterative methods Maximum likelihood decoding Memoryless systems Probabilistic logic Symbols
ISSN:	0018-9448, 1557-9654
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!