|
 | Up a level |
Krishnan, Murali K and Shankar, Priti (2006) Approximate linear time ML decoding on tail-biting trellises in two rounds. In: IEEE International Symposium on Information Theory,, Jul 09-14, 2006, Seattle, WA, pp. 2245-2249.
Krishnan, Murali K and Chandran, Sunil L (2006) Hardness of approximation results for the problem of finding the stopping distance in Tanner graphs. In: 26th International Conference on Foundations of Software Technology and Theoretical Computer Science,, Dec 13-15, 2006, Calcutta, India, pp. 69-80.
Krishnan, Murali K and Shankar, Priti (2006) On the complexity of finding stopping set size in Tanner Graphs. In: 40th Annual Conference on Information Sciences and Systems (CISS),, Mar 22-24, 2006, Princeton, NJ, pp. 157-158.
Krishnan, Murali K and Shankar, Priti (2007) Computing the Stopping Distance of a Tanner Graph is NP-hard. In: IEEE Transactions on Information Theory, 53 (6). pp. 2278-2280.
