Year |
Citation |
Score |
2013 |
Tyagi H, Narayan P. How many queries will resolve common randomness? Ieee International Symposium On Information Theory - Proceedings. 3165-3169. DOI: 10.1109/Tit.2013.2262496 |
0.625 |
|
2013 |
Csiszár I, Narayan P. Secrecy generation for multiaccess channel models Ieee Transactions On Information Theory. 59: 17-31. DOI: 10.1109/Tit.2012.2216254 |
0.411 |
|
2012 |
Nitinawarat S, Narayan P. Secret key generation for correlated gaussian sources Ieee Transactions On Information Theory. 58: 3373-3391. DOI: 10.1109/Tit.2012.2184075 |
0.725 |
|
2012 |
Ye C, Narayan P. Secret key and private key constructions for simple multiterminal source models Ieee Transactions On Information Theory. 58: 639-651. DOI: 10.1109/Tit.2011.2173731 |
0.54 |
|
2011 |
Tyagi H, Narayan P, Gupta P. When is a function securely computable? Ieee International Symposium On Information Theory - Proceedings. 2876-2880. DOI: 10.1109/Tit.2011.2165807 |
0.583 |
|
2010 |
Nitinawarat S, Narayan P. Perfect omniscience, perfect secrecy, and steiner tree packing Ieee Transactions On Information Theory. 56: 6490-6500. DOI: 10.1109/Tit.2010.2081450 |
0.736 |
|
2010 |
Nitinawarat S, Ye C, Barg A, Narayan P, Reznik A. Secret key generation for a pairwise independent network model Ieee Transactions On Information Theory. 56: 6482-6489. DOI: 10.1109/Tit.2010.2081210 |
0.751 |
|
2010 |
Nitinawarat S, Narayan P. Perfect omniscience, perfect secrecy and steiner tree packing 2010 Information Theory and Applications Workshop, Ita 2010 - Conference Proceedings. 362-366. DOI: 10.1109/ITA.2010.5454101 |
0.71 |
|
2010 |
Nitinawarat S, Narayan P. Perfect secrecy and combinatorial tree packing Ieee International Symposium On Information Theory - Proceedings. 2622-2626. DOI: 10.1109/ISIT.2010.5513726 |
0.711 |
|
2010 |
Tyagi H, Narayan P, Gupta P. Secure computing Ieee International Symposium On Information Theory - Proceedings. 2612-2616. DOI: 10.1109/ISIT.2010.5513720 |
0.54 |
|
2009 |
Csiszár I, Narayan P. Secrecy generation for multiple input multiple output channel models Ieee International Symposium On Information Theory - Proceedings. 2447-2451. DOI: 10.1109/ISIT.2009.5206054 |
0.305 |
|
2009 |
Nitinawarat S, Barg A, Narayan P, Ye C, Reznik A. Perfect secrecy, perfect omniscience and steiner tree packing Ieee International Symposium On Information Theory - Proceedings. 1288-1292. DOI: 10.1109/ISIT.2009.5205948 |
0.71 |
|
2009 |
Tyagi H, Narayan P. The gelfand-pinsker channel: Strong converse and upper bound for the reliability function Ieee International Symposium On Information Theory - Proceedings. 1954-1957. DOI: 10.1109/ISIT.2009.5205656 |
0.579 |
|
2008 |
Csiszar I, Narayan P. Secrecy capacities for multiterminal channel models Ieee Transactions On Information Theory. 54: 2437-2452. DOI: 10.1109/Tit.2008.921705 |
0.399 |
|
2008 |
Nitinawarat S, Ye C, Barg A, Narayan P, Reznik A. Common randomness, multiuser secrecy and tree packing 46th Annual Allerton Conference On Communication, Control, and Computing. 217-220. DOI: 10.1109/ALLERTON.2008.4797559 |
0.711 |
|
2007 |
Komaee A, Krishnaprasad P, Narayan P. Active pointing control for short range free-space optical communication Communications in Information and Systems. 7: 177-194. DOI: 10.4310/Cis.2007.V7.N2.A5 |
0.723 |
|
2007 |
Chakraborty K, Narayan P. The poisson fading channel Forty-First Annual Conference On Information Sciences and Systems, Ciss 2007 - Proceedings. 331-332. DOI: 10.1109/Tit.2007.899559 |
0.587 |
|
2007 |
Komaee A, Krishnaprasad PS, Narayan P. Stochastic control for long range cooperative optical beam tracking Proceedings of the Ieee Conference On Decision and Control. 4938-4943. DOI: 10.1109/CDC.2007.4434843 |
0.696 |
|
2004 |
Csiszár I, Narayan P. Secrecy capacities for multiple terminals Ieee Transactions On Information Theory. 50: 3047-3061. DOI: 10.1109/Tit.2004.838380 |
0.419 |
|
2002 |
Khudanpur S, Narayan P. Order estimation for a special class of hidden Markov sources and binary renewal processes Ieee Transactions On Information Theory. 48: 1704-1713. DOI: 10.1109/Tit.2002.1003850 |
0.588 |
|
1998 |
Lapidoth A, Narayan P. Reliable communication under channel uncertainty Ieee Transactions On Information Theory. 44: 2148-2177. DOI: 10.1109/18.720535 |
0.352 |
|
1990 |
Csiszar I, Narayan P. Capacity of the Gaussian arbitrarily varying channel . 17. DOI: 10.1109/18.61125 |
0.346 |
|
1989 |
Csiszár I, Narayan P. Capacity and Decoding Rules for Classes of Arbitrarily Varying Channels Ieee Transactions On Information Theory. 35: 752-769. DOI: 10.1109/18.32153 |
0.379 |
|
1988 |
Csiszar I, Narayan P. Arbitrarily Varying Channels with Constrained Inputs and States Ieee Transactions On Information Theory. 34: 27-34. DOI: 10.1109/18.2598 |
0.357 |
|
1988 |
Hughes B, Narayan P. The Capacity of a Vector Gaussian Arbitrarily Varying Channel Ieee Transactions On Information Theory. 34: 995-1003. DOI: 10.1109/18.21222 |
0.366 |
|
1987 |
Narayan P, Snyder DL. Signal Set Design for Bandlimited Memoryless Multiple-Access Channels with Soft Decision Demodulation Ieee Transactions On Information Theory. 33: 539-556. DOI: 10.1109/TIT.1987.1057333 |
0.586 |
|
1987 |
Hughes B, Narayan P. Gaussian Arbitrarily Varying Channels Ieee Transactions On Information Theory. 33: 267-284. DOI: 10.1109/Tit.1987.1057288 |
0.353 |
|
1981 |
Narayan P, Snyder DL. The Two-User Cutoff Rate for an Asynchronous and a Synchronous Multiple-Access Channel Are the Same Ieee Transactions On Information Theory. 27: 414-419. DOI: 10.1109/TIT.1981.1056383 |
0.572 |
|
Show low-probability matches. |