IEEE Transactions on Information Theory

Volume 49 Issue 5 • May 2003

Filter Results

Displaying Results 1 - 25 of 25
  • Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels

    Publication Year: 2003, Page(s):1073 - 1096
    Cited by:  Papers (2509)  |  Patents (51)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1620 KB) | HTML iconHTML

    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 channel, but there is a fundamental tradeoff between how much of each any coding scheme can get. For the richly scattered Rayleigh-fading channel,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal space-time coding

    Publication Year: 2003, Page(s):1097 - 1119
    Cited by:  Papers (329)  |  Patents (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1331 KB) | HTML iconHTML

    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 component codes optimized for single-input-single-output (SISO) channels. Each component code is assigned to a "thread" in the space-time matrix, al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree-based reparameterization framework for analysis of sum-product and related algorithms

    Publication Year: 2003, Page(s):1120 - 1146
    Cited by:  Papers (78)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1357 KB) | HTML iconHTML

    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 algorithm as well as variations and extensions of BP. Algorithms in this class can be formulated as a sequence of reparameterization updates, each of wh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • To code, or not to code: lossy source-channel communication revisited

    Publication Year: 2003, Page(s):1147 - 1158
    Cited by:  Papers (297)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (731 KB) | HTML iconHTML

    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 distribution, the distortion measure, the channel conditional distribution, and the channel input cost function. Closed-form necessary and sufficient ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The duality between information embedding and source coding with side information and some applications

    Publication Year: 2003, Page(s):1159 - 1180
    Cited by:  Papers (88)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1400 KB) | HTML iconHTML

    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 implications for a number of important applications. The single-letter characterization of the information-embedding problem is developed and related to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Duality between source coding and channel coding and its extension to the side information case

    Publication Year: 2003, Page(s):1181 - 1203
    Cited by:  Papers (140)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1724 KB) | HTML iconHTML

    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 source and channel coding, formulating the precise conditions under which the optimal encoder for one problem is functionally identical to the optima... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mismatch in high-rate entropy-constrained vector quantization

    Publication Year: 2003, Page(s):1204 - 1217
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (963 KB) | HTML iconHTML

    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 for a k-dimensional probability density function (PDF) g and then applied to another PDF f for which f/g is bounded, then the resulting mismatch or... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computation and analysis of the N-Layer scalable rate-distortion function

    Publication Year: 2003, Page(s):1218 - 1230
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1879 KB) | HTML iconHTML

    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 q/sub y1/ and q/sub y2/|y/sub 1/. However, the ignored and seemingly insignificant boundary cases, where q/sub y1/=0 and q/sub y2/|y/sub 1/ is und... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal block-type-decodable encoders for constrained systems

    Publication Year: 2003, Page(s):1231 - 1250
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1402 KB) | HTML iconHTML

    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 condition which guarantees the equality of the optimal rates of block-decodable and deterministic encoders for the same block length. We introduce ano... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative decoding of codes over complex numbers for impulsive noise channels

    Publication Year: 2003, Page(s):1251 - 1260
    Cited by:  Papers (63)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (689 KB) | HTML iconHTML

    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 amplitude modulation (QAM), with a unitary generator matrix G. Choosing the inverse Fourier transform as G, the encoding procedure is similar to orthogonal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New asymptotic bounds for self-dual codes and lattices

    Publication Year: 2003, Page(s):1261 - 1274
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1123 KB) | HTML iconHTML

    We give an independent proof of the Krasikov-Litsyn bound d/n/spl lsim/(1-5/sup -1/4/)/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 lattices, and quantum codes; in particular, we show that the Krasikov-Litsyn bound applies to singly-even binary codes, and obtain an anal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complete joint weight enumerators and self-dual codes

    Publication Year: 2003, Page(s):1275 - 1282
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (741 KB) | HTML iconHTML

    We define the complete joint weight enumerator in genus g for codes over /spl Zopf//sub 2k/ 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 formed from these series. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combinatorial constructions of optimal optical orthogonal codes with weight 4

    Publication Year: 2003, Page(s):1283 - 1292
    Cited by:  Papers (73)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1013 KB) | HTML iconHTML

    A (v,k,/spl lambda/) optical orthogonal code C is a family of (0,1) sequences of length v and weight k satisfying the following correlation properties: 1) /spl Sigma//sub 0/spl les/t/spl les/v-1/x/sub t/x/sub t+i//spl les//spl lambda/ for any x=(x/sub 0/, x/sub 1/, ..., x/sub v-1/)/spl isin/C and any integer i/spl ne/0(mod v); 2) /spl Sigma//sub 0/spl les/t/spl les/v-1/x/sub t/y/sub t+i//spl les//... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MMSE analysis of certain large isometric random precoded systems

    Publication Year: 2003, Page(s):1293 - 1311
    Cited by:  Papers (70)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1283 KB) | HTML iconHTML

    Linear precoding consists in multiplying by an N/spl times/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 introduced for the purpose of analyzing the performance of minimum mean-square error (MMSE) receivers for certain large random isometric precode... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applications of list decoding to tracing traitors

    Publication Year: 2003, Page(s):1312 - 1318
    Cited by:  Papers (29)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (403 KB) | HTML iconHTML

    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 (TA) traitor tracing algorithm is very fast. We compare the TA and identifiable parent property (IPP) traitor tracing algorithms, and give evidenc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential traitor tracing

    Publication Year: 2003, Page(s):1319 - 1326
    Cited by:  Papers (27)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (558 KB) | HTML iconHTML

    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 tracing schemes. We give two general constructions and show the relationship between c-TA codes and sequential tracing schemes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Chernoff bounds on pairwise error probabilities of space-time codes

    Publication Year: 2003, Page(s):1327 - 1336
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (635 KB) | HTML iconHTML

    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, we specialize the obtained results to the cases of space-time-separable noise, white noise, and uncorrelated fading. We derive approximate Cherno... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Product-function frames in l/sup 2/(/spl Zopf/)

    Publication Year: 2003, Page(s):1336 - 1342
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (385 KB) | HTML iconHTML

    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 l/sup 2/(/spl Zopf/). The frame elements of these frames are represented as products of two or more sequences. This forms a generalized structure for many currently existing transforms. We define necessary and sufficient conditions on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multidimensional companding quantization of the Gaussian source

    Publication Year: 2003, Page(s):1343 - 1351
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (598 KB) | HTML iconHTML

    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. Heuristic derivations of the point density and moment of inertia of companding are given, which combined result in the distortion formula by Bucklew. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Geometric Reed-Solomon codes of length 64 and 65 over F/sub 8/

    Publication Year: 2003, Page(s):1351 - 1353
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB) | HTML iconHTML

    We determine the actual parameters for a class of one-point codes of length 64 and 65 over F/sub 8/ 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], [64,11,42], [64,12,40], [65,5,52], [65,10,43], [65,11,42], [65,12,41], and [65,13,40] are better than any known code. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some new extremal codes of lengths 76 and 78

    Publication Year: 2003, Page(s):1353 - 1354
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (211 KB) | HTML iconHTML

    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 automorphism of order 19 without fixed coordinates. The code of length 78 has a new weight enumerator and an automorphism of order 19 with two fixed coord... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a simple method for detecting synchronization errors in coded messages

    Publication Year: 2003, Page(s):1355 - 1363
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB) | HTML iconHTML

    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) channels permitting any combination of the substitution, insertion, and deletion (SID) error types, and address the cases of both scattered and b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hit statistics in FH-CDMA unslotted packet networks

    Publication Year: 2003, Page(s):1363 - 1368
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (401 KB) | HTML iconHTML

    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 a formal proof that if the ratio of the number of interfering packets to the number of frequency slots K/q is held constant, hits due to multiple-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Expected number of maxima in the envelope of a spherically invariant random process

    Publication Year: 2003, Page(s):1369 - 1375
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (390 KB) | HTML iconHTML

    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 processes (SIRPs) play an important role. These processes are of interest mainly due to the fact that they allow one to relax the assumption of Gaus... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contributors

    Publication Year: 2003, Page(s):1376 - 1382
    Request permission for commercial reuse | PDF file iconPDF (184 KB)
    Freely Available from IEEE

Aims & Scope

IEEE Transactions on Information Theory publishes papers concerned with the transmission, processing, and utilization of information.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu