The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A new broadcast wiretap channel (B-WTC) with a wiretapper who noiselessly taps into a fixed-length subset of the transmitted symbols of her choice, and observes the remainder through a noisy channel, is studied. An achievable strong secrecy rate region which extends Marton's inner bound to the proposed setting, is derived. Strong secrecy capacity regions for two classes of the new B-WTC, namely the...
A new model for the interference channel with confidential messages (IC-CM) is introduced, where each receiver, besides his noisy observations, is provided with a fixed-length subset, of his choosing, of noiseless observations for the transmitted codewords of both users, making confidential communication more challenging than the previous such model. In addition, in the same spirit, a broadcast channel...
This paper considers a K-user Gaussian broadcast channel (BC) where receivers are equipped with cache memories. Lower and upper bounds are established on the capacity-memory tradeoff, i.e., the largest rate achievable for given cache-memories. The lower bound is based on a joint cache-channel coding scheme which generalizes the recently proposed piggyback coding to Gaussian BCs with unequal cache...
This paper develops a simplified dependency model for sources on social networks that is shown to improve the quality of fact-finding -- assessing veracity of observations shared on social media. Recent literature developed a mathematical approach for exploiting social networks, such as Twitter, as noisy sensor networks that report observations on the state of the physical world. It was shown that...
The paper develops a recursive state estimator for social network data streams that allows exploitation of social networks, such as Twitter, as sensor networks to reliably observe physical events. Recent literature suggested using social networks as sensor networks leveraging the fact that much of the information upload on the former constitutes acts of sensing. A significant challenge identified...
This paper studies the impact of side information on the lossy compression of a remote source, one which is indirectly accessed by the encoder. In particular, we identify the conditions under which sharing side information between the encoder and the decoder may be superior or inferior to having two-sided, i.e., correlated but not identical, side information. As a special case, we characterize the...
We consider a Gaussian two-hop network where the source and the destination can communicate only via a relay node who is both an eavesdropper and a Byzantine adversary. Both the source and the destination nodes are allowed to transmit, and the relay receives a superposition of their transmitted signals. We propose a new coding scheme that satisfies two requirements simultaneously: the transmitted...
A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and destination. Source and relay are connected via two unidirectional out-of-band orthogonal links of finite capacity, and a state-dependent memoryless channel connects source and relay, on one side, and the destination, on the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.