Anelia Somekh-Baruch (Selection)

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

15 Anelia Somekh-Baruch, Neri Merhav: Exact Random Coding Exponents for Erasure Decoding. IEEE Transactions on Information Theory 57(10): 6444-6454 (2011)

14 Anelia Somekh-Baruch, Neri Merhav: Exact random coding exponents for erasure decoding. ISIT 2010: 260-264

9 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)

7 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 Anelia Somekh-Baruch, Neri Merhav: Achievable Error Exponents for the Private Fingerprinting Game. IEEE Transactions on Information Theory 53(5): 1827-1838 (2007)

5 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)

4 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)

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)

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)

Selection of 10 from 17 records - Anelia Somekh-Baruch has 9 coauthors

Last update 2012-09-10 CET by the DBLP Team —

Content released under the ODC-BY 1.0 license — See also our legal information page

15		Anelia Somekh-Baruch, Neri Merhav: Exact Random Coding Exponents for Erasure Decoding. IEEE Transactions on Information Theory 57(10): 6444-6454 (2011)
14		Anelia Somekh-Baruch, Neri Merhav: Exact random coding exponents for erasure decoding. ISIT 2010: 260-264
9		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)
7		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		Anelia Somekh-Baruch, Neri Merhav: Achievable Error Exponents for the Private Fingerprinting Game. IEEE Transactions on Information Theory 53(5): 1827-1838 (2007)
5		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)
4		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)
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)
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)