Abstract:
Some sequential algorithms are presented for decoding random tree codes; the messages are transmitted over a binary symmetric channel. Approximate expressions are obtained for the probability of incorrect decoding and for the mean number of operations for decoding one symbol.