IEEE Transactions on Information Theory

Volume 42 Issue 1 • Jan. 1996

Filter Results

Displaying Results 1 - 25 of 43
  • New rotationally invariant four-dimensional trellis codes

    Publication Year: 1996, Page(s):291 - 300
    Cited by:  Papers (7)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1079 KB)

    Two new classes of rotationally invariant trellis codes are constructed. A simple method is used to check the rotational invariance of a given code in the process of searching for optimum trellis codes. A class of linear trellis codes with constraint lengths 2-9 using four-dimensional constellations is presented. Simulation results show that a 180/spl deg/ rotationally invariant, constraint length... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Introduction to the Theory of Neural Computation {Book Reviews]

    Publication Year: 1996
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (131 KB)
    Freely Available from IEEE
  • The Colleeted Papers of Claude E. Shannon [Book Reviews]

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (360 KB)
    Freely Available from IEEE
  • Contributors

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (595 KB)
    Freely Available from IEEE
  • 1995 Information Theory Society Paper Award

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (234 KB)
    Freely Available from IEEE
  • On the role of biorthonormality in representation of random processes

    Publication Year: 1996, Page(s):288 - 290
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    The representation of a random process by a set of uncorrelated random variables is examined. The main result indicates that a basis decorrelates a random process if and only if it satisfies an integral equation similar to the type satisfied by the Karhunen-Loeve expansion, but by relaxing the requirement of orthogonality of the representation functions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Price's theorem for complex variates

    Publication Year: 1996, Page(s):286 - 287
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    Price's (1958) theorem is derived for complex valued variates. The derivation differs from the existing derivation in two respects. First, the normal variates are not assumed to be circularly complex. Thus the result is more general. Second, the characteristic function of the complex variates is not used View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two noncentral chi-square generalizations

    Publication Year: 1996, Page(s):283 - 285
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    Generalizations of two known noncentral chi-square results are presented. The first generalization concerns extending the expression for the probability that one (first-order) Ricean random variable exceeds another to the expression that one nth-order Ricean random variable exceeds another nth-order Ricean random variable. This latter result is shown to be equivalent to the probability of one nonc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The worst case probability of undetected error for linear codes on the local binomial channel

    Publication Year: 1996, Page(s):172 - 179
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    The worst case probability of undetected error for a linear [n,k:q] code used on a local binomial channel is studied. For the two most important cases it is determined in terms of the weight hierarchy of the code. The worst case probability of undetected error is determined explicitly for some classes of codes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error exponents for successive refinement by partitioning

    Publication Year: 1996, Page(s):275 - 282
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    Given a discrete memoryless source (DMS) with probability mass function P, we seek first an asymptotically optimal description of the source with distortion not exceeding Δ1, followed by an asymptotically optimal refined description with distortion not exceeding Δ2<Δ1. The rate-distortion function for successive refinement by partitioning, deno... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing the Voronoi cell of a lattice: the diamond-cutting algorithm

    Publication Year: 1996, Page(s):161 - 171
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    Numerical evaluation of some typical lattice parameters such as density, thickness, dimensionless second moment (quantizing constant), etc., are considered. Computational complexity grows exponentially with the dimension of the lattices and all known results rely on the very regular structure of some of these. In the paper the authors present a general algorithm which enables computation of all th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds on expected redundancy for nonparametric classes

    Publication Year: 1996, Page(s):272 - 275
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    The article focuses on lower bound results on expected redundancy for universal coding of independent and identically distributed data on [0, 1] from parametric and nonparametric families. After reviewing existing lower bounds, we provide a new proof for minimax lower bounds on expected redundancy over nonparametric density classes. This new proof is based on the calculation of a mutual informatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Block transmission over dispersive channels: transmit filter optimization and realization, and MMSE-DFE receiver performance

    Publication Year: 1996, Page(s):137 - 160
    Cited by:  Papers (62)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1872 KB)

    Optimal transmit filters for packet-based data transmission on dispersive Gaussian-noise linear time-invariant channels are derived by maximizing the mutual information, subject to a fixed input power budget. A quasi-stationary approximation to the optimal nonstationary input covariance process is derived and shown to exhibit negligible mutual information loss from the optimal case, for situations... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New bounds on the expected length of one-to-one codes

    Publication Year: 1996, Page(s):246 - 250
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    We provide new bounds on the expected length L of a binary one-to-one code for a discrete random variable X with entropy H. We prove that L⩾H-log(H+1)-Hlog(1+1/H). This bound improves on previous results. Furthermore, we provide upper bounds on the expected length of the best code as function of H and the most likely source letter probability View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bandwidth allocation for multiple qualities of service using generalized processor sharing

    Publication Year: 1996, Page(s):268 - 272
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    We consider the asymptotic behavior of the queue length distribution in segregated buffers sharing a deterministic server via a class of generalized processor sharing (GPS) policies. Such policies have been proposed as a means to guarantee individual quality of service constraints to heterogeneous streams in integrated services digital networks. These results exhibit the manner in which spare capa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An asymptotic analysis of DS/SSMA communication systems with random polyphase signature sequences

    Publication Year: 1996, Page(s):129 - 136
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    Direct-sequence spread-spectrum multiple-access (DS/SSMA) communication systems with random m-phase sequences, for even m, are considered. By examining the asymptotic behavior of the normalized multiple-access interference (MAI), the authors find that a system with random m-phase sequences, for m>4, should have the same performance as one with random quadriphase sequences asymptotically. Howeve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm

    Publication Year: 1996, Page(s):239 - 245
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    Two universal lossy data compression schemes, one with fixed rate and the other with fixed distortion, are presented, based on the well-known Lempel-Ziv algorithm. In the case of fixed rate R, the universal lossy data compression scheme works as follows: first pick a codebook Bn consisting of all reproduction sequences of length n whose Lempel-Ziv codeword length is ⩽nR, and then us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Q-ary cascaded GMW sequences

    Publication Year: 1996, Page(s):263 - 267
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    Cascaded GMW sequences over GF(q) of arbitrary characteristic are investigated. Their periods are derived. As compared with the existing results on such sequences, substantially extended and improved theorems concerning their linear spans and autocorrelation functions are obtained. A criterion and an algorithm for constructing cascaded GMW sequences that have much larger linear spans than GMW sequ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel group detection for synchronous CDMA communication over frequency-selective Rayleigh fading channels

    Publication Year: 1996, Page(s):116 - 128
    Cited by:  Papers (40)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1328 KB)

    A group detector jointly detects a group of users, and a parallel group detection scheme is a bank of J independently operating group detectors, one for each group of a J group partition of the K transmitting users of a code-division multiple-access (CDMA) channel. In this paper, two group detectors are introduced for the frequency-selective Rayleigh fading (FSRF) CDMA channel. While the optimum m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of binary Markov sources over channels with additive Markov noise

    Publication Year: 1996, Page(s):230 - 239
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    We consider maximum a posteriori (MAP) detection of a binary asymmetric Markov source transmitted over a binary Markov channel. The MAP detector observes a long (but finite) sequence of channel outputs and determines the most probable source sequence. In some cases, the MAP detector can be implemented by simple rules such as the “believe what you see” rule or the “guess zero (or ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General formulas for the Neyman-Pearson type-II error exponent subject to fixed and exponential type-I error bounds

    Publication Year: 1996, Page(s):316 - 323
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    The general formulas for the Neyman-Pearson type-II error exponent subject to two different type-I error constraints, as indicated in the title of the correspondence, are established. As revealed in the formulas, the type-II error exponents are fully determined by the ultimate statistical characteristic of the normalized log-likelihood ratio evaluated under the null hypothesis distribution. Applic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalization of GMW sequences and No sequences

    Publication Year: 1996, Page(s):260 - 262
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    GMW sequences and families of No sequences are generalized. Generalized GMW sequences have ideal autocorrelation and balance properties and generalized No sequences also have optimal correlation properties in terms of Welch's lower bound. The linear spans of the generalized GMW and No sequences appear to be large although there is not at present a closed-form expression for the linear span. A coun... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constellations matched to the Rayleigh fading channel

    Publication Year: 1996, Page(s):106 - 115
    Cited by:  Papers (41)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    We introduce a new technique for designing signal sets matched to the Rayleigh fading channel, In particular, we look for n-dimensional (n⩾2) lattices whose structure provides nth-order diversity. Our approach is based on a geometric formulation of the design problem which in turn can be solved by using a number-geometric approach. Specifically, a suitable upper bound on the pairwise error pro... View full abstract»

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

    Publication Year: 1996, Page(s):4 - 18
    Cited by:  Papers (147)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1236 KB)

    The Shannon capacity of the single-server queue is analyzed. We show that the capacity is lowest, equal to e-1 nats per average service time, when the service time distribution is exponential. Further, this capacity cannot be increased by feedback. For general service time distributions, upper bounds for the Shannon capacity are determined. The capacities of the telephone signaling chan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity

    Publication Year: 1996, Page(s):29 - 39
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (976 KB)

    A general class of sequential codes for lossless compression of individual sequences on a finite alphabet is defined, including many types of codes that one would want to implement. The principal requirement for membership in the class is that the encoding and decoding operations be performable on a computer. The OPTA function for the class of codes is then considered, which is the function that a... View full abstract»

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

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
Prakash Narayan 

Department of Electrical and Computer Engineering