Anelia Somekh-Baruch
Title
Cited by
Cited by
Year
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
1762009
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
1252008
On the capacity game of public watermarking systems
A Somekh-Baruch, N Merhav
IEEE Transactions on Information Theory 50 (3), 511-524, 2004
902004
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
552005
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
552003
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
472011
Cognitive interference channels with state information
A Somekh-Baruch, S Shamai, S Verdú
2008 IEEE International Symposium on Information Theory, 1353-1357, 2008
402008
Cognitive interference channels with confidential messages
Y Liang, A Somekh-Baruch, HV Poor, S Shamai, S Verdú
arXiv preprint arXiv:0710.2018, 2007
382007
A general formula for the mismatch capacity
A Somekh-Baruch
IEEE Transactions on Information Theory 61 (9), 4554-4568, 2015
322015
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
312007
Achievable error exponents for the private fingerprinting game
A Somekh-Baruch, N Merhav
IEEE transactions on information theory 53 (5), 1827-1838, 2007
282007
Exact random coding exponents for erasure decoding
A Somekh-Baruch, N Merhav
IEEE transactions on information theory 57 (10), 6444-6454, 2011
262011
On Gaussian wiretap channels with M-PAM inputs
MRD Rodrigues, A Somekh-Baruch, M Bloch
2010 European Wireless Conference (EW), 774-781, 2010
252010
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
252001
Cooperative encoding with asymmetric state information at the transmitters
A Somekh-Baruch, S Shamai, S Verdú
212006
On achievable rates and error exponents for channels with mismatched decoding
A Somekh-Baruch
IEEE Transactions on Information Theory 61 (2), 727-740, 2014
192014
On the random coding error exponents of the single-user and the multiple-access Gel'fand-Pinsker channels
A Somekh-Baruch, N Merhav
IEEE International Symposium on Information Theory, 448-448, 2004
182004
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
182004
On the capacity of cognitive radios in multiple access networks
A Somekh-Baruch, S Sridharan, S Vishwanath, S Verdú, S Shamai
2008 42nd Asilomar Conference on Signals, Systems and Computers, 695-700, 2008
102008
A counter-example to the mismatched decoding converse for binary-input discrete memoryless channels
J Scarlett, A Somekh-Baruch, A Martinez, AG i Fàbregas
IEEE Transactions on Information Theory 61 (10), 5387-5395, 2015
82015
The system can't perform the operation now. Try again later.
Articles 1–20