The following pages link to Amos Lapidoth (Q2705961):
Displayed 50 items.
- Mismatched decoding revisited: general alphabets, channels with memory, and the wide-band limit (Q2705963) (← links)
- Maximum Rényi Entropy Rate (Q2976956) (← links)
- Covering Point Patterns (Q2977256) (← links)
- Feedback, Cribbing, and Causal State Information on the Multiple-Access Channel (Q2979154) (← links)
- On the Listsize Capacity With Feedback (Q2983316) (← links)
- Cognitive Wyner Networks With Clustered Decoding (Q2986106) (← links)
- Encoding Tasks and Rényi Entropy (Q2986130) (← links)
- The Zero-Undetected-Error Capacity Approaches the Sperner Capacity (Q2986252) (← links)
- Constrained Source-Coding With Side Information (Q2986319) (← links)
- The State-Dependent Semideterministic Broadcast Channel (Q2989314) (← links)
- The Multiple-Access Channel With Causal Side Information: Double State (Q2989351) (← links)
- The Multiple-Access Channel With Causal Side Information: Common State (Q2989444) (← links)
- Dirty-Paper Coding for the Gaussian Multiaccess Channel With Conferencing (Q2989762) (← links)
- An Improved Achievable Region for the Discrete Memoryless Two-User Multiple-Access Channel With Noiseless Feedback (Q3546616) (← links)
- Monotonicity Results for Coherent MIMO Rician Channels (Q3547022) (← links)
- On the Asymptotic Capacity of Stationary Gaussian Fading Channels (Q3547209) (← links)
- On the High-SNR Capacity of Noncoherent Networks (Q3547210) (← links)
- Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels (Q3547211) (← links)
- The fading number of single-input multiple-output fading channels with memory (Q3547212) (← links)
- Duality bounds on the cutoff rate with applications to Ricean fading (Q3547214) (← links)
- On wide-band broadcast channels (Q3547215) (← links)
- Carbon Copying Onto Dirty Paper (Q3548257) (← links)
- Bounds on the capacity of a spectrally constrained Poisson channel (Q4034427) (← links)
- On the reliability function of the ideal Poisson channel with noiseless feedback (Q4202068) (← links)
- The performance of convolutional codes on the block erasure channel using various finite interleaving techniques (Q4324116) (← links)
- On the role of mismatch in rate distortion theory (Q4336283) (← links)
- The compound channel capacity of a class of finite-state channels (Q4400317) (← links)
- On the decoding of convolutional codes on an unknown channel (Q4503455) (← links)
- The Rate-and-State Capacity with Feedback (Q4566752) (← links)
- Fading channels: how perfect need "perfect side information" be? (Q4674495) (← links)
- The Gaussian watermarking game (Q4674531) (← links)
- Universal decoding for channels with memory (Q4701153) (← links)
- On the universality of the LZ-based decoding algorithm (Q4701154) (← links)
- Reliable communication under channel uncertainty (Q4701189) (← links)
- On information rates for mismatched decoders (Q4850296) (← links)
- Mismatched decoding and the multiple-access channel (Q4896822) (← links)
- Nearest neighbor decoding for additive non-Gaussian noise channels (Q4896830) (← links)
- On the Capacity of Free-Space Optical Intensity Channels (Q4974010) (← links)
- On the Capacity of the Discrete-Time Poisson Channel (Q4975698) (← links)
- Low-SNR Capacity of Noncoherent Fading Channels (Q4975794) (← links)
- Channels That Heat Up (Q4975958) (← links)
- Guessing Based on Compressed Side Information (Q5088549) (← links)
- Conditional and Relevant Common Information (Q5095266) (← links)
- Encoder-Assisted Communications Over Additive Noise Channels (Q5138842) (← links)
- Guessing Attacks on Distributed-Storage Systems (Q5211487) (← links)
- Multiplexing Zero-Error and Rare-Error Communications Over a Noisy Channel (Q5223972) (← links)
- Semi-Robust Communications Over a Broadcast Channel (Q5224129) (← links)
- The Discrete-Time Poisson Channel at Low Input Powers (Q5273589) (← links)
- Error Exponents for the Gaussian Channel With Active Noisy Feedback (Q5281016) (← links)
- On Multipath Fading Channels at High SNR (Q5281154) (← links)