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 analyzes the strategic communication paradigm over a sensor network. We consider optimal communication strategies in a sensor network where each sensor is strategic and aims to maximize its own objective which involves type and source random variables. The objective of the receiver is to minimize the estimation error associated with the source. The orthogonal multiple access channel model...
From a subset of the n-dimensional integer lattice, we independently pick two points uniformly at random. A sumset is formed by adding these two points component-wise and a sumset is called typical, if the sum falls inside this set with high probability. In this note we characterize the asymptotic size of the typical sumsets for large n, and show that the typical sumset size exhibits different behaviors...
In this paper, we consider a cognitive two-way relay system with multiple relay nodes and multiple primary receivers over Nakagami-m fading channels. Relay nodes process signal following selective decode-and-forward (DF) relay technique. The opportunistic relay selection is used to choose the best relay. We derive the exact closed-form expression of the overall outage probability over Nakagami-m fading...
The source coding problem with common reconstruction constraint is considered, where the encoder can produce an exact copy of the compressed source reconstructed by the decoder. In this paper, we consider the variation of this problem in which the encoder can observe the side information which may be different from the decoder side information. For the doubly-symmetric binary source, we derive the...
Statistical error compensation techniques in computing circuits are becoming prevalent, especially as implemented on nanoscale physical substrates. One such technique that has been developed and deployed is algorithmic noise tolerance (ANT), which aggregates information from several computational branches operating at different points along energy-reliability circuit tradeoffs. To understand this...
Two polar coding schemes are proposed for the degraded broadcast channel under different reliability and secrecy requirements. In these settings, the transmitter wishes to send multiple messages to a set of legitimate receivers keeping them masked from a set of eavesdroppers, and individual channels are assumed to gradually degrade in such a way that each legitimate receiver has a better channel than...
We consider the state dependent channels with full state information with at the sender and partial state information at the receiver. For this state dependent channel, the channel capacity under rate constraint on the state information at the decoder was determined by Steinberg. In this paper, we study the correct probability of decoding at rates above the capacity. We prove that when the transmission...
In this paper, an achievability region and a converse region for the two-user Gaussian interference channel with noisy channel-output feedback (G-IC-NOF) are presented. The achievability region is obtained using a random coding argument and three well-known techniques: rate splitting, superposition coding and backward decoding. The converse region is obtained using some of the existing perfect-output...
The problem of one-way file synchronization from the client to the data-center, namely, file updates, is studied. The problem is investigated in particular when an old version of a file which can be available at both client and data-center, is edited by the client to a new version. The edits are modeled as random insertions and deletions (InDels). Based on the updated and the previous version of the...
If Alice must communicate with Bob over a channel shared with the adversarial Eve, then Bob must be able to validate the authenticity of the message. In particular we consider the model where Alice and Eve share a discrete memoryless multiple access channel with Bob, thus allowing simultaneous transmissions from Alice and Eve. By traditional random coding arguments, we demonstrate an inner bound on...
We present nonasymptotic achievability and converse bounds on the maximum coding rate (for a fixed average error probability and a fixed average blocklength) of variable-length full-feedback (VLF) and variable-length stop-feedback (VLSF) codes operating over a binary erasure channel (BEC). For the VLF setup, the achievability bound relies on a scheme that maps each message onto a variable-length Huffman...
This paper investigates a new methodology for soft information forwarding (SIF) based on a novel technique known as soft angular modulation (SAM). In this new relay scheme, the soft symbols are embedded into phases at the relay. This is more advantageous as we refrain to forward real values (under bandwidth constraints) via wireless channels. This makes the proposed scheme practically feasible. The...
Modern digital communication systems can benefit from soft-decision algorithms in receiver implementations. Such algorithms require reliability information about every data bit which is typically given in terms of Log-Likelihood Ratios (LLRs) or short L-Values. Several efficient receiver implementations based on L-Values have already been proposed in the literature. Many of them exploit the famous...
Functional Magnetic Resonance Imaging (fMRI) methods produce high dimensional representation of cognitive processes under heavy noise due to the limitations of hardware and measurement techniques. In order to reduce the noise and extract useful information from the fMRI data, a sequence of pre-processing techniques, such as smoothing with spatial filters and z-scoring, are used. In this study, we...
We introduce an optimisation problem to maximise the throughput of class of rateless codes subject to a delay constraint for a point to point erasure packet channel with delayed feedback. We show that this problem is convex. Using the formulation for point to point communication, we extend our approach to the communication of multiple unicast flows in a network.
An information-theoretic lower bound is developed for the caching system studied by Maddah-Ali and Niesen. By comparing the proposed lower bound with the decentralized coded caching scheme of Maddah-Ali and Niesen, the optimal memory-rate tradeoff is characterized to within a multiplicative gap of 4.7 for the worst case, improving the previous analytical gap of 12. Furthermore, for the case when users'...
We utilize the Information Bottleneck method in a discrete density evolution scheme that was introduced by Brian M. Kurkoski et al. in order to find message mappings for the node operations of discrete LDPC decoders. The resulting decoders have performance close to belief propagation decoding but require much lower implementation efforts because they only process unsigned integers instead of log-likelihood-ratios...
In this paper, two joint phase estimation and decoding algorithms based on divergence minimization are presented for satellite coded transmissions in the presence of strong phase noise. The algorithms perform approximate Bayesian inference in a hybrid graphical model for time-varying phase and discrete symbols, where each pair of the random phase and data symbol are decoupled by minimizing the inclusive...
Multiple measurements of a physical or biometric identifier are used at the decoder of a secrecy system to improve the secret-key vs. privacy-leakage capacity region of the single-measurement case. The capacity regions of doubly symmetric binary sources with multiple measurements are derived by applying Mrs. Gerber's lemma to mixtures of binary channels.
We consider a distributed parameter estimation problem, in which multiple terminals send messages related to their local observations using limited rates to a fusion center who will obtain an estimate of a parameter related to observations of all terminals. It is well known that if the transmission rates are in the Slepian-Wolf region, the fusion center can fully recover all observations and hence...
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.