The following pages link to Prakash Narayan (Q936482):
Displaying 46 items.
- Active pointing control for short range free-space optical communication (Q936483) (← links)
- (Q1389271) (redirect page) (← links)
- Typicality of good rate-distortion code (Q1389272) (← links)
- Dynamics of an SVEIRS epidemic model with vaccination and saturated incidence rate (Q1794703) (← links)
- Sampling Rate Distortion (Q2979123) (← links)
- Multiterminal Secrecy by Public Discussion (Q2981106) (← links)
- Secrecy Generation for Multiaccess Channel Models (Q2989443) (← links)
- Capacity of the Gaussian arbitrarily varying channel (Q3197750) (← links)
- Secrecy Capacities for Multiple Terminals (Q3546741) (← links)
- The Poisson Fading Channel (Q3549066) (← links)
- Secrecy Capacities for Multiterminal Channel Models (Q3604594) (← links)
- Signal set design for band-limited memoryless multiple-access channels with soft decision demodulation (Q3760422) (← links)
- Gaussian arbitrarily varying channels (Q3765703) (← links)
- Estimation of the Rate of a Doubly Stochastic Time-Space Poisson Process (Q3769817) (← links)
- Arbitrarily varying channels with constrained inputs and states (Q3795606) (← links)
- The capacity of the arbitrarily varying channel revisited: positivity, constraints (Q3798585) (← links)
- The capacity of a vector Gaussian arbitrarily varying channel (Q3818235) (← links)
- Series expansions of probability generating functions and bounds for the extinction probability of a branching process (Q3893077) (← links)
- The two-user cutoff rate for an asynchronous and a synchronous multiple-access channel are the same (Q3910433) (← links)
- (Q3915701) (← links)
- On the Extinction Time of a Continuous time Markov Branching Process (Q3962287) (← links)
- Jointly optimal admission and routing controls at a network node (Q4288007) (← links)
- Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures (Q4324179) (← links)
- Common randomness and secret key generation with a helper (Q4503542) (← links)
- Capacities of time-varying multiple-access channels with side information (Q4544761) (← links)
- Universal Sampling Rate Distortion (Q4562137) (← links)
- Order estimation for a special class of hidden Markov sources and binary renewal processes (Q4674537) (← links)
- Reliable communication under channel uncertainty (Q4701189) (← links)
- On fractional linear bounds for probability generating functions (Q4722922) (← links)
- Capacity and decoding rules for classes of arbitrarily varying channels (Q4735128) (← links)
- (Q4817823) (← links)
- Channel capacity for a given decoding metric (Q4840869) (← links)
- (Q4857250) (← links)
- Error exponents for successive refinement by partitioning (Q4880016) (← links)
- The optimal error exponent for Markov order estimation (Q4896827) (← links)
- Multiterminal Secrecy Generation and Tree Packing (Q4931672) (← links)
- Distribution Privacy Under Function Recoverability (Q5088472) (← links)
- Data Privacy for a $\rho$ -Recoverable Function (Q5224009) (← links)
- State-Dependent Channels: Strong Converse and Bounds on Reliability Function (Q5261112) (← links)
- Secret Key Generation for Correlated Gaussian Sources (Q5271875) (← links)
- Secret Key and Private Key Constructions for Simple Multiterminal Source Models (Q5272096) (← links)
- When Is a Function Securely Computable? (Q5272264) (← links)
- Secret Key Generation for a Pairwise Independent Network Model (Q5281196) (← links)
- Perfect Omniscience, Perfect Secrecy, and Steiner Tree Packing (Q5281197) (← links)
- How Many Queries Will Resolve Common Randomness? (Q5346362) (← links)
- Corrections to “Distribution Privacy Under Function Recoverability” (Q6194016) (← links)
