# On the Complexity of Exact Maximum Likelihood Decoding on Tail-Biting Trellises

Shankar, Priti (2004) On the Complexity of Exact Maximum Likelihood Decoding on Tail-Biting Trellises. In: International Symposium on Information Theory, 2004. ISIT 2004, 27 June-2 July, Chicago, 104 -104.

 Preview
PDF
On_the_complexity.pdf

We analyze an algorithm for exact maximum likelihood decoding on tail-biting trellises is analyzed and shows that under certain conditions exact maximum likelihood decoding has time complexity $O(S_t\hspace{5 mm}log {(S_t)})$ and where $S_t$ is the total number of states of the tail-biting trellis.