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.
Packet networks need to maintain state in the form of forwarding tables at each switch. The cost of this state increases as networks support ever more sophisticated per-flow routing, traffic engineering, and service chaining. Per-flow or per-path state at the switches can be eliminated by encoding each packet's desired path in its header. A key component of such a method is an efficient encoding of...
We revisit a fundamental open problem in quantum information theory, namely whether it is possible to transmit quantum information at a rate exceeding the channel capacity if we allow for a non-vanishing probability of decoding error. Here we establish that the Rains information of any quantum channel is a strong converse rate for quantum communication: For any code with a rate exceeding the Rains...
The partial-inverse approach is further developed to decoding interleaved Reed-Solomon codes and subfield-evaluation codes beyond half the minimum distance. The resulting decoding algorithm is new, and its decoding capability is shown to be state-of-the-art.
We present a framework to study the effect of outdated Channel State Information (CSI) on the performance of a non-reciprocal wireless link. The proposed framework is based on the new concept of age of information. We adopt the Gilbert-Elliot channel model to obtain analytic results regarding the use of periodic CSI feedback and investigate the effect of the age of CSI when multiple orthogonal resource...
The binary adder is a two-user multiple access channel whose inputs are binary and whose output is the real sum of the inputs. While the Shannon capacity region of this channel is well known, little is known regarding its zero-error capacity region, and a large gap remains between the best inner and outer bounds. In this paper, we provide an improved outer bound for this problem. To that end, we introduce...
In this paper, we tackle the compressive phase retrieval problem in the presence of noise. The noisy compressive phase retrieval problem is to recover a K-sparse complex signal s ∈ ℂn, from a set of m noisy quadratic measurements: yi = |aiHs|2 + wi; where aiH ∈ ℂn is the ith row of the measurement matrix A ∈ ℂm×n, and wi is the additive noise to the ith measurement. We consider the regime where K...
This work presents strong data processing results for the power-constrained additive Gaussian channel. Explicit bounds on the amount of decrease of mutual information under convolution with Gaussian noise are shown. The analysis leverages the connection between information and estimation (I-MMSE) and the following estimation-theoretic result of independent interest. It is proved that any random variable...
In this paper, we propose a greedy tree search algorithm for Internet of Things (IoT) signal detection. The proposed method, referred to as matching pursuit with integer tree search (MP-ITS), recovers integer sparse vector (sparse vector whose nonzero elements are chosen from a set of finite alphabets) using the tree search. In order to control the computational burden yet maintains the effectiveness...
In this paper, we propose a novel model to study the efficiency of detecting latent connection relationships, represented by a given set of graphs, among N users. A subset of active nodes transmit following a common codebook over a multiple access Boolean channel. To maximize the error exponent of the structure detection, we formulate an optimization problem whose objective is to max-minimize the...
A low-complexity scheme for the reliable detection of zero blocks in a block sparse signal is proposed. The scheme is based on the application of verification based (VB) recovery algorithms in compressed sensing to block sparse signals, and is described in the context of wideband spectrum sensing (WSS). To apply VB algorithms to WSS, we devise a block sparse sensing matrix by designing a novel analog-to-information...
We obtain the strong data processing constant for sums of real-valued i.i.d. random variables by means of a very simple information-theoretic proof. As a corollary, we recover a classical result concerning the maximal correlation between sums of a sequence of real-valued i.i.d. random variables.
A single-input multiple-output (SIMO) multiple access channel with a large number of uncoded non-cooperating single antenna transmitters and joint processing at a finite precision multi-antenna receiver is considered. We fix the number of receiver antennas per transmitter and investigate the effects of receiver quantization on the recovery of the transmitted signals in the asymptotic limit of a large...
Error-correcting codes are a critical need for modern flash memories. Such codes are typically designed under the assumption that the voltage threshold distributions in flash cells are Gaussian. This assumption, however, is not realistic. This is particularly the case late in the lifetime of flash devices. A recent work by Parnell et al. provides a parameterized model of MLC (2-bit cell) flash which...
We study a source-broadcasting problem involving an erasure broadcast channel with feedback. The receivers each require a certain fraction of a source sequence, and we are interested in the minimum latency, or transmission time, required to serve them all. We first show that for a two-user broadcast channel, a point-to-point outer bound can always be achieved. For broadcasting to three users, we propose...
A concatenation of two encoders is used to construct channel resolvability codes. The code of the first encoder has large minimum distance and the second encoder is linear and has a sparse generator matrix. If the first encoder has encoding complexity O(n) or O(n log n), where n is the length of the codewords, an overall encoding complexity O(n log n) can be achieved. One can tune the sparsity to...
A new structured coding scheme based on transversal group codes is proposed. We investigate the information theoretic performance limits for this strategy in multi-terminal communications. Achievability results are derived for lossless reconstruction of sum of two sources. In addition, a new rate region is presented for the problem of computation over multiple access channel. We show that the application...
We present a high-rate (n, k, d = n − 1)-MSR code with a sub-packetization level that is polynomial in the dimension k of the code. While polynomial sub-packetization level was achieved earlier for vector MDS codes that repair systematic nodes optimally, no such MSR code construction is known. In the low-rate regime (i. e., rates less than one-half), MSR code constructions with a linear sub-packetization...
Research works exploring coding for Flash memories typically seek to correct errors taking place during normal device operation. In this paper, we study the design of codes that protect Flash devices dealing with the unusual class of errors caused by exposure to large radiation dosages. Significant radiation exposure can take place, for example, when Flash is used as on-board memory in satellites...
This paper investigates two classes of relay channels, the Gaussian relay channel and the Gaussian two-way relay channel, when additive noises at the relay and destination(s) are correlated. Lattice codes are used to achieve the rate region for Compress-and-Forward (relay channel) and Compress/Decode-and-Forward (two-way relay channel). Numerical calculations show that there exist particular values...
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.