The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pulkit Grover: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pulkit Grover, Ajit Kumar Chaturvedi
    Upper Bounds on the Rate of LDPC Codes for a Class of Finite-State Markov Channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:2, pp:794-804 [Journal]
  2. Pulkit Grover, Anant Sahai
    What is needed to exploit knowledge of primary transmissions? [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  3. Pulkit Grover
    Tradeoff between decoding complexity and rate for codes on graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  4. A vector version of witsenhausen's counterexample: A convergence of control, communication and computation. [Citation Graph (, )][DBLP]


  5. A constant-factor approximately optimal solution to the Witsenhausen counterexample. [Citation Graph (, )][DBLP]


  6. The price of certainty: "waterslide curves" and the gap to capacity [Citation Graph (, )][DBLP]


  7. Green Codes: Energy-Efficient Short-Range Communication [Citation Graph (, )][DBLP]


  8. Information embedding meets distributed control [Citation Graph (, )][DBLP]


  9. The finite-dimensional Witsenhausen counterexample [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002