The SCEAS System
| |||||||

## Search the dblp DataBase
Prakash Narayan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Imre Csiszár, Prakash Narayan
**Common randomness and secret key generation with a helper.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:2, pp:344-366 [Journal] - Imre Csiszár, Prakash Narayan
**Secrecy capacities for multiple terminals.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2004, v:50, n:12, pp:3047-3061 [Journal] - Imre Csiszár, Prakash Narayan
**Arbitrarily varying channels with constrained inputs and states.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1988, v:34, n:1, pp:27-34 [Journal] - Imre Csiszár, Prakash Narayan
**The capacity of the arbitrarily varying channel revisited: Positivity, constraints.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1988, v:34, n:2, pp:181-193 [Journal] - Imre Csiszár, Prakash Narayan
**Capacity and decoding rules for classes of arbitrarily varying channels.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:752-769 [Journal] - Imre Csiszár, Prakash Narayan
**Channel capacity for a given decoding metric.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1995, v:41, n:1, pp:35-43 [Journal] - Arnab Das, Prakash Narayan
**Capacities of time-varying multiple-access channels with side information.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:1, pp:4-25 [Journal] - L. Finesso, Chuang-Chun Liu, Prakash Narayan
**The optimal error exponent for Markov order estimation.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1488-1497 [Journal] - Brian L. Hughes, Prakash Narayan
**Gaussian arbitrarily varying channels.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:2, pp:267-284 [Journal] - Brian L. Hughes, Prakash Narayan
**The capacity of a vector Gaussian arbitrarily varying channel.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:995-1003 [Journal] - A. Kanlis, Prakash Narayan
**Error exponents for successive refinement by partitioning.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:275-282 [Journal] - Sanjeev Khudanpur, Prakash Narayan
**Order estimation for a special class of hidden Markov sources and binary renewal processes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:6, pp:1704-1713 [Journal] - Chuang-Chun Liu, Prakash Narayan
**Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:4, pp:1167-1180 [Journal] - Prakash Narayan
**The cutoff-rate region for multiple-access communication systems (D.Sc. Thesis abstr.).**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1982, v:28, n:2, pp:393- [Journal] - Prakash Narayan, Donald L. Snyder
**The two-user cutoff rate for an asynchronous and a synchronous multiple-access channel are the same.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1981, v:27, n:4, pp:414-419 [Journal] - Prakash Narayan, Donald L. Snyder
**Signal set design for band-limited memoryless multiple-access channels with soft decision demodulation.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:4, pp:539-556 [Journal] - Kaushik Chakraborty, Prakash Narayan
**The Poisson Fading Channel.**[Citation Graph (0, 0)][DBLP] CISS, 2007, pp:331-332 [Conf] **Multiterminal Secrecy Generation and Tree Packing.**[Citation Graph (, )][DBLP]**Full Life-Cycle Support for End-to-End Processes.**[Citation Graph (, )][DBLP]**The Secret Key-Private Key Capacity Region for Three Terminals**[Citation Graph (, )][DBLP]**Secret Key and Private Key Constructions for Simple Multiterminal Source Models**[Citation Graph (, )][DBLP]**The Private Key Capacity Region for Three Terminals**[Citation Graph (, )][DBLP]**The Gelfand-Pinsker Channel: Strong Converse and Upper Bound for the Reliability Function**[Citation Graph (, )][DBLP]**When is a Function Securely Computable?**[Citation Graph (, )][DBLP]**Secret Key Generation for a Pairwise Independent Network Model**[Citation Graph (, )][DBLP]**Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing**[Citation Graph (, )][DBLP]**Secret Key and Private Key Constructions for Simple Multiterminal Source Models**[Citation Graph (, )][DBLP]
Search in 0.029secs, Finished in 0.030secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |