A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
An analysis of the computational complexity of sequential decoding of specific tree codes over Gaussian channels
2008 IEEE International Symposium on Information Theory
Seminal work by Chevillat and Costello showed that for specific convolutional codes transmitted over a binary symmetric channel and decoded by sequential decoding, a measure of decoding effort decreases exponentially with the column distance function of the code. This has led to a large body of research in the design of codes with good distance profiles which are also used for transmission over Gaussian channels. In this paper we analyze the computational complexity of a stack decoder workingdoi:10.1109/isit.2008.4595443 dblp:conf/isit/BalakrishnanNK08 fatcat:lj4sya2x5relfhgmohxedxdfju