Scheduled Maintenance on March 25th, 2017:
Single article purchases and IEEE account management will be unavailable from 4:00 AM until 6:30 PM (ET). We apologize for the inconvenience.
By Topic

IEEE Transactions on Information Theory

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.
  • Error exponents for successive refinement by partitioning

    Publication Year: 1996, Page(s):275 - 282
    Cited by:  Papers (16)
    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 Δ21. 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 (20)
    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.
  • A note on generalized Hamming weights of BCH(2)

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

    Determines results for the first six generalized Hamming weights of double-error-correcting primitive binary BCH codes 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 (11)
    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.
  • Upper bound for a hybrid sum over Galois rings with applications to aperiodic correlation of some q-ary sequences

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

    An upper bound for a hybrid exponential sum over Galois rings is derived. This bound is then used to obtain an upper bound for the maximum aperiodic correlation of some sequence families over Galois rings. The bound is of the order of √qlnq where q-1 is the period of the sequences View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Voronoi regions for binary linear block codes

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

    The Voronoi regions of a block code govern many aspects of the code's performance on a Gaussian channel, and they are fundamental instruments in, for example, error probability analysis and soft-decision decoding. The article presents an efficient method for finding the boundaries of the Voronoi regions for an arbitrary binary linear block code. Two theoretical results together lead to the Voronoi... 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.
  • 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.
  • 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.
  • Cyclic codes over Z4, locator polynomials, and Newton's identities

    Publication Year: 1996, Page(s):217 - 226
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    Certain nonlinear binary codes contain more codewords than any comparable linear code presently known. These include the Kerdock (1972) and Preparata (1968) codes that can be very simply constructed as binary images, under the Gray map, of linear codes over Z4 that are defined by means of parity checks involving Galois rings. This paper describes how Fourier transforms on Galois rings a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the undetected error probability of linear block codes on channels with memory

    Publication Year: 1996, Page(s):303 - 309
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    We derive an upper bound on the undetected error probability of binary (n, k) block codes used on channels with memory described by Markov distributions. This bound is a generalization of the bound presented by Kasami et al. (1984) for the binary symmetric channel, and is given as an average value of some function of the composition of the state sequence of the channel. It can be extended in parti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Termination and continuity of greedy growing for tree-structured vector quantizers

    Publication Year: 1996, Page(s):191 - 205
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1440 KB)

    Tree-structured vector quantizers (TSVQ) provide a computationally efficient, variable-rate method of compressing vector-valued data. In applications, the problem of designing a TSVQ from empirical training data is critical. Greedy growing algorithms are a common and effective approach to the design problem. They are recursive procedures that produce a TSVQ one node at a time by optimizing a simpl... 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 (21)
    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.
  • On error exponents for arbitrarily varying channels

    Publication Year: 1996, Page(s):87 - 98
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (980 KB)

    The minimum probability of error achievable by random codes on the arbitrarily varying channel (AVC) is investigated. New exponential error bounds are found and applied to the AVC with and without input and state constraints. Also considered is a simple subclass of random codes, called randomly modulated codes, in which encoding and decoding operations are separate from code randomization. A unive... 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