Search the dblp DataBase

Publications of Author

1. K. Murali Krishnan, L. Sunil Chandran
   Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2006, pp:69-80 [Conf]
   
2. K. Murali Krishnan, Priti Shankar
   Computing the Stopping Distance of a Tanner Graph Is NP-Hard. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 2007, v:53, n:6, pp:2278-2280 [Journal]
   
3. K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar
   A Combinatorial Family of Near Regular LDPC Codes [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
4. K. Murali Krishnan, Priti Shankar
   Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
5. 
   On the Complexity of finding Stopping Distance in Tanner Graphs [Citation Graph (, )][DBLP]
   
   
6. 
   Lower Bound for the Communication Complexity of the Russian Cards Problem [Citation Graph (, )][DBLP]
   
   
7. 
   Extending Karger's randomized min-cut Algorithm for a Synchronous Distributed setting [Citation Graph (, )][DBLP]