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.
We present an optimization-based approach to stochastic control problems with nonclassical information structures. We cast these problems equivalently as optimization problems on joint distributions. The resulting problems are necessarily nonconvex. Our approach to solving them is through convex relaxation. We solve the instance solved by Bansal and Başar [1] with a particular application of this...
We derive lower bounds to the second-order coding rates for the wiretap channel. The decoding error probability and the information leakage measured in terms of the variational distance secrecy metric are fixed at some constants εr and εs respectively. We leverage on the connection between wiretap channel coding and channel resolvability to derive tighter secrecy bounds than those available in the...
There are two common types of encoding paradigms in multiple descriptions (MD) coding: i) an approach based on conditional codebook generation, which was originally initiated by El-Gamal and Cover for the 2 channel setting and later extended to more than 2 channels by Venkataramani, Kramer and Goyal (VKG), ii) and an approach based on Slepian and Wolf's random binning technique, proposed by Pradhan,...
This paper focuses on a new framework for scalable coding of information based on principles derived from common information of two dependent random variables. In the conventional successive refinement setting, the encoder generates two layers of information called the base layer and the enhancement layer. The first decoder, which receives only the base layer, produces a coarse reconstruction of the...
In this paper the Output Statistics of Random Binning (OSRB) framework is used to prove a new inner bound for the problem of secure channel simulation. Our results subsume some recent results on the secure function computation. We also provide an achievability result for the problem of simultaneously simulating a channel and creating a shared secret key. A special case of this result generalizes the...
This paper addresses the L-channel multiple descriptions problem for a Gaussian source under mean squared error (MSE) distortion metric. We focus on particular cross-sections of the general rate-distortion region where a subset the 2L - 1 distortion constraints are not imposed. Specifically, we assume that certain descriptions are never received simultaneously at the decoder and thereby the transmitted...
We consider a two-way relay channel (TWRC) in which two terminals exchange messages with the help of a relay between them. The two terminals transmit messages to the relay through the Multiple Access Channel (MAC) and the relay transmits messages to the two terminals through the Broadcast Channel (BC). We assume that the MAC and the BC do not interfere with each other, and each terminal receives signals...
We consider the bidirectional broadcast channel with common and confidential messages. We show that polar codes achieve the capacity of binary input symmetrical bidirectional broadcast channels with confidential messages, if one node's channel is a degraded version of the other node's channel. We also find a new bound on the cardinality of the auxiliary random variable in this setup.
A secret key agreement setup between three users is considered in which each pair of them wishes to agree on a secret key hidden from the remaining user. The three users observe i.i.d. outputs of correlated sources and there is a noiseless public channel from each user for communication to the others. In this setup, inner and outer bounds of the secret key capacity region is derived. Moreover, some...
We consider the problem of information flow over Gaussian relay networks. Similar to the recent work by Avestimehr et al. [1], we propose network codes that achieve up to a constant gap from the capacity of such networks. However, our proposed codes are also computationally tractable. Our main technique is to use the codes of Avestimehr et al. as inner codes in a concatenated coding scheme.
This paper investigates a new method in proving converses in secure communication problems. The method gives a converse result in terms of the logarithm of support size instead of entropy. The results are connected to constrained information inequalities involving three random variables. A new constrained non-Shannon type inequality is shown.
Functional dependence graphs (FDG) are an important class of directed graph that capture the functional dependence relationship among a set of random variables. FDGs are frequently used in characterizing and calculating network coding capacity bounds. However, the order of an FDG is usually much larger than the original network and the complexity of computing bounds grows exponentially with the order...
We study a two-transmitter two-receiver network where Receiver 1 can only hear the transmitted signal of Transmitter 1. Transmitter 1 has two messages, one of which is intended for Receiver 1 while both are intended for Receiver 2. Transmitter 2 has one message which is intended for Receiver 2. We call this channel model the Z channel with degraded message sets. When the multiple access link between...
The cognitive interference channel with confidential messages (CICC) proposed by Liang et. al. is investigated. When the security is considered in coding systems, it is well known that the sender needs to use a stochastic encoding to avoid the information about the transmitted confidential message to be leaked to an eavesdropper. For the CICC, the trade-off between the rate of the random number to...
A converse coding theorem for a variable-to-fixed length (VF) source code is proved for a general source with count-ably infinite alphabet. In this result, redundancy is defined by the difference of the symbolwise codeword length and the symbolwise ideal codeword length. It is proved that the redundancy is nonnegative in probability for the codes such that the decoding error probability vanishes and...
In this paper we unveil basic properties of a (k, n)-threshold scheme secure against an extended impersonation attack by an opponent. We consider a scenario in which an opponent tries to impersonate one of the participants under knowledge of other shares. We first establish lower bounds on not only the sizes of the n shares and the uniform random number needed for generation of the shares but also...
In this paper, we investigate a trade-off between the error probability and the redundancy of Slepian-Wolf coding in finite blocklength regime. It is demonstrated that, by combining the information spectrum method with the large deviations result due to Bernstein, we can derive the upper-bound on the redundancy of variable-rate SW coding given by He et al.
This paper considers the problem of source coding for computing functions of correlated i.i.d. random sources. The approach of combining standard and linear random coding for this problem was first introduced by Ahlswede and Han, in the special case of computing the modulo-two sum. In this paper, making use of an adapted version of that method, we generalize their result to more sophisticated scenarios,...
Refined bounds on the probability of decoding error for arbitrary multiple-access channels with correlated sources are derived. The contribution of this paper is to give new upper bounds on the probability of decoding error for any given blocklength. These bounds can be used for the analysis over any multiple-access channels with correlated and uncorrelated sources in the finite blocklength regime...
This paper considers data rate limitations for mean square stabilization of uncertain discrete-time linear systems via finite-data-rate and lossy channels. For a plant having parametric uncertainties, a necessary condition and a sufficient condition are derived, represented by the data rate, the packet loss probability, uncertainty bounds on plant parameters, and the unstable eigenvalues of the plant...
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.