• Ph.D. (2006) (Communication Theory and Systems), University of California, San Diego
• M.E. (2000) (Telecommunication Engineering), Indian Institute of Science, Bangalore
• B.Tech. (1996) (Electronics and Communication Engineering), National Institute of Technology, Calicut
• Employment:
  • Oct 2006-present Postdoctoral Research Associate, Los Alamos National Laboratory
  • 2001-2006 Graduate Research Assistant, Coding Theory, ECE Dept., University of California San Diego
  • 2001 Graduate Teaching Assistant, Algebraic Coding Theory, University of California San Diego
  • 2000-2001 Professional Consultant, 3G Wireless Systems, Synopsys Incorporated
  • 1997-1998 VLSI Design and Characterization Engineer, Cypress Semiconductor Corporation

Research Interests:

• Discrete mathematics
• Error correction coding theory
• Belief propagation algorithms and Algorithms on graphs
• Communication systems and theory
• Computational complexity in relation to coding theory

Selected Recent Publications:

1. N. Santhi, On Algebraic Decoding of q-ary Reed-Muller and Product Reed Solomon Codes, Proceedings of the IEEE International Symposium on Information Theory (ISIT), Nice, France, June 2007 (to appear), available at: arxiv:0704.2811
2. N. Santhi and A.Vardy, On an Improvement over R'enyi's Equivocation Bound, Proceedings of the 44-th Annual Allerton Conference on Communication, Control, and Computing, Monticello, USA, September 2006
3. N. Santhi and A.Vardy, Minimum Distance of Codes and Branching Program Complexity, Proceedings of the IEEE International Symposium on Information Theory (ISIT), Seattle, USA, July 2006
4. N. Santhi, On Algebraic Decoding of q-ary Reed-Muller and Product Reed Solomon Codes, to be submitted to the IEEE Transactions on Information Theory, April 2007.
5. N. Santhi and A.Vardy, On an improvement over R'enyi's equivocation bound, to be submitted to the IEEE Transactions on Information Theory, 2006, available at: arxiv:cs.IT/0608087
6. N. Santhi and A.Vardy, A Quadratic Time-Space Tradeoff for certain Deterministic Decision Branching Programs, in preparation, August 2006.
7. N. Santhi and A.Vardy, On the branching program complexity of encoding binary codes, to be submitted to the IEEE Transactions on Information Theory, 2006.
8. N. Santhi and A.Vardy, On the Branching Program Complexity of Functions Related to Error-Correcting Codes, in preparation, May 2006.
9. N. Santhi, P.H. Siegel, and A.Vardy, A simple Markovian analysis of iterative decoding of product codes, to be submitted to the IEEE Transactions on Information Theory, 2006.
10. N. Santhi and A.Vardy, Analog codes on graphs, to be submitted to the IEEE Transactions on Information Theory, 2006, available at: arxiv:cs.IT/0608086
11. N. Santhi and A.Vardy, On the effect of parity-check weights in iterative decoding, Proceedings of the IEEE International Symposium on Information Theory (ISIT), Chicago, USA, July 2004
12. N. Santhi and A.Vardy, Analog codes on graphs, Proceedings of the IEEE International Symposium on Information Theory (ISIT), Yokohama, Japan, July 2003