The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Amos Lapidoth: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Amos Lapidoth
    Convolutional Codes and Finite Interleavers for the Block Erasure Channel. [Citation Graph (0, 0)][DBLP]
    Mobile Communications, 1994, pp:113-120 [Conf]
  2. Amos Lapidoth
    On the High-SNR Capacity of Non-Coherent Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  3. Shraga I. Bross, Amos Lapidoth
    An improved achievable region for the discrete memoryless two-user multiple-access channel with noiseless feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:3, pp:811-833 [Journal]
  4. Aaron S. Cohen, Amos Lapidoth
    The Gaussian watermarking game. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:6, pp:1639-1667 [Journal]
  5. Meir Feder, Amos Lapidoth
    Universal Decoding for Channels with Memory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:5, pp:1726-1745 [Journal]
  6. Anand Ganti, Amos Lapidoth, Ì. Emre Telatar
    Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2315-2328 [Journal]
  7. Daniel Hoesli, Young-Han Kim, Amos Lapidoth
    Monotonicity results for coherent MIMO Rician channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:12, pp:4334-4339 [Journal]
  8. Amos Lapidoth
    On the asymptotic capacity of stationary Gaussian fading channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:2, pp:437-446 [Journal]
  9. Amos Lapidoth
    On the High-SNR Capacity of Noncoherent Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:9, pp:3025-3036 [Journal]
  10. Amos Lapidoth
    On the reliability function of the ideal Poisson channel with noiseless feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:491-503 [Journal]
  11. Amos Lapidoth
    The performance of convolutional codes on the block erasure channel using various finite interleaving techniques. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:5, pp:1459-1473 [Journal]
  12. Amos Lapidoth
    Mismatched decoding and the multiple-access channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1439-1452 [Journal]
  13. Amos Lapidoth
    Nearest neighbor decoding for additive non-Gaussian noise channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1520-1529 [Journal]
  14. Amos Lapidoth
    On the role of mismatch in rate distortion theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:38-47 [Journal]
  15. Amos Lapidoth, Stefan M. Moser
    Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:10, pp:2426-2467 [Journal]
  16. Amos Lapidoth, Stefan M. Moser
    The fading number of single-input multiple-output fading channels with memory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:2, pp:437-453 [Journal]
  17. Amos Lapidoth, Natalia Miliou
    Duality Bounds on the Cutoff Rate With Applications to Ricean Fading. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:7, pp:3003-3018 [Journal]
  18. Amos Lapidoth, P. Narayan
    Reliable Communication Under Channel Uncertainty. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:6, pp:2148-2177 [Journal]
  19. Amos Lapidoth, Shlomo Shamai
    Fading channels: How perfect need "Perfect side information" be? [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:5, pp:1118-1134 [Journal]
  20. Amos Lapidoth, Shlomo Shamai
    The Poisson Multiple-Access Channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:2, pp:488-501 [Journal]
  21. Amos Lapidoth, Ì. Emre Telatar
    The Compound Channel Capacity of a Class of Finite-State Channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:3, pp:973-983 [Journal]
  22. Amos Lapidoth, Ì. Emre Telatar, Rüdiger L. Urbanke
    On wide-band broadcast channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:12, pp:3250-3258 [Journal]
  23. Amos Lapidoth, Jacob Ziv
    On the Universality of the LZ-Based Decoding Algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:5, pp:1746-1755 [Journal]
  24. Amos Lapidoth, Jacob Ziv
    On the decoding of convolutional codes on an unknown channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2321-2332 [Journal]
  25. Neri Merhav, Gideon Kaplan, Amos Lapidoth, Shlomo Shamai
    On information rates for mismatched decoders. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:6, pp:1953-1967 [Journal]
  26. Shlomo Shamai, Amos Lapidoth
    Bounds on the capacity of a spectrally constrained Poisson channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:1, pp:19-29 [Journal]
  27. Ashish Khisti, Uri Erez, Amos Lapidoth, Gregory W. Wornell
    Carbon Copying Onto Dirty Paper. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:5, pp:1814-1827 [Journal]
  28. Amos Lapidoth, Stephan Tinguely
    Sending a Bivariate Gaussian Source over a Gaussian MAC with Feedback [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  29. Vignesh Sethuraman, Ligong Wang, Bruce Hajek, Amos Lapidoth
    Low SNR Capacity of Fading Channels -- MIMO and Delay Spread [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  30. Tobias Koch, Amos Lapidoth, Paul-Peter Sotiriadis
    A Hot Channel [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  31. Tobias Koch, Amos Lapidoth, Paul-Peter Sotiriadis
    A Channel that Heats Up [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  32. Tobias Koch, Amos Lapidoth
    Gaussian Fading is the Worst Fading [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  33. Shraga I. Bross, Amos Lapidoth, Stephan Tinguely
    Superimposed Coded and Uncoded Transmissions of a Gaussian Source over the Gaussian Channel [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  34. Amos Lapidoth, Stephan Tinguely
    Sending a Bi-Variate Gaussian Source over a Gaussian MAC [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  35. Amos Lapidoth, Natalia Miliou
    Duality Bounds on the Cut-Off Rate with Applications to Ricean Fading [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  36. Amos Lapidoth, Ligong Wang
    On the Low SNR Capacity of Peak-Limited Non-Coherent Fading Channels with Memory [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  37. Amos Lapidoth, Shlomo Shamai, Michele Wigger
    On the Capacity of Fading MIMO Broadcast Channels with Imperfect Transmitter Side-Information [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  38. Amos Lapidoth, Shlomo Shamai, Michele Wigger
    On Cognitive Interference Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  39. Shraga I. Bross, Amos Lapidoth, Stephan Tinguely
    Broadcasting Correlated Gaussians [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  40. Daniel Hoesli, Young-Han Kim, Amos Lapidoth
    Monotonicity Results for Coherent MIMO Rician Channels [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]

  41. Carbon Copying Onto Dirty Paper [Citation Graph (, )][DBLP]


  42. Multipath Channels of Bounded Capacity [Citation Graph (, )][DBLP]


  43. Low SNR Capacity of Noncoherent Fading Channels [Citation Graph (, )][DBLP]


  44. On Multipath Fading Channels at High SNR [Citation Graph (, )][DBLP]


  45. The Gaussian MAC with Conferencing Encoders [Citation Graph (, )][DBLP]


  46. On the Capacity of Free-Space Optical Intensity Channels [Citation Graph (, )][DBLP]


  47. Channels that Heat Up [Citation Graph (, )][DBLP]


  48. Multipath Channels of Unbounded Capacity [Citation Graph (, )][DBLP]


  49. The Poisson Channel at Low Input Powers [Citation Graph (, )][DBLP]


  50. On Multipath Fading Channels at High SNR [Citation Graph (, )][DBLP]


  51. Sending a Bi-Variate Gaussian over a Gaussian MAC [Citation Graph (, )][DBLP]


  52. On the Gaussian MAC with Imperfect Feedback [Citation Graph (, )][DBLP]


  53. Gaussian Fading Is the Worst Fading [Citation Graph (, )][DBLP]


  54. On the Capacity of Free-Space Optical Intensity Channels [Citation Graph (, )][DBLP]


  55. Sending a Bivariate Gaussian Source over a Gaussian MAC with Feedback [Citation Graph (, )][DBLP]


  56. The Poisson Channel with Side Information [Citation Graph (, )][DBLP]


  57. Error Exponents for the Gaussian Channel with Active Noisy Feedback [Citation Graph (, )][DBLP]


  58. When Feedback Doubles the Prelog in AWGN Networks [Citation Graph (, )][DBLP]


  59. The State-Dependent Multiple-Access Channel with States Available at a Cribbing Encoder [Citation Graph (, )][DBLP]


  60. Increased Capacity per Unit-Cost by Oversampling [Citation Graph (, )][DBLP]


Search in 0.238secs, Finished in 0.241secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002