| Publication | Date of Publication | Type |
|---|
List privacy under function recoverability
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Shared information for a Markov chain on a tree
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Corrections to “Distribution Privacy Under Function Recoverability”
IEEE Transactions on Information Theory | 2024-03-19 | Paper |
Distribution Privacy Under Function Recoverability
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Data Privacy for a $\rho$ -Recoverable Function
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Universal Sampling Rate Distortion
IEEE Transactions on Information Theory | 2018-12-18 | Paper |
Dynamics of an SVEIRS epidemic model with vaccination and saturated incidence rate
International Journal of Applied and Computational Mathematics | 2018-10-15 | Paper |
Secret Key Generation for a Pairwise Independent Network Model
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Perfect Omniscience, Perfect Secrecy, and Steiner Tree Packing
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
When Is a Function Securely Computable?
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Secret Key Generation for Correlated Gaussian Sources
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Secret Key and Private Key Constructions for Simple Multiterminal Source Models
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Secrecy Generation for Multiaccess Channel Models
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
How Many Queries Will Resolve Common Randomness?
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Multiterminal secrecy by public discussion
Foundations and Trends™ in Communications and Information Theory | 2017-05-08 | Paper |
Sampling Rate Distortion
IEEE Transactions on Information Theory | 2017-05-02 | Paper |
State-dependent channels: strong converse and bounds on reliability function
Applied and Numerical Harmonic Analysis | 2015-07-01 | Paper |
Multiterminal Secrecy Generation and Tree Packing
Lecture Notes in Computer Science | 2010-09-29 | Paper |
Secrecy Capacities for Multiterminal Channel Models
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
The Poisson Fading Channel
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Secrecy Capacities for Multiple Terminals
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Active pointing control for short range free-space optical communication
Communications in Information and Systems | 2008-08-14 | Paper |
Order estimation for a special class of hidden Markov sources and binary renewal processes
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
| scientific article; zbMATH DE number 2101240 (Why is no real title available?) | 2004-09-21 | Paper |
Capacities of time-varying multiple-access channels with side information
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Common randomness and secret key generation with a helper
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Reliable communication under channel uncertainty
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Typicality of good rate-distortion code
Problems of Information Transmission | 1998-07-08 | Paper |
The optimal error exponent for Markov order estimation
IEEE Transactions on Information Theory | 1997-02-12 | Paper |
Error exponents for successive refinement by partitioning
IEEE Transactions on Information Theory | 1996-06-02 | Paper |
| scientific article; zbMATH DE number 820505 (Why is no real title available?) | 1995-11-26 | Paper |
Channel capacity for a given decoding metric
IEEE Transactions on Information Theory | 1995-11-06 | Paper |
Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures
IEEE Transactions on Information Theory | 1995-03-01 | Paper |
Jointly optimal admission and routing controls at a network node
Communications in Statistics. Stochastic Models | 1994-07-07 | Paper |
Capacity of the Gaussian arbitrarily varying channel
IEEE Transactions on Information Theory | 1991-01-01 | Paper |
The capacity of a vector Gaussian arbitrarily varying channel
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
Capacity and decoding rules for classes of arbitrarily varying channels
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
The capacity of the arbitrarily varying channel revisited: positivity, constraints
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
Arbitrarily varying channels with constrained inputs and states
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
Gaussian arbitrarily varying channels
IEEE Transactions on Information Theory | 1987-01-01 | Paper |
Signal set design for band-limited memoryless multiple-access channels with soft decision demodulation
IEEE Transactions on Information Theory | 1987-01-01 | Paper |
On fractional linear bounds for probability generating functions
Journal of Applied Probability | 1986-01-01 | Paper |
Estimation of the Rate of a Doubly Stochastic Time-Space Poisson Process
IMA Journal of Mathematical Control and Information | 1986-01-01 | Paper |
On the Extinction Time of a Continuous time Markov Branching Process
Australian Journal of Statistics | 1982-01-01 | Paper |
The two-user cutoff rate for an asynchronous and a synchronous multiple-access channel are the same
IEEE Transactions on Information Theory | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3727290 (Why is no real title available?) | 1981-01-01 | Paper |
Series expansions of probability generating functions and bounds for the extinction probability of a branching process
Journal of Applied Probability | 1980-01-01 | Paper |
