Amos Lapidoth

Orcid: 0000-0002-4742-5124

Affiliations:
  • ETH Zurich, Switzerland


According to our database1, Amos Lapidoth authored at least 144 papers between 1993 and 2024.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 2004, "For contributions to robust communications under channel uncertainty.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Zero-Error Capacity of the Modulo-Additive Noise Channel With Help.
IEEE Trans. Inf. Theory, July, 2024

The State-Dependent Channel with a Rate-Limited Cribbing Helper.
Entropy, July, 2024

State-Dependent DMC With a Causal Helper.
IEEE Trans. Inf. Theory, May, 2024

Message-Cognizant Assistance and Feedback for the Gaussian Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Assisted Identification over Modulo-Additive Noise Channels.
Entropy, September, 2023

State-Dependent Channels with a Message-Cognizant Helper.
CoRR, 2023

On the Zero-Error Capacity with Helper.
Proceedings of the IEEE International Symposium on Information Theory, 2023

The Identification Capacity of the Modulo-Additive Noise Channel with Help.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Guessing Based on Compressed Side Information.
IEEE Trans. Inf. Theory, 2022

The Listsize Capacity of the Gaussian Channel with Decoder Assistance.
Entropy, 2022

2021
Other Helper Capacities.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Guessing a Tuple.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Encoder-Assisted Communications Over Additive Noise Channels.
IEEE Trans. Inf. Theory, 2020

Decoder-Assisted Communications Over Additive Noise Channels.
IEEE Trans. Commun., 2020

Conditional Rényi Divergences and Horse Betting.
Entropy, 2020

Encoder-Assistance for Additive Noise Channels.
Proceedings of the IEEE Information Theory Workshop, 2020

Gray-Wyner and Slepian-Wolf Guessing.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Semi-Robust Communications Over a Broadcast Channel.
IEEE Trans. Inf. Theory, 2019

Multiplexing Zero-Error and Rare-Error Communications Over a Noisy Channel.
IEEE Trans. Inf. Theory, 2019

Guessing Attacks on Distributed-Storage Systems.
IEEE Trans. Inf. Theory, 2019

The Gaussian Source-and-Data-Streams Problem.
IEEE Trans. Commun., 2019

Two Measures of Dependence.
Entropy, 2019

Guessing with Distributed Encoders.
Entropy, 2019

The Additive Noise Channel with a Helper.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Two-Stage Guessing.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Gambling and Rényi Divergence.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
The Rate-and-State Capacity with Feedback.
IEEE Trans. Inf. Theory, 2018

The Zero-Error Feedback Capacity of State-Dependent Channels.
IEEE Trans. Inf. Theory, 2018

Testing Against Independence and a Rényi Information Measure.
Proceedings of the IEEE Information Theory Workshop, 2018

Partially-Robust Communications over a Noisy Channel.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Variations on the Guessing Problem.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Identification via the Broadcast Channel.
IEEE Trans. Inf. Theory, 2017

Dependence balance in multiple access channels with correlated sources.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Multiplexing zero-error and rare-error communications over a noisy channel with feedback.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Distributed task encoding.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Maximum Rényi Entropy Rate.
IEEE Trans. Inf. Theory, 2016

A necessary condition for the transmissibility of correlated sources over a MAC.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Conveying data and State with feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2016

The zero-error capacity of the Gelfand-Pinsker channel with a feedback link.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Covering Point Patterns.
IEEE Trans. Inf. Theory, 2015

A method for the construction of optimal task encoders.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Constrained Source-Coding With Side Information.
IEEE Trans. Inf. Theory, 2014

Cognitive Wyner Networks With Clustered Decoding.
IEEE Trans. Inf. Theory, 2014

Coding Schemes and Asymptotic Capacity for the Gaussian Broadcast and Interference Channels With Feedback.
IEEE Trans. Inf. Theory, 2014

The Zero-Undetected-Error Capacity Approaches the Sperner Capacity.
IEEE Trans. Inf. Theory, 2014

On the Listsize Capacity With Feedback.
IEEE Trans. Inf. Theory, 2014

Encoding Tasks and Rényi Entropy.
IEEE Trans. Inf. Theory, 2014

Feedback, Cribbing, and Causal State Information on the Multiple-Access Channel.
IEEE Trans. Inf. Theory, 2014

Rényi entropy and quantization for densities.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Distributed storage for data security.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

A proof of the Ahlswede-Cai-Zhang conjecture.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Coding for the Gaussian channel with intermittent feedback.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Codes for tasks and Rényi entropy rate.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
The State-Dependent Semideterministic Broadcast Channel.
IEEE Trans. Inf. Theory, 2013

The Multiple-Access Channel With Causal Side Information: Double State.
IEEE Trans. Inf. Theory, 2013

The Multiple-Access Channel With Causal Side Information: Common State.
IEEE Trans. Inf. Theory, 2013

At Low SNR, Asymmetric Quantizers are Better.
IEEE Trans. Inf. Theory, 2013

On the average-listsize capacity and the cutoff rate of discrete memoryless channels with feedback.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Source coding, lists, and Rényi Entropy.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Multiple access channels with intermittent feedback and side information.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

The zero-undetected-error capacity of the low-noise cyclic triangle channel.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Dirty-Paper Coding for the Gaussian Multiaccess Channel With Conferencing.
IEEE Trans. Inf. Theory, 2012

On feedback, cribbing, and causal state-information on the multiple-access channel.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

The zero-undetected-error capacity of discrete memoryless channels with feedback.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
The Discrete-Time Poisson Channel at Low Input Powers.
IEEE Trans. Inf. Theory, 2011

Error Exponents for the Gaussian Channel With Active Noisy Feedback.
IEEE Trans. Inf. Theory, 2011

One-Bit Quantizers for Fading Channels
CoRR, 2011

A Note on Multiple-Access Channels with Strictly-Causal State Information
CoRR, 2011

Does Output Quantization Really Cause a Loss of 2dB?
CoRR, 2011

Constrained Wyner-Ziv source coding.
Proceedings of the Information Theory and Applications Workshop, 2011

New achievable rates for the Gaussian broadcast channel with feedback.
Proceedings of the 8th International Symposium on Wireless Communication Systems, 2011

Communicating remote Gaussian sources over Gaussian multiple access channels.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Constrained Wyner-Ziv coding.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Asymmetric quantizers are better at low SNR.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Computing the capacity of rewritable memories.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
On the AWGN MAC With Imperfect Feedback.
IEEE Trans. Inf. Theory, 2010

Sending a bivariate Gaussian over a Gaussian MAC.
IEEE Trans. Inf. Theory, 2010

Sending a bivariate Gaussian source over a Gaussian MAC with feedback.
IEEE Trans. Inf. Theory, 2010

On Multipath Fading Channels at High SNR.
IEEE Trans. Inf. Theory, 2010

Gaussian fading is the worst fading.
IEEE Trans. Inf. Theory, 2010

Broadcasting correlated Gaussians.
IEEE Trans. Inf. Theory, 2010

It takes half the energy of a photon to send one bit reliably on the Poisson channel with feedback
CoRR, 2010

Increased Capacity per Unit-Cost by Oversampling
CoRR, 2010

The State-Dependent Multiple-Access Channel with States Available at a Cribbing Encoder
CoRR, 2010

When Feedback Doubles the Prelog in AWGN Networks
CoRR, 2010

The multiple access channel with two independent states each known causally to one encoder.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Low-SNR Capacity of Noncoherent Fading Channels.
IEEE Trans. Inf. Theory, 2009

On the capacity of free-space optical intensity channels.
IEEE Trans. Inf. Theory, 2009

On the Capacity of the Discrete-Time Poisson Channel.
IEEE Trans. Inf. Theory, 2009

Channels that heat up.
IEEE Trans. Inf. Theory, 2009

On the Gaussian MAC with Imperfect Feedback
CoRR, 2009

Sending a Bi-Variate Gaussian over a Gaussian MAC
CoRR, 2009

A cognitive network with clustered decoding.
Proceedings of the IEEE International Symposium on Information Theory, 2009

The Poisson channel with side information.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008
The Poisson Channel at Low Input Powers
CoRR, 2008

Multipath Channels of Unbounded Capacity
CoRR, 2008

Multipath channels of bounded capacity.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

The Gaussian MAC with conferencing encoders.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Carbon Copying Onto Dirty Paper.
IEEE Trans. Inf. Theory, 2007

A Hot Channel
CoRR, 2007

On Cognitive Interference Networks
CoRR, 2007

Low SNR Capacity of Fading Channels -MIMO and Delay Spread.
Proceedings of the IEEE International Symposium on Information Theory, 2007

A Linear Interference Network with Local Side-Information.
Proceedings of the IEEE International Symposium on Information Theory, 2007

A Channel that Heats Up.
Proceedings of the IEEE International Symposium on Information Theory, 2007

The Gaussian Channel with Noisy Feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Duality Bounds on the Cutoff Rate With Applications to Ricean Fading.
IEEE Trans. Inf. Theory, 2006

The fading number of single-input multiple-output fading channels with memory.
IEEE Trans. Inf. Theory, 2006

On the Capacity of Fading MIMO Broadcast Channels with Imperfect Transmitter Side-Information
CoRR, 2006

On the Low SNR Capacity of Peak-Limited Non-Coherent Fading Channels with Memory
CoRR, 2006

Sending a Bi-Variate Gaussian Source over a Gaussian MAC.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Superimposed Coded and Uncoded Transmissions of a Gaussian Source over the Gaussian Channel.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
On the High-SNR Capacity of Noncoherent Networks.
IEEE Trans. Inf. Theory, 2005

On the asymptotic capacity of stationary Gaussian fading channels.
IEEE Trans. Inf. Theory, 2005

Monotonicity results for coherent MIMO Rician channels.
IEEE Trans. Inf. Theory, 2005

An improved achievable region for the discrete memoryless two-user multiple-access channel with noiseless feedback.
IEEE Trans. Inf. Theory, 2005

The fading number and degrees of freedom in non-coherent MIMO fading channels: a peace pipe.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Monotonicity results for coherent single-user and multiple-access MIMO Rician channels.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
On the High-SNR Capacity of Non-Coherent Networks
CoRR, 2004

Duality bounds on the cut-off rate with applications to Ricean fading.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

How good is an isotropic gaussian input on a MIMO Ricean channel?
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
On wide-band broadcast channels.
IEEE Trans. Inf. Theory, 2003

Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels.
IEEE Trans. Inf. Theory, 2003

2002
Fading channels: How perfect need "Perfect side information" be?
IEEE Trans. Inf. Theory, 2002

The Gaussian watermarking game.
IEEE Trans. Inf. Theory, 2002

On phase noise channels at high SNR.
Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2001
On the fading number of multi-antenna systems.
Proceedings of the 2001 IEEE Information Theory Workshop, 2001

2000
Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit.
IEEE Trans. Inf. Theory, 2000

Convolutional Encoders to Minimize Bit-Error-Rate.
Eur. Trans. Telecommun., 2000

1999
On the decoding of convolutional codes on an unknown channel.
IEEE Trans. Inf. Theory, 1999

1998
On the Universality of the LZ-Based Decoding Algorithm.
IEEE Trans. Inf. Theory, 1998

The Compound Channel Capacity of a Class of Finite-State Channels.
IEEE Trans. Inf. Theory, 1998

The Poisson Multiple-Access Channel.
IEEE Trans. Inf. Theory, 1998

Reliable Communication Under Channel Uncertainty.
IEEE Trans. Inf. Theory, 1998

Universal Decoding for Channels with Memory.
IEEE Trans. Inf. Theory, 1998

A lower bound on the bit-error-rate resulting from mismatched viterbi decoding.
Eur. Trans. Telecommun., 1998

1997
On the role of mismatch in rate distortion theory.
IEEE Trans. Inf. Theory, 1997

On the probability of symbol error in Viterbi decoders.
IEEE Trans. Commun., 1997

1996
Nearest neighbor decoding for additive non-Gaussian noise channels.
IEEE Trans. Inf. Theory, 1996

Mismatched decoding and the multiple-access channel.
IEEE Trans. Inf. Theory, 1996

1994
On information rates for mismatched decoders.
IEEE Trans. Inf. Theory, 1994

The performance of convolutional codes on the block erasure channel using various finite interleaving techniques.
IEEE Trans. Inf. Theory, 1994

Convolutional Codes and Finite Interleavers for the Block Erasure Channel.
Proceedings of the Mobile Communications: Advanced Systems and Components, 1994

1993
Bounds on the capacity of a spectrally constrained Poisson channel.
IEEE Trans. Inf. Theory, 1993

On the reliability function of the ideal Poisson channel with noiseless feedback.
IEEE Trans. Inf. Theory, 1993


  Loading...