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

Full description

Bibliographic Details

Published in:	IEEE transactions on information theory Vol. 12; no. 2; pp. 168 - 171
Main Author:	Ziv, J.
Format:	Journal Article
Language:	English
Published:	IEEE 01.04.1966
Subjects:	Channel capacity Complexity theory Delays Encoding Iterative decoding Iterative methods Maximum likelihood decoding Memoryless systems Probabilistic logic Symbols
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!