On the complexity of exact maximum likelihood decoding on tail-biting trellises

Priti Shankar. On the complexity of exact maximum likelihood decoding on tail-biting trellises. In Proceedings of the 2004 IEEE International Symposium on Information Theory, ISIT 2004, Chicago Downtown Marriott, Chicago, Illinois, USA, June 27 - July 2, 2004. pages 104, IEEE, 2004. [doi]

Abstract

Abstract is missing.