TIT
2008
13 years 11 months ago
2008
This paper considers the maximization of information rates for the Gaussian frequency-selective interference channel, subject to power and spectral mask constraints on each link. T...
TIT
2008
13 years 11 months ago
2008
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
TIT
2008
13 years 11 months ago
2008
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
TIT
2008
13 years 11 months ago
2008
We consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes...
TIT
2008
13 years 11 months ago
2008
The capacity of sticky channels, a subclass of insertion channels where each symbol may be duplicated multiple times, is considered. The primary result is to provide nearly tight n...
TIT
2008
13 years 11 months ago
2008
Abstract--We study continuous-time multidimensional widesense stationary (WSS) and (almost) cyclostationary processes in the frequency domain. Under the assumption that the correla...
TIT
2008
13 years 11 months ago
2008
We consider the design of systems for sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the samp...
TIT
2008
13 years 11 months ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
TIT
2008
13 years 11 months ago
2008
In this paper, we propose a new class of low-rate error correction codes called repeat-zigzag-Hadamard (RZH) codes featuring simple encoder and decoder structures, and flexible cod...
TIT
2008
13 years 11 months ago
2008
Abstract--In linear programming (LP) decoding of a low-density parity-check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over ...