Capacity of cognitive interference channels with and without secrecy Y Liang, A Somekh-Baruch, HV Poor, S Shamai, S Verdú IEEE Transactions on Information Theory 55 (2), 604-619, 2009 | 201 | 2009 |
Cooperative multiple-access encoding with states available at one transmitter A Somekh-Baruch, S Shamai, S Verdú IEEE Transactions on Information Theory 54 (10), 4448-4469, 2008 | 136 | 2008 |
On the capacity game of public watermarking systems A Somekh-Baruch, N Merhav IEEE Transactions on Information Theory 50 (3), 511-524, 2004 | 95 | 2004 |
On the capacity game of private fingerprinting systems under collusion attacks A Somekh-Baruch, N Merhav IEEE Transactions on Information Theory 51 (3), 884-899, 2005 | 58 | 2005 |
On the error exponent and capacity games of private watermarking systems A Somekh-Baruch, N Merhav IEEE Transactions on Information Theory 49 (3), 537-562, 2003 | 57 | 2003 |
Information-theoretic foundations of mismatched decoding J Scarlett, AG i Fàbregas, A Somekh-Baruch, A Martinez Foundations and Trends® in Communications and Information Theory 17 (2–3 …, 2020 | 55 | 2020 |
Message and state cooperation in multiple access channels HH Permuter, S Shamai, A Somekh-Baruch IEEE Transactions on Information Theory 57 (10), 6379-6396, 2011 | 54 | 2011 |
Cognitive interference channels with state information A Somekh-Baruch, S Shamai, S Verdú 2008 IEEE International Symposium on Information Theory, 1353-1357, 2008 | 42 | 2008 |
A general formula for the mismatch capacity A Somekh-Baruch IEEE Transactions on Information Theory 61 (9), 4554-4568, 2015 | 41 | 2015 |
On achievable rates and error exponents for channels with mismatched decoding A Somekh-Baruch IEEE Transactions on Information Theory 61 (2), 727-740, 2014 | 37 | 2014 |
Cognitive interference channels with confidential messages Y Liang, A Somekh-Baruch, HV Poor, S Shamai, S Verdú arXiv preprint arXiv:0710.2018, 2007 | 35 | 2007 |
Universal filtering via prediction T Weissman, E Ordentlich, MJ Weinberger, A Somekh-Baruch, N Merhav IEEE transactions on information theory 53 (4), 1253-1264, 2007 | 32 | 2007 |
Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence T Weissman, N Merhav, A Somekh-Baruch IEEE Transactions on Information Theory 47 (5), 1849-1866, 2001 | 30 | 2001 |
Achievable error exponents for the private fingerprinting game A Somekh-Baruch, N Merhav IEEE transactions on information theory 53 (5), 1827-1838, 2007 | 29 | 2007 |
On Gaussian wiretap channels with M-PAM inputs MRD Rodrigues, A Somekh-Baruch, M Bloch 2010 European Wireless Conference (EW), 774-781, 2010 | 28 | 2010 |
Exact random coding exponents for erasure decoding A Somekh-Baruch, N Merhav IEEE transactions on information theory 57 (10), 6444-6454, 2011 | 27 | 2011 |
Cooperative encoding with asymmetric state information at the transmitters A Somekh-Baruch, SS Shitz, S Verdú 44th Annual Allerton Conference on Communication, Control, and Computing …, 2006 | 21 | 2006 |
On the random coding error exponents of the single-user and the multiple-access Gel'fand-Pinsker channels A Somekh-Baruch, N Merhav International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 448, 2004 | 20 | 2004 |
Generalized random Gilbert-Varshamov codes A Somekh-Baruch, J Scarlett, AG i Fabregas IEEE Transactions on Information Theory 65 (6), 3452-3469, 2019 | 19 | 2019 |
Discrete universal filtering through incremental parsing E Ordentlich, T Weissman, MJ Weinberger, A Somekh-Baruch, N Merhav Data Compression Conference, 2004. Proceedings. DCC 2004, 352-361, 2004 | 19 | 2004 |