Successive decoding scheme for memoryless channels
- 1 April 1963
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 9 (2) , 97-104
- https://doi.org/10.1109/tit.1963.1057824
Abstract
In this paper a new decoding scheme for random convolutional codes is described. This scheme is different from other effective decoding schemes, such as sequential decoding [1] and low-density parity check codes [2]. The new scheme yields (for a certain region of information rates) an upper bound on the average number of computations which is {em independent} of the coding constraint length. Furthermore, unlike sequential decoding, a bound on the total number of computations (rather than just on the "incorrect subset") is derived in this paper.Keywords
This publication has 0 references indexed in Scilit: