![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Amos Lapidoth
Person information
- affiliation: ETH Zurich, Switzerland
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j72]Amos Lapidoth
, Yossef Steinberg
:
The State-Dependent Channel with a Rate-Limited Cribbing Helper. Entropy 26(7): 570 (2024) - [j71]Amos Lapidoth
, Ligong Wang
:
State-Dependent DMC With a Causal Helper. IEEE Trans. Inf. Theory 70(5): 3162-3174 (2024) - [j70]Amos Lapidoth
, Yiming Yan
:
On the Zero-Error Capacity of the Modulo-Additive Noise Channel With Help. IEEE Trans. Inf. Theory 70(7): 4721-4730 (2024) - [i62]Amos Lapidoth, Yossef Steinberg:
The State-Dependent Channel with a Rate-Limited Cribbing Helper. CoRR abs/2401.12763 (2024) - 2023
- [j69]Amos Lapidoth
, Baohua Ni
:
Assisted Identification over Modulo-Additive Noise Channels. Entropy 25(9): 1314 (2023) - [c63]Amos Lapidoth, Baohua Ni:
The Identification Capacity of the Modulo-Additive Noise Channel with Help. ISIT 2023: 13-14 - [c62]Amos Lapidoth, Yiming Yan:
On the Zero-Error Capacity with Helper. ISIT 2023: 1208-1212 - [i61]Amos Lapidoth, Ligong Wang:
State-Dependent DMC with a Causal Helper. CoRR abs/2304.12687 (2023) - [i60]Amos Lapidoth, Ligong Wang, Yiming Yan:
Message-Cognizant Assistance and Feedback for the Gaussian Channel. CoRR abs/2310.15768 (2023) - [i59]Amos Lapidoth, Ligong Wang, Yiming Yan:
State-Dependent Channels with a Message-Cognizant Helper. CoRR abs/2311.08220 (2023) - 2022
- [j68]Amos Lapidoth
, Yiming Yan:
The Listsize Capacity of the Gaussian Channel with Decoder Assistance. Entropy 24(1): 29 (2022) - [j67]Robert Graczyk
, Amos Lapidoth
, Neri Merhav
, Christoph Pfister
:
Guessing Based on Compressed Side Information. IEEE Trans. Inf. Theory 68(7): 4244-4256 (2022) - 2021
- [c61]Amos Lapidoth, Gian Marti
, Yiming Yan:
Other Helper Capacities. ISIT 2021: 1272-1277 - [c60]Robert Graczyk, Amos Lapidoth, Yiming Yan:
Guessing a Tuple. ISIT 2021: 1997-2001 - [i58]Robert Graczyk, Amos Lapidoth, Neri Merhav, Christoph Pfister:
Guessing Based on Compressed Side Information. CoRR abs/2106.13341 (2021) - 2020
- [j66]Cédric Bleuler, Amos Lapidoth
, Christoph Pfister:
Conditional Rényi Divergences and Horse Betting. Entropy 22(3): 316 (2020) - [j65]Shraga I. Bross
, Amos Lapidoth
, Gian Marti
:
Decoder-Assisted Communications Over Additive Noise Channels. IEEE Trans. Commun. 68(7): 4150-4161 (2020) - [j64]Amos Lapidoth
, Gian Marti
:
Encoder-Assisted Communications Over Additive Noise Channels. IEEE Trans. Inf. Theory 66(11): 6607-6616 (2020) - [c59]Robert Graczyk, Amos Lapidoth:
Gray-Wyner and Slepian-Wolf Guessing. ISIT 2020: 2189-2193 - [c58]Amos Lapidoth, Gian Marti
:
Encoder-Assistance for Additive Noise Channels. ITW 2020: 1-5
2010 – 2019
- 2019
- [j63]Annina Bracher, Amos Lapidoth
, Christoph Pfister:
Guessing with Distributed Encoders. Entropy 21(3): 298 (2019) - [j62]Amos Lapidoth
, Christoph Pfister:
Two Measures of Dependence. Entropy 21(8): 778 (2019) - [j61]Shraga I. Bross
, Amos Lapidoth
:
The Gaussian Source-and-Data-Streams Problem. IEEE Trans. Commun. 67(8): 5618-5628 (2019) - [j60]Tibor Keresztfalvi
, Amos Lapidoth
:
Multiplexing Zero-Error and Rare-Error Communications Over a Noisy Channel. IEEE Trans. Inf. Theory 65(5): 2824-2837 (2019) - [j59]Tibor Keresztfalvi
, Amos Lapidoth
:
Semi-Robust Communications Over a Broadcast Channel. IEEE Trans. Inf. Theory 65(8): 5043-5049 (2019) - [j58]Annina Bracher
, Eran Hof, Amos Lapidoth
:
Guessing Attacks on Distributed-Storage Systems. IEEE Trans. Inf. Theory 65(11): 6975-6998 (2019) - [c57]Robert Graczyk, Amos Lapidoth:
Two-Stage Guessing. ISIT 2019: 475-479 - [c56]Cédric Bleuler, Amos Lapidoth, Christoph Pfister:
Gambling and Rényi Divergence. ISIT 2019: 2214-2218 - [c55]Shraga I. Bross, Amos Lapidoth:
The Additive Noise Channel with a Helper. ITW 2019: 1-5 - [i57]Cédric Bleuler, Amos Lapidoth, Christoph Pfister:
Gambling and Rényi Divergence. CoRR abs/1901.06278 (2019) - 2018
- [j57]Shraga I. Bross
, Amos Lapidoth
:
The Rate-and-State Capacity with Feedback. IEEE Trans. Inf. Theory 64(3): 1893-1918 (2018) - [j56]Annina Bracher
, Amos Lapidoth
:
The Zero-Error Feedback Capacity of State-Dependent Channels. IEEE Trans. Inf. Theory 64(5): 3538-3578 (2018) - [c54]Robert Graczyk, Amos Lapidoth:
Variations on the Guessing Problem. ISIT 2018: 231-235 - [c53]Tibor Keresztfalvi, Amos Lapidoth:
Partially-Robust Communications over a Noisy Channel. ISIT 2018: 2003-2006 - [c52]Amos Lapidoth, Christoph Pfister:
Testing Against Independence and a Rényi Information Measure. ITW 2018: 1-5 - [i56]Amos Lapidoth, Christoph Pfister:
Testing Against Independence and a Rényi Information Measure. CoRR abs/1805.11059 (2018) - 2017
- [j55]Annina Bracher
, Amos Lapidoth:
Identification via the Broadcast Channel. IEEE Trans. Inf. Theory 63(6): 3480-3501 (2017) - [c51]Tibor Keresztfalvi, Amos Lapidoth:
Multiplexing zero-error and rare-error communications over a noisy channel with feedback. ISIT 2017: 1608-1612 - [c50]Amos Lapidoth, Shirin Saeedi Bidokhti, Michèle A. Wigger:
Dependence balance in multiple access channels with correlated sources. ISIT 2017: 1663-1667 - [c49]Annina Bracher, Amos Lapidoth, Christoph Pfister:
Distributed task encoding. ISIT 2017: 1993-1997 - [i55]Annina Bracher, Eran Hof, Amos Lapidoth:
Guessing Attacks on Distributed-Storage Systems. CoRR abs/1701.01981 (2017) - [i54]Annina Bracher, Amos Lapidoth, Christoph Pfister:
Distributed Task Encoding. CoRR abs/1705.02247 (2017) - [i53]Tibor Keresztfalvi, Amos Lapidoth:
Semi-Robust Communications over a Broadcast Channel. CoRR abs/1711.00657 (2017) - 2016
- [j54]Christoph Bunte, Amos Lapidoth:
Maximum Rényi Entropy Rate. IEEE Trans. Inf. Theory 62(3): 1193-1205 (2016) - [c48]Annina Bracher, Amos Lapidoth:
The zero-error capacity of the Gelfand-Pinsker channel with a feedback link. ISIT 2016: 1272-1276 - [c47]Shraga I. Bross, Amos Lapidoth:
Conveying data and State with feedback. ISIT 2016: 1277-1281 - [c46]Amos Lapidoth, Michèle A. Wigger:
A necessary condition for the transmissibility of correlated sources over a MAC. ISIT 2016: 2024-2028 - [i52]Annina Bracher, Amos Lapidoth:
Identification via the Broadcast Channel. CoRR abs/1603.08244 (2016) - [i51]Amos Lapidoth, Christoph Pfister:
Two Measures of Dependence. CoRR abs/1607.02330 (2016) - [i50]Annina Bracher, Amos Lapidoth:
The Zero-Error Feedback Capacity of State-Dependent Channels. CoRR abs/1607.02495 (2016) - 2015
- [j53]Amos Lapidoth, Andreas Malär, Ligong Wang:
Covering Point Patterns. IEEE Trans. Inf. Theory 61(9): 4521-4533 (2015) - [c45]Annina Bracher, Eran Hof, Amos Lapidoth:
Guessing Attacks on Distributed-Storage Systems. ISIT 2015: 1585-1589 - [c44]Amos Lapidoth, Christoph Pfister:
A method for the construction of optimal task encoders. ISIT 2015: 2540-2544 - [i49]Christoph Bunte, Amos Lapidoth:
Maximum Rényi Entropy Rate. CoRR abs/1501.00539 (2015) - 2014
- [j52]Michael Gastpar, Amos Lapidoth, Yossef Steinberg
, Michèle A. Wigger:
Coding Schemes and Asymptotic Capacity for the Gaussian Broadcast and Interference Channels With Feedback. IEEE Trans. Inf. Theory 60(1): 54-71 (2014) - [j51]Amos Lapidoth, Andreas Malär, Michèle A. Wigger:
Constrained Source-Coding With Side Information. IEEE Trans. Inf. Theory 60(6): 3218-3237 (2014) - [j50]Christoph Bunte, Amos Lapidoth, Alex Samorodnitsky:
The Zero-Undetected-Error Capacity Approaches the Sperner Capacity. IEEE Trans. Inf. Theory 60(7): 3825-3833 (2014) - [j49]Christoph Bunte, Amos Lapidoth:
Encoding Tasks and Rényi Entropy. IEEE Trans. Inf. Theory 60(9): 5065-5076 (2014) - [j48]Amos Lapidoth, Nathan Levy, Shlomo Shamai (Shitz)
, Michèle A. Wigger:
Cognitive Wyner Networks With Clustered Decoding. IEEE Trans. Inf. Theory 60(10): 6342-6367 (2014) - [j47]Christoph Bunte, Amos Lapidoth:
On the Listsize Capacity With Feedback. IEEE Trans. Inf. Theory 60(11): 6733-6748 (2014) - [j46]Annina Bracher, Amos Lapidoth:
Feedback, Cribbing, and Causal State Information on the Multiple-Access Channel. IEEE Trans. Inf. Theory 60(12): 7627-7654 (2014) - [c43]Christoph Bunte, Amos Lapidoth:
Codes for tasks and Rényi entropy rate. ISIT 2014: 346-350 - [c42]Christoph Bunte, Amos Lapidoth, Alex Samorodnitsky:
A proof of the Ahlswede-Cai-Zhang conjecture. ISIT 2014: 1116-1120 - [c41]Annina Bracher, Amos Lapidoth:
Identification via the broadcast channel. ISIT 2014: 1942-1946 - [c40]Christoph Bunte, Amos Lapidoth, Lars Palzer:
Coding for the Gaussian channel with intermittent feedback. ISIT 2014: 2559-2563 - [c39]Christoph Bunte, Amos Lapidoth:
Rényi entropy and quantization for densities. ITW 2014: 257-261 - [c38]Annina Bracher, Eran Hof, Amos Lapidoth:
Distributed storage for data security. ITW 2014: 506-510 - [i48]Christoph Bunte, Amos Lapidoth:
Encoding Tasks and Rényi Entropy. CoRR abs/1401.6338 (2014) - [i47]Annina Bracher, Eran Hof, Amos Lapidoth:
Distributed Storage for Data Security. CoRR abs/1405.4981 (2014) - 2013
- [j45]Amos Lapidoth, Yossef Steinberg
:
The Multiple-Access Channel With Causal Side Information: Common State. IEEE Trans. Inf. Theory 59(1): 32-50 (2013) - [j44]Amos Lapidoth, Yossef Steinberg
:
The Multiple-Access Channel With Causal Side Information: Double State. IEEE Trans. Inf. Theory 59(3): 1379-1393 (2013) - [j43]Amos Lapidoth, Ligong Wang:
The State-Dependent Semideterministic Broadcast Channel. IEEE Trans. Inf. Theory 59(4): 2242-2251 (2013) - [j42]Tobias Koch
, Amos Lapidoth:
At Low SNR, Asymmetric Quantizers are Better. IEEE Trans. Inf. Theory 59(9): 5421-5445 (2013) - [c37]Christoph Bunte, Amos Lapidoth, Alex Samorodnitsky:
The zero-undetected-error capacity of the low-noise cyclic triangle channel. ISIT 2013: 91-95 - [c36]Ashish Khisti, Amos Lapidoth:
Multiple access channels with intermittent feedback and side information. ISIT 2013: 2631-2635 - [c35]Christoph Bunte, Amos Lapidoth:
Source coding, lists, and Rényi Entropy. ITW 2013: 1-5 - [c34]Christoph Bunte, Amos Lapidoth:
On the average-listsize capacity and the cutoff rate of discrete memoryless channels with feedback. ITW 2013: 1-5 - [i46]Amos Lapidoth, Andreas Malär, Michèle A. Wigger:
Constrained Source Coding with Side Information. CoRR abs/1301.5109 (2013) - [i45]Christoph Bunte, Amos Lapidoth, Alex Samorodnitsky:
The Zero-Undetected-Error Capacity Approaches the Sperner Capacity. CoRR abs/1309.4930 (2013) - [i44]Christoph Bunte, Amos Lapidoth:
On the listsize capacity with feedback. CoRR abs/1311.0195 (2013) - [i43]Christoph Bunte, Amos Lapidoth:
Codes for Tasks and Rényi Entropy Rate. CoRR abs/1312.3735 (2013) - 2012
- [j41]Shraga I. Bross, Amos Lapidoth, Michèle A. Wigger:
Dirty-Paper Coding for the Gaussian Multiaccess Channel With Conferencing. IEEE Trans. Inf. Theory 58(9): 5640-5668 (2012) - [c33]Christoph Bunte, Amos Lapidoth:
The zero-undetected-error capacity of discrete memoryless channels with feedback. Allerton Conference 2012: 1838-1842 - [c32]Amos Lapidoth, Ligong Wang:
The state-dependent semideterministic broadcast channel. ISIT 2012: 591-595 - [c31]Annina Bracher, Amos Lapidoth, Yossef Steinberg
:
On feedback, cribbing, and causal state-information on the multiple-access channel. ITW 2012: 134-138 - [i42]Tobias Koch, Amos Lapidoth:
At Low SNR Asymmetric Quantizers Are Better. CoRR abs/1201.2523 (2012) - [i41]Amos Lapidoth, Nathan Levy, Shlomo Shamai, Michèle A. Wigger:
Cognitive Wyner Networks with Clustered Decoding. CoRR abs/1203.3659 (2012) - 2011
- [j40]Young-Han Kim, Amos Lapidoth, Tsachy Weissman:
Error Exponents for the Gaussian Channel With Active Noisy Feedback. IEEE Trans. Inf. Theory 57(3): 1223-1236 (2011) - [j39]Amos Lapidoth, Jeffrey H. Shapiro, Vinodh Venkatesan, Ligong Wang:
The Discrete-Time Poisson Channel at Low Input Powers. IEEE Trans. Inf. Theory 57(6): 3260-3272 (2011) - [c30]Amos Lapidoth, Andreas Malär, Ligong Wang:
Covering point patterns. ISIT 2011: 51-55 - [c29]Amos Lapidoth, I-Hsiang Wang:
Communicating remote Gaussian sources over Gaussian multiple access channels. ISIT 2011: 786-790 - [c28]Amos Lapidoth, Andreas Malär, Michèle A. Wigger:
Constrained Wyner-Ziv coding. ISIT 2011: 1076-1080 - [c27]Christoph Bunte, Amos Lapidoth:
Computing the capacity of rewritable memories. ISIT 2011: 2512-2516 - [c26]Tobias Koch
, Amos Lapidoth:
Asymmetric quantizers are better at low SNR. ISIT 2011: 2592-2596 - [c25]Michael Gastpar, Amos Lapidoth, Yossef Steinberg
, Michèle A. Wigger:
New achievable rates for the Gaussian broadcast channel with feedback. ISWCS 2011: 579-583 - [c24]Amos Lapidoth, Andreas Malär, Michèle A. Wigger:
Constrained Wyner-Ziv source coding. ITA 2011: 471-472 - [i40]Tobias Koch, Amos Lapidoth:
Does Output Quantization Really Cause a Loss of 2dB? CoRR abs/1101.0970 (2011) - [i39]Amos Lapidoth, Andreas Malär, Ligong Wang:
Covering Point Patterns. CoRR abs/1102.3080 (2011) - [i38]Amos Lapidoth, Yossef Steinberg:
A Note on Multiple-Access Channels with Strictly-Causal State Information. CoRR abs/1106.0380 (2011) - [i37]Amos Lapidoth, Ligong Wang:
The State-Dependent Semideterministic Broadcast Channel. CoRR abs/1111.1144 (2011) - [i36]Tobias Koch, Amos Lapidoth:
One-Bit Quantizers for Fading Channels. CoRR abs/1112.5314 (2011) - 2010
- [j38]Tobias Koch
, Amos Lapidoth:
Gaussian fading is the worst fading. IEEE Trans. Inf. Theory 56(3): 1158-1165 (2010) - [j37]Amos Lapidoth, Stephan Tinguely:
Sending a bivariate Gaussian source over a Gaussian MAC with feedback. IEEE Trans. Inf. Theory 56(4): 1852-1864 (2010) - [j36]Amos Lapidoth, Stephan Tinguely:
Sending a bivariate Gaussian over a Gaussian MAC. IEEE Trans. Inf. Theory 56(6): 2714-2752 (2010) - [j35]Shraga I. Bross, Amos Lapidoth, Stephan Tinguely:
Broadcasting correlated Gaussians. IEEE Trans. Inf. Theory 56(7): 3057-3068 (2010) - [j34]Amos Lapidoth, Michèle A. Wigger:
On the AWGN MAC With Imperfect Feedback. IEEE Trans. Inf. Theory 56(11): 5432-5476 (2010) - [j33]Tobias Koch
, Amos Lapidoth:
On Multipath Fading Channels at High SNR. IEEE Trans. Inf. Theory 56(12): 5945-5957 (2010) - [c23]Amos Lapidoth, Yossef Steinberg:
The multiple access channel with two independent states each known causally to one encoder. ISIT 2010: 480-484 - [i35]Michael Gastpar, Amos Lapidoth, Michèle A. Wigger:
When Feedback Doubles the Prelog in AWGN Networks. CoRR abs/1003.6082 (2010) - [i34]Shraga I. Bross, Amos Lapidoth:
The State-Dependent Multiple-Access Channel with States Available at a Cribbing Encoder. CoRR abs/1007.3896 (2010) - [i33]Tobias Koch, Amos Lapidoth:
Increased Capacity per Unit-Cost by Oversampling. CoRR abs/1008.5393 (2010) - [i32]Shahab Asoodeh, Amos Lapidoth, Ligong Wang:
It takes half the energy of a photon to send one bit reliably on the Poisson channel with feedback. CoRR abs/1010.5382 (2010)
2000 – 2009
- 2009
- [j32]Amos Lapidoth, Stefan M. Moser:
On the Capacity of the Discrete-Time Poisson Channel. IEEE Trans. Inf. Theory 55(1): 303-322 (2009) - [j31]Vignesh Sethuraman, Ligong Wang, Bruce E. Hajek, Amos Lapidoth:
Low-SNR Capacity of Noncoherent Fading Channels. IEEE Trans. Inf. Theory 55(4): 1555-1574 (2009) - [j30]Tobias Koch
, Amos Lapidoth, Paul-Peter Sotiriadis
:
Channels that heat up. IEEE Trans. Inf. Theory 55(8): 3594-3612 (2009) - [j29]Amos Lapidoth, Stefan M. Moser, Michèle A. Wigger:
On the capacity of free-space optical intensity channels. IEEE Trans. Inf. Theory 55(10): 4449-4461 (2009) - [c22]Shraga I. Bross, Amos Lapidoth, Ligong Wang:
The Poisson channel with side information. Allerton 2009: 574-578 - [c21]Nathan Levy, Shlomo Shamai
, Michèle A. Wigger, Amos Lapidoth:
A cognitive network with clustered decoding. ISIT 2009: 596-600 - [i31]Tobias Koch, Amos Lapidoth:
On Multipath Fading Channels at High SNR. CoRR abs/0901.0521 (2009) - [i30]Amos Lapidoth, Stephan Tinguely:
Sending a Bi-Variate Gaussian over a Gaussian MAC. CoRR abs/0901.3314 (2009) - [i29]Amos Lapidoth, Michèle A. Wigger:
On the Gaussian MAC with Imperfect Feedback. CoRR abs/0902.0947 (2009) - [i28]Tobias Koch, Amos Lapidoth:
Gaussian Fading Is the Worst Fading. CoRR abs/0902.3372 (2009) - [i27]Amos Lapidoth, Stefan M. Moser, Michèle A. Wigger:
On the Capacity of Free-Space Optical Intensity Channels. CoRR abs/0903.1820 (2009) - [i26]Amos Lapidoth, Stephan Tinguely:
Sending a Bivariate Gaussian Source over a Gaussian MAC with Feedback. CoRR abs/0903.3487 (2009) - [i25]Shraga I. Bross, Amos Lapidoth, Ligong Wang:
The Poisson Channel with Side Information. CoRR abs/0906.4643 (2009) - [i24]Young-Han Kim, Amos Lapidoth, Tsachy Weissman:
Error Exponents for the Gaussian Channel with Active Noisy Feedback. CoRR abs/0909.4203 (2009) - 2008
- [c20]Shraga I. Bross, Amos Lapidoth, Stephan Tinguely:
Broadcasting correlated Gaussians. ISIT 2008: 1198-1202 - [c19]Tobias Koch
, Amos Lapidoth:
On multipath fading channels at high SNR. ISIT 2008: 1572-1576 - [c18]Amos Lapidoth, Stefan M. Moser, Michèle A. Wigger:
On the capacity of free-space optical intensity channels. ISIT 2008: 2419-2423 - [c17]Shraga I. Bross, Amos Lapidoth, Michèle A. Wigger:
The Gaussian MAC with conferencing encoders. ISIT 2008: 2702-2706 - [c16]Tobias Koch
, Amos Lapidoth:
Multipath channels of bounded capacity. ITW 2008: 6-10 - [i23]Tobias Koch, Amos Lapidoth:
On Multipath Fading Channels at High SNR. CoRR abs/0801.0672 (2008) - [i22]Shraga I. Bross, Amos Lapidoth, Michèle A. Wigger:
The Gaussian MAC with Conferencing Encoders. CoRR abs/0805.0516 (2008) - [i21]Amos Lapidoth, Stefan M. Moser, Michèle A. Wigger:
On the Capacity of Free-Space Optical Intensity Channels. CoRR abs/0805.0521 (2008) - [i20]Tobias Koch, Amos Lapidoth, Paul-Peter Sotiriadis:
Channels that Heat Up. CoRR abs/0805.4583 (2008) - [i19]Tobias Koch, Amos Lapidoth:
Multipath Channels of Unbounded Capacity. CoRR abs/0810.2208 (2008) - [i18]Amos Lapidoth, Jeffrey H. Shapiro, Vinodh Venkatesan, Ligong Wang:
The Poisson Channel at Low Input Powers. CoRR abs/0810.3564 (2008) - 2007
- [j28]Ashish Khisti, Uri Erez, Amos Lapidoth, Gregory W. Wornell:
Carbon Copying Onto Dirty Paper. IEEE Trans. Inf. Theory 53(5): 1814-1827 (2007) - [c15]Vignesh Sethuraman, Ligong Wang, Bruce E. Hajek, Amos Lapidoth:
Low SNR Capacity of Fading Channels -MIMO and Delay Spread. ISIT 2007: 516-520 - [c14]Tobias Koch
, Amos Lapidoth, Paul P. Sotiriadis
:
A Channel that Heats Up. ISIT 2007: 906-910 - [c13]Young-Han Kim, Amos Lapidoth, Tsachy Weissman:
The Gaussian Channel with Noisy Feedback. ISIT 2007: 1416-1420 - [c12]Amos Lapidoth, Shlomo Shamai
, Michèle A. Wigger:
A Linear Interference Network with Local Side-Information. ISIT 2007: 2201-2205 - [c11]Amos Lapidoth, Stephan Tinguely:
Sending a Bivariate Gaussian Source over a Gaussian MAC with Feedback. ISIT 2007: 2246-2250 - [i17]Tobias Koch, Amos Lapidoth, Paul-Peter Sotiriadis:
A Channel that Heats Up. CoRR abs/0704.2680 (2007) - [i16]Amos Lapidoth, Shlomo Shamai, Michèle A. Wigger:
On Cognitive Interference Networks. CoRR abs/0707.1008 (2007) - [i15]Shraga I. Bross, Amos Lapidoth, Stephan Tinguely:
Broadcasting Correlated Gaussians. CoRR abs/0710.5376 (2007) - [i14]Tobias Koch, Amos Lapidoth:
Multipath Channels of Bounded Capacity. CoRR abs/0711.3152 (2007) - [i13]Vignesh Sethuraman, Ligong Wang, Bruce E. Hajek, Amos Lapidoth:
Low SNR Capacity of Noncoherent Fading Channels. CoRR abs/0712.2872 (2007) - [i12]Amos Lapidoth, Stephan Tinguely:
Sending a Bivariate Gaussian Source over a Gaussian MAC with Feedback. CoRR abs/cs/0701042 (2007) - [i11]Vignesh Sethuraman, Ligong Wang, Bruce E. Hajek, Amos Lapidoth:
Low SNR Capacity of Fading Channels -- MIMO and Delay Spread. CoRR abs/cs/0701078 (2007) - [i10]Tobias Koch, Amos Lapidoth, Paul-Peter Sotiriadis:
A Hot Channel. CoRR abs/cs/0703154 (2007) - 2006
- [j27]Amos Lapidoth, Stefan M. Moser:
The fading number of single-input multiple-output fading channels with memory. IEEE Trans. Inf. Theory 52(2): 437-453 (2006) - [j26]Amos Lapidoth, Natalia Miliou:
Duality Bounds on the Cutoff Rate With Applications to Ricean Fading. IEEE Trans. Inf. Theory 52(7): 3003-3018 (2006) - [c10]Tobias Koch
, Amos Lapidoth:
Gaussian Fading is the Worst Fading. ISIT 2006: 26-29 - [c9]Amos Lapidoth, Stephan Tinguely:
Sending a Bi-Variate Gaussian Source over a Gaussian MAC. ISIT 2006: 2124-2128 - [c8]Shraga I. Bross, Amos Lapidoth, Stephan Tinguely:
Superimposed Coded and Uncoded Transmissions of a Gaussian Source over the Gaussian Channel. ISIT 2006: 2153-2155 - [i9]Tobias Koch, Amos Lapidoth:
Gaussian Fading is the Worst Fading. CoRR abs/cs/0601009 (2006) - [i8]Shraga I. Bross, Amos Lapidoth, Stephan Tinguely:
Superimposed Coded and Uncoded Transmissions of a Gaussian Source over the Gaussian Channel. CoRR abs/cs/0601028 (2006) - [i7]Amos Lapidoth, Stephan Tinguely:
Sending a Bi-Variate Gaussian Source over a Gaussian MAC. CoRR abs/cs/0601029 (2006) - [i6]Amos Lapidoth, Ligong Wang:
On the Low SNR Capacity of Peak-Limited Non-Coherent Fading Channels with Memory. CoRR abs/cs/0604031 (2006) - [i5]Amos Lapidoth, Shlomo Shamai, Michèle A. Wigger:
On the Capacity of Fading MIMO Broadcast Channels with Imperfect Transmitter Side-Information. CoRR abs/cs/0605079 (2006) - 2005
- [j25]Amos Lapidoth:
On the asymptotic capacity of stationary Gaussian fading channels. IEEE Trans. Inf. Theory 51(2): 437-446 (2005) - [j24]Shraga I. Bross, Amos Lapidoth:
An improved achievable region for the discrete memoryless two-user multiple-access channel with noiseless feedback. IEEE Trans. Inf. Theory 51(3): 811-833 (2005) - [j23]Amos Lapidoth:
On the High-SNR Capacity of Noncoherent Networks. IEEE Trans. Inf. Theory 51(9): 3025-3036 (2005) - [j22]Daniel Hoesli, Young-Han Kim, Amos Lapidoth:
Monotonicity results for coherent MIMO Rician channels. IEEE Trans. Inf. Theory 51(12): 4334-4339 (2005) - [c7]Tobias Koch, Amos Lapidoth:
The fading number and degrees of freedom in non-coherent MIMO fading channels: a peace pipe. ISIT 2005: 661-665 - [c6]Daniel Hösli, Amos Lapidoth:
Monotonicity results for coherent single-user and multiple-access MIMO Rician channels. ISIT 2005: 1416-1420 - [i4]Amos Lapidoth, Natalia Miliou:
Duality Bounds on the Cut-Off Rate with Applications to Ricean Fading. CoRR abs/cs/0503019 (2005) - [i3]Ashish Khisti, Uri Erez, Amos Lapidoth, Gregory W. Wornell:
Carbon Copying Onto Dirty Paper. CoRR abs/cs/0511095 (2005) - 2004
- [c5]Daniel Hösli, Amos Lapidoth:
How good is an isotropic gaussian input on a MIMO Ricean channel? ISIT 2004: 291 - [c4]Amos Lapidoth, Natalia Miliou:
Duality bounds on the cut-off rate with applications to Ricean fading. ISIT 2004: 544 - [i2]Daniel Hoesli, Young-Han Kim, Amos Lapidoth:
Monotonicity Results for Coherent MIMO Rician Channels. CoRR abs/cs/0412060 (2004) - [i1]Amos Lapidoth:
On the High-SNR Capacity of Non-Coherent Networks. CoRR cs.IT/0411098 (2004) - 2003
- [j21]Amos Lapidoth, Stefan M. Moser:
Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels. IEEE Trans. Inf. Theory 49(10): 2426-2467 (2003) - [j20]Amos Lapidoth, I. Emre Telatar, Rüdiger L. Urbanke:
On wide-band broadcast channels. IEEE Trans. Inf. Theory 49(12): 3250-3258 (2003) - 2002
- [j19]Amos Lapidoth, Shlomo Shamai:
Fading channels: How perfect need "Perfect side information" be? IEEE Trans. Inf. Theory 48(5): 1118-1134 (2002) - [j18]Aaron S. Cohen, Amos Lapidoth:
The Gaussian watermarking game. IEEE Trans. Inf. Theory 48(6): 1639-1667 (2002) - [c3]Amos Lapidoth:
On phase noise channels at high SNR. ITW 2002: 1-4 - 2001
- [c2]Amos Lapidoth, Stefan M. Moser:
On the fading number of multi-antenna systems. ITW 2001: 110-111 - 2000
- [j17]Amos Lapidoth, Peter J. Sallaway:
Convolutional Encoders to Minimize Bit-Error-Rate. Eur. Trans. Telecommun. 11(3): 263-269 (2000) - [j16]Anand Ganti, Amos Lapidoth, I. Emre Telatar:
Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit. IEEE Trans. Inf. Theory 46(7): 2315-2328 (2000)
1990 – 1999
- 1999
- [j15]Amos Lapidoth, Jacob Ziv:
On the decoding of convolutional codes on an unknown channel. IEEE Trans. Inf. Theory 45(7): 2321-2332 (1999) - 1998
- [j14]Amos Lapidoth, Shlomo Shamai:
A lower bound on the bit-error-rate resulting from mismatched viterbi decoding. Eur. Trans. Telecommun. 9(6): 473-482 (1998) - [j13]Amos Lapidoth, Shlomo Shamai:
The Poisson Multiple-Access Channel. IEEE Trans. Inf. Theory 44(2): 488-501 (1998) - [j12]Amos Lapidoth, I. Emre Telatar:
The Compound Channel Capacity of a Class of Finite-State Channels. IEEE Trans. Inf. Theory 44(3): 973-983 (1998) - [j11]Meir Feder, Amos Lapidoth:
Universal Decoding for Channels with Memory. IEEE Trans. Inf. Theory 44(5): 1726-1745 (1998) - [j10]Amos Lapidoth, Jacob Ziv:
On the Universality of the LZ-Based Decoding Algorithm. IEEE Trans. Inf. Theory 44(5): 1746-1755 (1998) - [j9]Amos Lapidoth, Prakash Narayan:
Reliable Communication Under Channel Uncertainty. IEEE Trans. Inf. Theory 44(6): 2148-2177 (1998) - 1997
- [j8]Amos Lapidoth:
On the probability of symbol error in Viterbi decoders. IEEE Trans. Commun. 45(2): 152-155 (1997) - [j7]Amos Lapidoth:
On the role of mismatch in rate distortion theory. IEEE Trans. Inf. Theory 43(1): 38-47 (1997) - 1996
- [j6]Amos Lapidoth:
Mismatched decoding and the multiple-access channel. IEEE Trans. Inf. Theory 42(5): 1439-1452 (1996) - [j5]Amos Lapidoth:
Nearest neighbor decoding for additive non-Gaussian noise channels. IEEE Trans. Inf. Theory 42(5): 1520-1529 (1996) - 1994
- [j4]Amos Lapidoth:
The performance of convolutional codes on the block erasure channel using various finite interleaving techniques. IEEE Trans. Inf. Theory 40(5): 1459-1473 (1994) - [j3]Neri Merhav, Gideon Kaplan, Amos Lapidoth, Shlomo Shamai:
On information rates for mismatched decoders. IEEE Trans. Inf. Theory 40(6): 1953-1967 (1994) - [c1]Amos Lapidoth:
Convolutional Codes and Finite Interleavers for the Block Erasure Channel. Mobile Communications 1994: 113-120 - 1993
- [j2]Shlomo Shamai, Amos Lapidoth:
Bounds on the capacity of a spectrally constrained Poisson channel. IEEE Trans. Inf. Theory 39(1): 19-29 (1993) - [j1]Amos Lapidoth:
On the reliability function of the ideal Poisson channel with noiseless feedback. IEEE Trans. Inf. Theory 39(2): 491-503 (1993)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint