My current/former students
New Ph.D. students often ask what makes a Ph.D. thesis. To answer this question, I am providing information about research
work of my current and former Ph.D. students. This should give you an idea of the answer.

Arya Mazumdar. Area: Combinatorial coding
  • Weight distribution and decoding of codes on hypergraphs
                  Journal version: Adv. Math. Commun. no. 4, 2008 [pdf]
                 Conference versions: Allerton 2008 [pdf]
  • On the number of errors correctable with codes on graphs
                  Journal version: ...coming soon...   Conference version: ISIT 2009 [pdf]
  • Analysis of bipartite graph codes on the binary erasure channel
                  Conference version: Allerton 2007 [pdf]
  • On linear balancing sets, ISIT 2009 [pdf]

Punarbasu Purkayastha. Area: Bounds on codes
  • Bounds for ordered codes and orthogonal arrays, 2007-2009.
                          Journal version: Moscow Mathematical Journal 9,  no. 2, 2009, pp. 211-243, arXiv:cs/0702033.
                          Conference version: ISIT 2007
 
N. Prasanth Anthapadmanabhan Ph. D. April 2009
    • Thesis:  Random Codes and Graphs for Secure Communication [pdf]
    • Two-level fingerprinting codes, ISIT 2009 [pdf]
   • Fingerprinting capacity under the marking assumption.
                          Journal version: IEEE Trans. Inform. Theory, no. 6, 2008 [pdf]
                          Conference version: ISIT 2007 [pdf]
    • Random codes for digital fingerprinting, ISIT 2006 [pdf]
    • Randomized frameproof codes, CISS 2008 [pdf]

Andrew Duggan   M.Sc., 2006
   • Thesis: Performance analysis of algebraic soft-decision decoding of Reed-Solomon codes,
                           Journal version: IEEE Trans. Inform. Theory, no. 11, 2008 [pdf]
                          Conference version: ISIT 2007 [pdf]