Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
Multiple antennas can be used for increasing the amount of diversity or the number of degrees of freedom in wireless communication systems. We propose the point of view that both types of gains can be simultaneously obtained for a given multiple-antenna ...
Universal space-time coding
A universal framework is developed for constructing full-rate and full-diversity coherent space-time codes for systems with arbitrary numbers of transmit and receive antennas. The proposed framework combines space-time layering concepts with algebraic ...
Tree-based reparameterization framework for analysis of sum-product and related algorithms
We present a tree-based reparameterization (TRP) framework that provides a new conceptual view of a large class of algorithms for computing approximate marginals in graphs with cycles. This class includes the belief propagation (BP) or sum-product ...
To code, or not to code: lossy source-channel communication revisited
What makes a source-channel communication system optimal? It is shown that in order to achieve an optimal cost-distortion tradeoff, the source and the channel have to be matched in a probabilistic sense. The match (or lack of it) involves the source ...
The duality between information embedding and source coding with side information and some applications
Aspects of the duality between the information-embedding problem and the Wyner-Ziv (1976) problem of source coding with side information at the decoder are developed and used to establish a spectrum new results on these and related problems, with ...
Duality between source coding and channel coding and its extension to the side information case
We explore the information-theoretic duality between source coding with side information at the decoder and channel coding with side information at the encoder. We begin with a mathematical characterization of the functional duality between classical ...
Mismatch in high-rate entropy-constrained vector quantization
Bucklew's (1984) high-rate vector quantizer mismatch result is extended from fixed-rate coding to variable-rate coding using a Lagrangian formulation. It is shown that if an asymptotically (high-rate) optimal sequence of variable rate codes is designed ...
Computation and analysis of the N-Layer scalable rate-distortion function
Methods for determining and computing the rate-distortion (RD) bound for N-layer scalable source coding of a finite memoryless source are considered. Optimality conditions were previously derived for two layers in terms of the reproduction distributions ...
Optimal block-type-decodable encoders for constrained systems
A constrained system is presented by a finite-state labeled graph. For such systems, we focus on block-type-decodable encoders, comprising three classes known as block, block-decodable, and deterministic encoders. Franaszek (1968) gives a sufficient ...
Iterative decoding of codes over complex numbers for impulsive noise channels
We discuss the decoding of error-correcting block codes over complex numbers for the transmission over impulsive noise channels. The encoder multiplies a vector of complex information symbols resulting from a modulation scheme, e.g., quadrature ...
New asymptotic bounds for self-dual codes and lattices
We give an independent proof of the Krasikov-Litsyn bound d/n≲(1-5-14/)/2 on doubly-even self-dual binary codes. The technique used (a refinement of the Mallows-Odlyzko-Sloane approach) extends easily to other families of self-dual codes, modular ...
Complete joint weight enumerators and self-dual codes
We define the complete joint weight enumerator in genus g for codes over Z2k and use it to study self-dual codes and their shadows. These weight enumerators are related to the theta series of the associated lattices and Siegel and Jacobi forms are ...
Combinatorial constructions of optimal optical orthogonal codes with weight 4
A (v,k,ý) optical orthogonal code C is a family of (0,1) sequences of length v and weight k satisfying the following correlation properties: 1) ý 0ýtýv-1x tx t+iýý for any x=(x 0, x 1, ..., x v-1)ýC and any integer iý0(mod v); 2) ý 0ýtýv-1x ty t+iýý for ...
MMSE analysis of certain large isometric random precoded systems
Linear precoding consists in multiplying by an N×K matrix a K-dimensional vector obtained by serial-to-parallel conversion of a symbol sequence to be transmitted. In this paper, new tools, borrowed from the so-called free probability theory, are ...
Applications of list decoding to tracing traitors
We apply results from algebraic coding theory to solve problems in cryptography, by using recent results on list decoding of error-correcting codes to efficiently find traitors who collude to create pirates. We produce schemes for which the traceability ...
Sequential traitor tracing
We consider a new type of traitor tracing scheme, called sequential traitor tracing, that protects against rebroadcasting of decrypted content. Sequential traceability (TA) schemes trace all up to c traitors and remove the shortcomings of dynamic ...
Chernoff bounds on pairwise error probabilities of space-time codes
We derive Chernoff bounds on pairwise error probabilities of coherent and noncoherent space-time signaling schemes. First, general Chernoff bound expressions are derived for a correlated Ricean fading channel and correlated additive Gaussian noise. Then,...
Product-function frames in l2(Z)
Frames are the most widely used tool for signal representation in different domains. In this correspondence, we introduce the concept of product-function frames for l2(Z). The frame elements of these frames are represented as products of two or more ...
Multidimensional companding quantization of the Gaussian source
Multidimensional companding quantization is analyzed theoretically for the case of high-resolution and mean-squared-error distortion. The optimality of choosing the expander function to be the inverse of the compressor function is established first. ...
Geometric Reed-Solomon codes of length 64 and 65 over F8
We determine the actual parameters for a class of one-point codes of length 64 and 65 over F8 defined by Hansen and Stichtenoth (1990). Several codes have a minimum distance that exceeds the Feng-Rao bound. The codes with parameters [64,5,51], [64,10,42]...
Some new extremal codes of lengths 76 and 78
We find new extremal [76,38,14] and [78,39,14] binary self-dual codes. The code of length 76 is the first known self-dual code with these parameters. It is shadow extremal and the shortest known self-dual code with minimal distance 14. It has an ...
On a simple method for detecting synchronization errors in coded messages
We investigate the problem of designing pairs (p,s) of words with the property that, if each word of a coded message is prefixed by p and suffixed by s, the resulting set of coded messages is error detecting with finite delay. We consider (combinatorial)...
Hit statistics in FH-CDMA unslotted packet networks
This correspondence is concerned with the statistical dependence of hits due to multiple-access interference in the time-unslotted frequency-hopping (FH) packet networks. Relying on the technique of joint probability generating functions (PGFs), we give ...
Expected number of maxima in the envelope of a spherically invariant random process
In many engineering applications, specially in communication engineering, one encounters a bandpass non-Gaussian random process, with a slowly varying envelope. Among the available models for non-Gaussian random processes, spherically invariant random ...