2009 |
11 | EE | Yingbin Liang,
Anelia Somekh-Baruch,
H. Vincent Poor,
Shlomo Shamai,
Sergio Verdú:
Capacity of Cognitive Interference Channels With and Without Secrecy.
IEEE Transactions on Information Theory 55(2): 604-619 (2009) |
2008 |
10 | EE | Anelia Somekh-Baruch,
Shlomo Shamai,
Sergio Verdú:
Cooperative Multiple-Access Encoding With States Available at One Transmitter.
IEEE Transactions on Information Theory 54(10): 4448-4469 (2008) |
9 | EE | Anelia Somekh-Baruch,
Neri Merhav:
Correction to "On the Capacity Game of Private Fingerprinting Systems Under Collusion Attacks" [Mar 05 884-899].
IEEE Transactions on Information Theory 54(11): 5263-5264 (2008) |
2007 |
8 | EE | Yingbin Liang,
Anelia Somekh-Baruch,
H. Vincent Poor,
Shlomo Shamai,
Sergio Verdú:
Cognitive Interference Channels with Confidential Messages
CoRR abs/0710.2018: (2007) |
7 | EE | Tsachy Weissman,
Erik Ordentlich,
Marcelo J. Weinberger,
Anelia Somekh-Baruch,
Neri Merhav:
Universal Filtering Via Prediction.
IEEE Transactions on Information Theory 53(4): 1253-1264 (2007) |
6 | EE | Anelia Somekh-Baruch,
Neri Merhav:
Achievable Error Exponents for the Private Fingerprinting Game.
IEEE Transactions on Information Theory 53(5): 1827-1838 (2007) |
2005 |
5 | EE | Anelia Somekh-Baruch,
Neri Merhav:
On the capacity game of private fingerprinting systems under collusion attacks.
IEEE Transactions on Information Theory 51(3): 884-899 (2005) |
2004 |
4 | EE | Erik Ordentlich,
Tsachy Weissman,
Marcelo J. Weinberger,
Anelia Somekh-Baruch,
Neri Merhav:
Discrete Universal Filtering Through Incremental Parsing.
Data Compression Conference 2004: 352-361 |
3 | | Anelia Somekh-Baruch,
Neri Merhav:
On the capacity game of public watermarking systems.
IEEE Transactions on Information Theory 20(3): 511-524 (2004) |
2003 |
2 | | Anelia Somekh-Baruch,
Neri Merhav:
On the error exponent and capacity games of private watermarking systems.
IEEE Transactions on Information Theory 49(3): 537-562 (2003) |
2001 |
1 | | Tsachy Weissman,
Neri Merhav,
Anelia Somekh-Baruch:
Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence.
IEEE Transactions on Information Theory 47(5): 1849-1866 (2001) |