default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnelia Somekh-Baruch
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Anelia Somekh-Baruch
:
An Upper Bound on the Reliability Function of Discrete Memoryless Channels. IEEE Trans. Inf. Theory 70(5): 3059-3081 (2024)- [c32]Sergey Tridenski, Anelia Somekh-Baruch:
The Method of Types for the AWGN Channel: Error Exponent. ISIT 2024: 1285-1290 - [c31]Jonathan Solel, Anelia Somekh-Baruch:
Pre-Decoder Processing Functions for a DMC with Mismatched Decoding. ISIT 2024: 1492-1497 - [i22]Jonathan Solel, Anelia Somekh-Baruch:
Pre-Decoder Processing Functions for a DMC with Mismatched Decoding. CoRR abs/2406.17476 (2024) - 2023
- [j26]Anelia Somekh-Baruch:
Upper Bounds on the Mismatched Reliability Function and Capacity Using a Genie Receiver. IEEE Trans. Inf. Theory 69(7): 4196-4217 (2023) - [c30]Anelia Somekh-Baruch:
An Upper Bound on the Reliability Function of the DMC with or without Mismatch. ITW 2023: 53-58 - [i21]Sergey Tridenski, Anelia Somekh-Baruch:
The Method of Types for the AWGN Channel. CoRR abs/2307.13322 (2023) - 2022
- [j25]Anelia Somekh-Baruch:
A Single-Letter Upper Bound on the Mismatch Capacity via Multicast Transmission. IEEE Trans. Inf. Theory 68(5): 2801-2812 (2022) - [c29]Anelia Somekh-Baruch:
New Upper Bounds on the Mismatch Capacity and the Mismatched Reliability Function. ITW 2022: 83-88 - [i20]Anelia Somekh-Baruch:
New Converse Bounds on the Mismatched Reliability Function and the Mismatch Capacity Using an Auxiliary Genie Receiver. CoRR abs/2203.08524 (2022) - [i19]Anelia Somekh-Baruch:
An Upper Bound on the Reliability Function of the DMC. CoRR abs/2209.00968 (2022) - [i18]Sergey Tridenski, Anelia Somekh-Baruch:
A Generalization of the DMC. CoRR abs/2209.10506 (2022) - 2021
- [j24]Michal Yemini, Amir Leshem, Anelia Somekh-Baruch:
The Restless Hidden Markov Bandit With Linear Rewards and Side Information. IEEE Trans. Signal Process. 69: 1108-1123 (2021) - [c28]Anelia Somekh-Baruch:
Robust Multicasting and an Upper Bound on the Mismatch Capacity of the DMC. ISIT 2021: 1130-1135 - 2020
- [j23]Jonathan Scarlett, Albert Guillén i Fàbregas, Anelia Somekh-Baruch, Alfonso Martinez:
Information-Theoretic Foundations of Mismatched Decoding. Found. Trends Commun. Inf. Theory 17(2-3): 149-401 (2020) - [c27]Michal Yemini, Amir Leshem, Anelia Somekh-Baruch:
Restless Hidden Markov Bandit with Linear Rewards. CDC 2020: 1183-1189 - [c26]Sergey Tridenski, Anelia Somekh-Baruch, Ram Zamir:
Proof of Convergence for Correct-Decoding Exponent Computation. ISIT 2020: 2137-2142 - [c25]Anelia Somekh-Baruch:
A Single-Letter Upper Bound on the Mismatch Capacity via a Multicasting Approach. ITW 2020: 1-5 - [c24]Sergey Tridenski, Anelia Somekh-Baruch:
A Generalization of the DMC. ITW 2020: 1-5 - [i17]Sergey Tridenski, Anelia Somekh-Baruch, Ram Zamir:
Proof of Convergence for Correct-Decoding Exponent Computation. CoRR abs/2001.05711 (2020) - [i16]Jonathan Scarlett, Albert Guillén i Fàbregas, Anelia Somekh-Baruch, Alfonso Martinez:
Information-Theoretic Foundations of Mismatched Decoding. CoRR abs/2003.11694 (2020) - [i15]Anelia Somekh-Baruch:
A Single-Letter Upper Bound on the Mismatch Capacity via Multicast Transmission. CoRR abs/2007.14322 (2020)
2010 – 2019
- 2019
- [j22]Anelia Somekh-Baruch:
Ratio List Decoding. IEEE Trans. Inf. Theory 65(4): 2179-2189 (2019) - [j21]Anelia Somekh-Baruch, Jonathan Scarlett, Albert Guillen i Fabregas:
Generalized Random Gilbert-Varshamov Codes. IEEE Trans. Inf. Theory 65(6): 3452-3469 (2019) - [j20]Michal Yemini, Anelia Somekh-Baruch, Reuven Cohen, Amir Leshem:
The Simultaneous Connectivity of Cognitive Networks. IEEE Trans. Inf. Theory 65(11): 6911-6930 (2019) - [c23]Michael Dikshtein, Anelia Somekh-Baruch, Shlomo Shamai Shitz:
Broadcasting Information subject to State Masking over a MIMO State Dependent Gaussian Channel. ISIT 2019: 275-279 - [c22]Anelia Somekh-Baruch, Jonathan Scarlett, Albert Guillén i Fàbregas:
A Recursive Cost-Constrained Construction that Attains the Expurgated Exponent. ISIT 2019: 2938-2942 - [i14]Michael Dikshtein, Anelia Somekh-Baruch, Shlomo Shamai:
Broadcasting Information subject to State Masking over a MIMO State Dependent Gaussian Channel. CoRR abs/1901.03377 (2019) - [i13]Michal Yemini, Amir Leshem, Anelia Somekh-Baruch:
Restless Hidden Markov Bandits with Linear Rewards. CoRR abs/1910.10271 (2019) - 2018
- [j19]Anelia Somekh-Baruch, Amir Leshem, Venkatesh Saligrama:
On the Non-Existence of Unbiased Estimators in Constrained Estimation Problems. IEEE Trans. Inf. Theory 64(8): 5549-5554 (2018) - [j18]Anelia Somekh-Baruch:
Converse Theorems for the DMC With Mismatched Decoding. IEEE Trans. Inf. Theory 64(9): 6196-6207 (2018) - [c21]Anelia Somekh-Baruch, Jonathan Scarlett, Albert Guillen i Fabregas:
The error exponent of random gilbert-varshamov codes. CISS 2018: 1-2 - [c20]Anelia Somekh-Baruch, Jonathan Scarlett, Albert Guillen i Fabregas:
The Error Exponent of Generalized Random-Gilbert Varshamov Codes. ISIT 2018: 2361-2365 - [c19]Anelia Somekh-Baruch:
Information Spectrum Analysis for Mismatched Decoding. ISITA 2018: 115-119 - [i12]Anelia Somekh-Baruch, Jonathan Scarlett, Albert Guillén i Fàbregas:
Generalized Random Gilbert-Varshamov Codes. CoRR abs/1805.02515 (2018) - [i11]Anelia Somekh-Baruch:
Converse Theorems for the DMC with Mismatched Decoding. CoRR abs/1805.10695 (2018) - [i10]Anelia Somekh-Baruch:
Ratio List Decoding. CoRR abs/1810.08161 (2018) - 2017
- [j17]Jonathan Shimonovich, Anelia Somekh-Baruch, Shlomo Shamai (Shitz):
Cognition and Cooperation in Interfered Multiple Access Channels. Entropy 19(7): 378 (2017) - [c18]Anelia Somekh-Baruch:
Mismatched identification via channels. ISIT 2017: 2751-2755 - 2016
- [j16]Michal Yemini, Anelia Somekh-Baruch, Amir Leshem:
On the Multiple Access Channel With Asynchronous Cognition. IEEE Trans. Inf. Theory 62(10): 5643-5663 (2016) - [c17]Michal Yemini, Anelia Somekh-Baruch, Reuven Cohen, Amir Leshem:
Simultaneous connectivity in heterogeneous cognitive radio networks. ISIT 2016: 1262-1266 - [c16]Yafit Feldman, Anelia Somekh-Baruch:
Channels with state information and mismatched decoding. ITW 2016: 419-423 - [i9]Michal Yemini, Anelia Somekh-Baruch, Reuven Cohen, Amir Leshem:
On Simultaneous Percolation with Two Disk Types. CoRR abs/1601.04471 (2016) - [i8]Anelia Somekh-Baruch, Amir Leshem, Venkatesh Saligrama:
On the Non-Existence of Unbiased Estimators in Constrained Estimation Problems. CoRR abs/1609.07415 (2016) - 2015
- [j15]Anelia Somekh-Baruch:
On Achievable Rates and Error Exponents for Channels With Mismatched Decoding. IEEE Trans. Inf. Theory 61(2): 727-740 (2015) - [j14]Anelia Somekh-Baruch:
A General Formula for the Mismatch Capacity. IEEE Trans. Inf. Theory 61(9): 4554-4568 (2015) - [j13]Jonathan Scarlett, Anelia Somekh-Baruch, Alfonso Martinez, Albert Guillen i Fabregas:
A Counter-Example to the Mismatched Decoding Converse for Binary-Input Discrete Memoryless Channels. IEEE Trans. Inf. Theory 61(10): 5387-5395 (2015) - [j12]Michal Yemini, Anelia Somekh-Baruch, Amir Leshem:
Asynchronous Transmission Over Single-User State-Dependent Channels. IEEE Trans. Inf. Theory 61(11): 5854-5867 (2015) - [c15]Anelia Somekh-Baruch:
On mismatched list decoding. ISIT 2015: 526-530 - [c14]Anelia Somekh-Baruch:
Multi-letter converse bounds for the mismatched discrete memoryless channel with an additive metric. ISIT 2015: 531-535 - [i7]Michal Yemini, Anelia Somekh-Baruch, Amir Leshem:
On the Multiple Access Channel with Asynchronous Cognition. CoRR abs/1503.08413 (2015) - [i6]Jonathan Scarlett, Anelia Somekh-Baruch, Alfonso Martinez, Albert Guillén i Fàbregas:
A Counter-Example to the Mismatched Decoding Converse for Binary-Input Discrete Memoryless Channels. CoRR abs/1508.02374 (2015) - 2014
- [c13]Michal Yemini, Anelia Somekh-Baruch, Amir Leshem:
On the asynchronous cognitive MAC. ISIT 2014: 2929-2933 - [c12]Anelia Somekh-Baruch:
A general formula for the mismatch capacity. ISIT 2014: 3067-3071 - [i5]Michal Yemini, Anelia Somekh-Baruch, Amir Leshem:
On Channels with Asynchronous Side Information. CoRR abs/1402.1617 (2014) - 2013
- [c11]Anelia Somekh-Baruch:
On the secure interference channel. Allerton 2013: 770-773 - [c10]Anelia Somekh-Baruch:
On coding schemes for channels with mismatched decoding. ISIT 2013: 96-100 - [c9]Jonathan Shimonovich, Anelia Somekh-Baruch, Shlomo Shamai (Shitz):
Cognitive cooperative communications on the Multiple Access Channel. ITW 2013: 1-5 - [i4]Anelia Somekh-Baruch:
On Achievable Rates for Channels with Mismatched Decoding. CoRR abs/1305.0547 (2013) - [i3]Anelia Somekh-Baruch:
A General Formula for the Mismatch Capacity. CoRR abs/1309.7964 (2013) - 2011
- [j11]Haim H. Permuter, Shlomo Shamai, Anelia Somekh-Baruch:
Message and State Cooperation in Multiple Access Channels. IEEE Trans. Inf. Theory 57(10): 6379-6396 (2011) - [j10]Anelia Somekh-Baruch, Neri Merhav:
Exact Random Coding Exponents for Erasure Decoding. IEEE Trans. Inf. Theory 57(10): 6444-6454 (2011) - [c8]Haim H. Permuter, Shlomo Shamai, Anelia Somekh-Baruch:
Cooperation in multiple access channels in the presence of partial state information. ISIT 2011: 816-820 - 2010
- [c7]Anelia Somekh-Baruch, Neri Merhav:
Exact random coding exponents for erasure decoding. ISIT 2010: 260-264 - [i2]Haim H. Permuter, Shlomo Shamai, Anelia Somekh-Baruch:
Message and state cooperation in multiple access channels. CoRR abs/1006.2022 (2010)
2000 – 2009
- 2009
- [j9]Yingbin Liang, Anelia Somekh-Baruch, H. Vincent Poor, Shlomo Shamai, Sergio Verdú:
Capacity of Cognitive Interference Channels With and Without Secrecy. IEEE Trans. Inf. Theory 55(2): 604-619 (2009) - 2008
- [j8]Anelia Somekh-Baruch, Shlomo Shamai, Sergio Verdú:
Cooperative Multiple-Access Encoding With States Available at One Transmitter. IEEE Trans. Inf. Theory 54(10): 4448-4469 (2008) - [j7]Anelia Somekh-Baruch, Neri Merhav:
Correction to "On the Capacity Game of Private Fingerprinting Systems Under Collusion Attacks" [Mar 05 884-899]. IEEE Trans. Inf. Theory 54(11): 5263-5264 (2008) - [c6]Anelia Somekh-Baruch, Sriram Sridharan, Sriram Vishwanath, Sergio Verdú, Shlomo Shamai:
On the capacity of cognitive radios in multiple access networks. ACSCC 2008: 695-700 - [c5]Anelia Somekh-Baruch, Shlomo Shamai, Sergio Verdú:
Cognitive interference channels with state information. ISIT 2008: 1353-1357 - 2007
- [j6]Tsachy Weissman, Erik Ordentlich, Marcelo J. Weinberger, Anelia Somekh-Baruch, Neri Merhav:
Universal Filtering Via Prediction. IEEE Trans. Inf. Theory 53(4): 1253-1264 (2007) - [j5]Anelia Somekh-Baruch, Neri Merhav:
Achievable Error Exponents for the Private Fingerprinting Game. IEEE Trans. Inf. Theory 53(5): 1827-1838 (2007) - [c4]Anelia Somekh-Baruch, Shlomo Shamai, Sergio Verdú:
Cooperative Multiple Access Encoding with States Available at One Transmitter. ISIT 2007: 1556-1560 - [i1]Yingbin Liang, Anelia Somekh-Baruch, H. Vincent Poor, Shlomo Shamai, Sergio Verdú:
Cognitive Interference Channels with Confidential Messages. CoRR abs/0710.2018 (2007) - 2006
- [c3]Anelia Somekh-Baruch, Sergio Verdú:
General Relayless Networks: Representation of the Capacity Region. ISIT 2006: 2408-2412 - 2005
- [j4]Anelia Somekh-Baruch, Neri Merhav:
On the capacity game of private fingerprinting systems under collusion attacks. IEEE Trans. Inf. Theory 51(3): 884-899 (2005) - 2004
- [j3]Anelia Somekh-Baruch, Neri Merhav:
On the capacity game of public watermarking systems. IEEE Trans. Inf. Theory 50(3): 511-524 (2004) - [c2]Erik Ordentlich, Tsachy Weissman, Marcelo J. Weinberger, Anelia Somekh-Baruch, Neri Merhav:
Discrete Universal Filtering Through Incremental Parsing. Data Compression Conference 2004: 352-361 - [c1]Anelia Somekh-Baruch, Neri Merhav:
On the random coding error exponents of the single-user and the multiple-access Gel'fand-Pinsker channels. ISIT 2004: 448 - 2003
- [j2]Anelia Somekh-Baruch, Neri Merhav:
On the error exponent and capacity games of private watermarking systems. IEEE Trans. Inf. Theory 49(3): 537-562 (2003) - 2001
- [j1]Tsachy Weissman, Neri Merhav, Anelia Somekh-Baruch:
Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence. IEEE Trans. Inf. Theory 47(5): 1849-1866 (2001)
Coauthor Index
aka: Albert Guillen i Fabregas
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-13 18:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
