Our current research focuses on understanding how in specific multiterminal systems, correlation among the signals at the terminals can be exploited, through managed cooperation, in designing efficient methods for signal sampling, compression, transmission and assuring information security. Provable limits of performance and techniques for achieving them are analyzed.

Specific research projects include studies of: connections between common randomness generation by multiple terminals, network secret key generation, and combinatorial tree packing in multigraphs; secure function computation; reliable communication over hybrid radio frequency and free space optical communication systems; and sampling-quantization-distortion tradeoffs in thermal profile estimation for multicore processor chips.

Research Interests

• Multiuser information and coding theory
• Information theoretic security
• Communication theory
• Information theory and statistics
• Communication networks

Selected Publications

• Secrecy Generation for Multiaccess Channel Models, I. Csiszàr and P. Narayan, IEEE Transactions on Information Theory, in review. (pdf)
• State Dependent Channels: Strong Converse and Bounds on Reliability Function, H. Tyagi and P. Narayan, Proceedings of the February Fourier Talks (FFT 2006 - 2011), Springer-Berkhauser Applied and Numerical Harmonic Analysis (ANHA) Book Series, to appear, 2012.(pdf)
• Secret Key Generation for Correlated Gaussian Sources, S. Nitinawarat and P. Narayan, IEEE Transactions on Information Theory, to appear, 2012. (pdf)
• Secret Key and Private Key Constructions for Simple Multiterminal Source Models, C. Ye and P. Narayan, IEEE Transactions on Information Theory, 2012. (pdf)
• When is a Function Securely Computable?, H. Tyagi, P. Gupta and P. Narayan, IEEE Transactions on Information Theory, 2011. (pdf)
• Perfect Omniscience, Perfect Secrecy and Tree Packing, S. Nitinawarat and P. Narayan, IEEE Transactions on Information Theory, 2010. (pdf)
• Secret Key Generation for a Pairwise Independent Network Model, S. Nitinawarat, C. Ye, A. Barg, P. Narayan and A. Reznik, IEEE Transactions on Information Theory, 2010. (pdf)
• Capacity of a Shared Secret Key, I. Csiszàr and P. Narayan, Proceedings of the IEEE International Symposium on Information Theory, Austin, Texas, 2010. (pdf)
• Secrecy Capacities for Multiterminal Channel Models, I. Csiszàr and P. Narayan, IEEE Transactions on Information Theory, 2008. (pdf)
• Active Pointing Control for Short Range Free-Space Optical Communication, A. Komaee and P.S. Krishnaprasad and P. Narayan, Communications in Information and Systems, 2007. (pdf)
• The Poisson Fading Channel, K. Chakraborty and P. Narayan, IEEE Transactions on Information Theory, 2007. (pdf)
• Secrecy Capacities for Multiple Terminals, I. Csiszàr and P. Narayan, IEEE Transactions on Information Theory, 2004. (pdf)
• Order Estimation for a Special Class of Hidden Markov Sources and Binary Renewal Processes, S. Khudanpur and P. Narayan, IEEE Transactions on Information Theory, 2002. (pdf)
• Capacities of Time-Varying Multiple-Access Channels with Side Information, A. Das and P. Narayan, IEEE Transactions on Information Theory, 2002. (pdf)
• Common Randomness and Secret Key Generation with a Helper, I. Csiszàr and P. Narayan, IEEE Transactions on Information Theory, 2000. (pdf)
• Reliable Communication under Channel Uncertainty, A. Lapidoth and P. Narayan, IEEE Transactions on Information Theory, 1998. (pdf)
• The Optimal Error Exponent for Markov Order Estimation, L. Finesso, C. Liu and P. Narayan, IEEE Transactions on Information Theory, 1996. (pdf)
• Typicality of a Good Rate-Distortion Code, A. Kanlis, S. Khudanpur and P. Narayan, Problemy Peredachi Informatsii, 1996. (pdf)
• The Error Exponent for Successive Refinement by Partitioning, A. Kanlis and P. Narayan, IEEE Transactions on Information Theory, 1996. (pdf)
• Capacity of the Arbitrarily Varying Channel Under List Decoding, V. Blinovsky, M.S. Pinsker and P. Narayan, Problemy Peredachi Informatsii, 1995. (pdf)
• Channel Capacity for a Given Decoding Metric, I. Csiszàr and P. Narayan, IEEE Transactions on Information Theory, 1995. (pdf)
• Cutoff Rate Channel Design, P. Narayan and D. Snyder, Communication and Cryptography: Two Sides of One Tapestry, R. Blahut et. al. (Eds.), Kluwer Publishers, Boston, 1994.(pdf)
• Order Estimation and Sequential Universal Data Compression of a Hidden Markov Source via the Method of Mixtures, C. Liu and P. Narayan, IEEE Transactions on Information Theory, 1994. (pdf)
• Jointly Optimal Flow Control and Routing at a Simple Network Node, I. Lambadaris and P. Narayan, Stochastic Models, 1994. (pdf)
• Capacity of the Gaussian Arbitrarily Varying Channel, I. Csiszàr and P. Narayan, IEEE Transactions on Information Theory, 1991. (pdf)
• Capacity and Decoding Rules for Classes of Arbitrarily Varying Channels, I. Csiszàr and P. Narayan, IEEE Transactions on Information Theory, 1989. (pdf)
• The Capacity of a Vector Gaussian Arbitrarily Varying Channel, B.L. Hughes and P. Narayan, IEEE Transactions on Information Theory, 1988. (pdf)
• The Capacity of the Arbitrary Varying Channel Revisited: Positivity, Constraints, BI. Csiszàr and P. Narayan, IEEE Transactions on Information Theory, 1988. (pdf)
• Arbitrarily Varying Channels with Constrained Inputs and States, I. Csiszàr and P. Narayan, IEEE Transactions on Information Theory, 1988. (pdf)
• Signal Set Design for Bandlimited, Memoryless, Multiple-Access Channels with Soft Decision Demodulation, P. Narayan and D.L. Snyder, IEEE Transactions on Information Theory, 1987. (pdf)
• Gaussian Arbitrarily Varying Channels, B.L. Hughes and P. Narayan, IEEE Transactions on Information Theory, 1987. (pdf)
• Estimation of the Rate of a Doubly-Stochastic, Time-Space Poisson Process, J. Gubner and P. Narayan, IMA Journal of Mathematical Control and Information, 1986. (pdf)
• The Two User Cutoff Rate Region for an Asynchronous and a Synchronous Multiple Access Channel are the Same, P. Narayan and D.L. Snyder, IEEE Transactions on Information Theory, 1981. (pdf)