Anelia Somekh-Baruch

Dr. Anelia Somekh-Baruch


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2019 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
ASAnelia Somekh-Baruch
Anelia Somekh-Baruch
Jonathan ScarlettJonathan Scarlett
Jonathan Scarlett
AFAlbert Guillen i Fabregas
Albert Guillen i Fabregas

14 August 2015 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
Jonathan ScarlettJonathan Scarlett
Jonathan Scarlett
ASAnelia Somekh-Baruch
Anelia Somekh-Baruch
AMAlfonso Martinez
Alfonso Martinez
AFAlbert Guillen i Fabregas
Albert Guillen i Fabregas
This paper studies the mismatched decoding problem for binary-input discrete memoryless channels. An example is provided for which an achievable rate based on superposition coding exceeds the Csiszár-Körner-Hui rate, thus providing a counter-example to a previously reported converse result. Both numerical evaluations and theoretical results are used in establishing this claim.

24 May 2018 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
ASAnelia Somekh-Baruch
Anelia Somekh-Baruch
The problem of mismatched decoding with an additive bounded metric q for a discrete memoryless channel W is addressed. We study two kinds of decoders. The δ-margin mismatched decoder outputs a message whose metric with the channel output exceeds that of all the other codewords by at least δ. The τ-threshold decoder outputs a single message whose metric with the channel output exceeds a threshold τ. It is proved that the mismatch capacity with a constant margin decoder is equal to the “product-space” improvement of the random coding lower bound on the mismatch capacity, C q (∞) (W), which was introduced by Csiszár and Narayan. We next consider sequences of P-constant composition codebooks. Using the Central Limit Theorem, it is shown that for such sequences of codebooks the supremum of achievable rates with constant threshold decoding is upper bounded by the supremum of the achievable rates with a constant margin decoder, and therefore also by C q (∞) (W). Further, a soft converse is proved stating that if the average probability of error of a sequence of codebooks with ordinary mismatched decoding converges to zero sufficiently fast, the rate of the code sequence is upper bounded by C q (∞) (W). In particular, if q is a bounded rational metric, and the average probability of error converges to zero faster than O(n -1 ), then R ≤ C q (∞) (W). Finally, a max-min multi-letter upper bound on the mismatch capacity that bears some resemblance to C q (∞) (W) is presented.

25 January 2022 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
ASAnelia Somekh-Baruch
Anelia Somekh-Baruch
We introduce a new analysis technique to derive a single-letter upper bound on the mismatch capacity of a stationary, single-user, memoryless channel with a decoding metric $q$ . Our bound is obtained by considering a multicast transmission over a two-user broadcast channel with decoding metrics $q$ and $\rho $ at the receivers, referred to as $(q,\rho)$ -surely degraded. This channel has the property that the intersection event of correct $q$ -decoding of receiver 1 and erroneous $\rho $ -decoding of receiver 2 has zero probability for any fixed-composition codebook of a certain composition $P$ . Our bound holds in the strong converse sense of an exponential decay of the probability of correct decoding at rates above the bound. Further, we refine the proof and present a bound that is tighter than that of any choice of $\rho $ . Several examples that demonstrate the strict improvement of our bound compared to previous results are analyzed. Finally, we detect equivalence classes of isomorphic channel-metric pairs $(W,q)$ that share the same mismatch capacity. We prove that if the class contains a matched pair, then our bound is tight and the mismatch capacity of the entire class is fully characterized and is equal to the LM rate, which is achievable by random coding, and may be strictly lower that the matched capacity.

9 July 2019 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
MYMichal Yemini
Michal Yemini
ASAnelia Somekh-Baruch
Anelia Somekh-Baruch
RCReuven Cohen
Reuven Cohen
ALAmir Leshem
Amir Leshem
In this work we consider the simultaneous connectivity of primary and secondary networks forming a cognitive model. It is assumed that the cognitive model includes guard zones that prevent nodes of the secondary network from being active in the vicinity of primary nodes, to limit interference. Under these assumptions we characterize the region of densities, the transmission radii of the nodes in each of the networks, and the guard zones for which the two networks both have a unique unbounded connected component. We prove that this model is feasible, that is, there exists simultaneous connectivity with a unique unbounded connected component in each of the networks. We also provide necessary and sufficient conditions for the simultaneous connectivity of this cognitive model.

25 January 2021 in IEEE Transactions on Signal Processing
Verified
Journal Article
Open access
MYMichal Yemini
Michal Yemini
ALAmir Leshem
Amir Leshem
ASAnelia Somekh-Baruch
Anelia Somekh-Baruch
In this paper we present a model for the hidden Markovian bandit problem with linear rewards. As opposed to current work on Markovian bandits, we do not assume that the state is known to the decision maker before making the decision. Furthermore, we assume structural side information where the decision maker knows in advance that there are two types of hidden states; one is common to all arms and evolves according to a Markovian distribution, and the other is unique to each arm and is distributed according to an i.i.d. process that is unique to each arm. We present an algorithm and regret analysis to this problem. Surprisingly, we can recover the hidden states and maintain logarithmic regret in the case of a convex polytope action set. Furthermore, we show that the structural side information leads to expected regret that does not depend on the number of extreme points in the action space. Therefore, we obtain practical solutions even in high dimensional problems.