2008 | ||
---|---|---|
6 | EE | Aiswarya Cyriac, K. Murali Krishnan: Lower Bound for the Communication Complexity of the Russian Cards Problem CoRR abs/0805.1974: (2008) |
2007 | ||
5 | EE | K. Murali Krishnan, Priti Shankar: Computing the Stopping Distance of a Tanner Graph Is NP-Hard. IEEE Transactions on Information Theory 53(6): 2278-2280 (2007) |
2006 | ||
4 | EE | K. Murali Krishnan, L. Sunil Chandran: Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs. FSTTCS 2006: 69-80 |
3 | EE | K. Murali Krishnan, Priti Shankar: Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds CoRR abs/cs/0601126: (2006) |
2 | EE | K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar: A Combinatorial Family of Near Regular LDPC Codes CoRR abs/cs/0609146: (2006) |
2005 | ||
1 | EE | K. Murali Krishnan, Priti Shankar: On the Complexity of finding Stopping Distance in Tanner Graphs CoRR abs/cs/0512101: (2005) |
1 | L. Sunil Chandran | [2] [4] |
2 | Aiswarya Cyriac | [6] |
3 | Priti Shankar | [1] [2] [3] [5] |
4 | Rajdeep Singh | [2] |