IEEE Transactions on Information Theory

This paper considers the model of an arbitrarily distributed signal x observed through an added independent white Gaussian noise w, y=x+w. New relations between the minimal mean-square error of the noncausal estimator and the likelihood ratio between y ...

We obtain the first term in the high signal-to-noise ratio (SNR) asymptotic expansion of the sum-rate capacity of noncoherent fading networks, i.e., networks where the transmitters and receivers-while fully cognizant of the fading law-have no access to ...

Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. ...

We present a universal estimator of the divergence $D(P,Vert,Q)$ for two arbitrary continuous distributions $P$ and $Q$ satisfying certain regularity conditions. This algorithm, which observes independent and identically distributed (i.i.d.) samples ...

Capacity analysis for channels with side information at the receiver has been an active area of interest. This problem is well investigated for the case of finite-alphabet channels. However, the results are not easily generalizable to the case of ...

In this second part of our two-part paper, we consider the capacity analysis for wireless mobile systems with multiple-antenna architectures. We apply the results of the first part to a commonly known baseband, discrete-time multiple-antenna system ...

A discrete-time single-user scalar channel with temporally correlated Rayleigh fading is analyzed. There is no side information at the transmitter or the receiver. A simple expression is given for the capacity per unit energy, in the presence of a peak ...

This paper considers the capacity of spatially correlated Rician multiple-input multiple-output (MIMO) channels. We consider the general case with double-sided correlation and arbitrary rank channel means. We derive tight upper and lower bounds on the ...

We consider linear multistage detectors with universal (large system) weighting for synchronous code-division multiple access (CDMA) in multipath fading channels with many users. A convenient choice of the basis of the projection subspace allows a joint ...

Squashed entanglement and entanglement of purification are quantum-mechanical correlation measures and are defined as certain minimizations of entropic quantities. In this paper, we present the first nontrivial calculations of both quantities. Our ...

We consider the problem of optimum joint public information embedding and lossy compression with respect to a fidelity criterion. The decompressed composite sequence (stegotext) is distorted by a stationary memoryless attack, resulting in a forgery ...

The theory developed on the sequence optimization for equal-power code-division multiple-access (CDMA) systems is generalized in this paper. Unlike previous works, where discrete-time or vector channel models are predominantly employed, the overloaded ...

A binary sequence satisfies a one-dimensional $(d_1, k_1, d_2, k_2)$ runlength constraint if every run of zeros has length at least $d_1$ and at most $k_1$ and every run of ones has length at least $d_2$ and at most $k_2$ . A two-dimensional binary ...

Given positive integers q,n, and d, denote by A_q(n,d) the maximum size of a q-ary code of length n and minimum distance d. The famous Gilbert-Varshamov bound asserts that A_q(n,d+1)≥qⁿ/V_q(n,d) where V_q(n,d)=Σ_i=0^d (_iⁿ)(q-1)ⁱ is the volume of a q-...

This paper describes the design and analysis of low-density parity-check (LDPC) codes over rings and shows how these codes, when mapped onto appropriate signal constellations, can be used to effect bandwidth-efficient modulation. Specifically, LDPC ...

A new method for analyzing low-density parity-check (LDPC) codes and low-density generator-matrix (LDGM) codes under bit maximum a posteriori probability (MAP) decoding is introduced. The method is based on a rigorous approach to spin glasses developed ...

The structures of convolutional self-orthogonal codes and convolutional self-doubly-orthogonal codes for both belief propagation and threshold iterative decoding algorithms are analyzed on the basis of difference sets and computation tree. It is shown ...

In most recording channels, modulation codes are employed to transform user data to sequences that satisfy some desirable constraint. Run-length-limited (RLL(d,k)) and maximum transition run (MTR(j,k)) systems are examples of constraints that improve ...

A Gaussian orthogonal relay model is investigated, where the source transmits to the relay and destination in channel 1, and the relay transmits to the destination in channel 2, with channels 1 and 2 being orthogonalized in the time–frequency plane in ...

A new uniquely decodable (UD) code pair for the two-user binary adder channel (BAC) is presented. This code pair leads to an improved bound for the zero-error capacity region of such a channel. The highest known rate for a UD code pair for the two-user ...

A password-based key derivation function (KDF)—a function that derives cryptographic keys from a password—is necessary in many security applications. Like any password-based schemes, such KDFs are subject to key search attacks (often called dictionary ...

In 2001, Nyberg proved three important correlation theorems and applied them to several cryptanalytic contexts. We continue the work of Nyberg in a more theoretical direction. We consider a general functional form and obtain its Walsh transform. Two of ...

For a prime $p$ and positive integers $M$ and $n$ such that $Mvert p^n - 1$ , Sidel'nikov introduced $M$ -ary sequences (called Sidel'nikov sequences) of period $p^n -1$ , the out-of-phase autocorrelation magnitude of which is upper bounded by $4$ . In ...

The methods for solving optimal filtering problems in the case of the classical stationary processes have been well known since the late 1940s. Practice often gives rise to what is not a classical stationary process but a generalized one, and white ...

We consider the problem of least squares estimation of the parameters of two–dimensional (2-D) exponential signals observed in the presence of an additive noise field, when the assumed number of exponentials is incorrect. We consider both the case where ...

A broad set of sufficient conditions that guarantees the existence of the maximum entropy (maxent) distribution consistent with specified bounds on certain generalized moments is derived. Most results in the literature are either focused on the minimum ...

We study the distance measures between two probability distributions via two different distance metrics, a new metric induced from Jensen–Shannon divergence, and the well known $L_1$ metric. We show that several important results and constructions in ...

Multidimensional binary mappings for bit-interleaved coded modulations (BICMs) on ergodic multiple-antenna channels with iterative decoding are presented. After derivation of a closed-form expression for the pairwise error probability under ideal ...

It is widely accepted that short cycles in Tanner graphs deteriorate the performance of message-passing algorithms. This discourages the use of these algorithms on Tanner graphs (TGs) of well-known algebraic codes such as Hamming codes, Bose–Chaudhuri–...

An interesting practical consideration for decoding of serial or parallel concatenated codes with more than two components is the determination of the lowest complexity component decoder schedule which results in convergence. This correspondence ...