ON THE ERROR PROBABILITY OF GENERAL TREE AND TRELLIS CODES WITH APPLICATIONS TO SEQUENTIAL DECODING

摘要

An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random binary tree bodes is derived and shown to be independent of the length of the tree.nAn upper bound on the anerage error probability for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R=1/n is derived which separates the effects of the tail length T and the memory length M of the code.