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.
This paper continues the investigation of the combinatorial formulation of the joint source-channel coding problem. In particular, the connections are drawn to error-reducing codes, isometric embeddings and list-decodable codes. The optimal performance for the repetition construction is derived and is shown to be achievable by low complexity Markov decoders. The compound variation of the problem is...
We consider a lossless multi-terminal source coding problem with one transmitter, two receivers and side information. The achievable rate region of the problem is not well understood. In this paper, we characterise the rate region when the side information at one receiver is conditionally less noisy than the side information at the other, given this other receiver's desired source. The conditionally...
Block Markov superposition encoding has been used on a number of channels to enable transmitter cooperation, including the decode-and-forward (DF) relaying scheme on the full-duplex relay channel. We analyze the error performance of DF with regular encoding and sliding window decoding as the window size of the decoder is allowed to grow. Specifically, we use Gallager's random coding exponent to analyze...
The polymatroid axioms are dominantly used to study the capacity limits of various communication systems. In fact for most of the communication systems, for which the capacity is known, these axioms are solely required to obtain the characterization of capacity. Moreover, the polymatroid axioms are stronger tools to tackle the implication problem for conditional independencies compared to the axioms...
The class of orthogonal relay channels with state in which the source and the relay are connected through a channel that depends on a state sequence is considered. It is assumed that the state sequence is fully known at the destination while it is not known at the source or the relay. The source and the relay are connected to the destination through orthogonal channels. The capacity of this class...
This paper considers optimal control for a collection of separate Markov decision systems that operate asynchronously over their own state spaces. Decisions at each system affect: (i) the time spent in the current state, (ii) a vector of penalties incurred, and (iii) the next-state transition probabilities. An example is a network of smart devices that perform separate tasks but share a common wireless...
This paper revisits earlier work on the achievable rate-region for the coded side-information problem. For specific source distributions we provide computable extreme rate points. As opposed to previous works, we present short and concise proofs and additional rate points below the time-sharing line of previously known rate points. Our results are based on a formulation as an optimization problem.
A network with in-block memory (NiBM) is a generalization of a discrete memoryless network (DMN) where blocks of symbols may have memory inside each block. A cut-set bound is developed for NiBMs that generalizes and strengthens existing cut bounds. This bound gives the capacity for point-to-point channels with iBM.
A secret key agreement setup between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. The three users observe i.i.d. outputs of correlated sources and there is a generalized discrete memoryless multiple access channel (GDMMAC) from users 1 and 2 to user 3 for communication between...
A transmitter has access to X, a relay has access to Y, and a receiver has access to Z and wants to compute a given function ƒ(X, Y, Z). How many bits must be transmitted from the transmitter to the relay and from the relay to the receiver so that the latter can reliably recover ƒ(X, Y, Z)? The main result is an inner bound to the rate region of this problem which is tight when X - Y - Z forms a Markov...
The conventional assumption made in the design of communication systems is that the energy used to transfer information between a sender and a recipient cannot be reused for future communication tasks. A notable exception to this norm is given by passive RFID systems, in which a reader can transfer both information and energy via the transmitted radio signal. Conceivably, any system that exchanges...
The chain graph representations of an achievable scheme is a recently introduced theoretical tool to derive achievable regions based on superposition coding and binning for a general, single-hop, multi-terminal network. It allows for a compact representation of complex transmission strategies and the derivation of the corresponding achievable region for a large class of channels. In this paper we...
This paper is devoted to a first analysis of the class of recurrent AMS formal communication channels. The purpose is to generalize some results and approaches dealing with two-sided channels to a wider class of AMS channels assuming non-invertible shifts and thus to cover, to a certain extent, one-sided channels. The basis is to consider recurrent random processes for which the stationary mean dominates...
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.