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
  • 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.
  • 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.
  • 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.
  • New binary covering codes obtained by simulated annealing

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

    New binary covering codes of radius 1, obtained by simulated annealing, are presented. These constructions establish that K(9, 1)⩽62 and K(12, 1)⩽380. The article is concerned with finding upper bounds on K(n,R), the minimum cardinality of any binary code of length n and with covering radius R View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conservative arrays: multidimensional modulation codes for holographic recording

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

    In holographic storage, two-dimensional arrays of binary data is optically recorded in a medium via an interference process. To ensure optimum operation of a holographic recording system, it is desirable that the patterns of 1s (light) and 0s (no light) in the recorded array satisfy the following modulation constraint: in each row and column of the array there are at least t transitions of the typ... 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 (23)
    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.
  • 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.
  • Communication in key distribution schemes

    Publication Year: 1996, Page(s):19 - 28
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (960 KB)

    A (g, b) key distribution scheme allows conferences of g users to generate secret keys, such that disjoint coalitions of b users cannot gain any information on the generated key (in the information-theoretic sense). We study the relationships between communication and space efficiency of key distribution schemes. We prove that communication does not help in the context of unrestricted schemes. On ... 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.
  • Generalization of GMW sequences and No sequences

    Publication Year: 1996, Page(s):260 - 262
    Cited by:  Papers (20)
    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.
  • An inequality on guessing and its application to sequential decoding

    Publication Year: 1996, Page(s):99 - 105
    Cited by:  Papers (80)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    Let (X,Y) be a pair of discrete random variables with X taking one of M possible values, Suppose the value of X is to be determined, given the value of Y, by asking questions of the form “Is X equal to x?” until the answer is “Yes”. Let G(x|y) denote the number of guesses in any such guessing scheme when X=x, Y=y. We prove that E[G(X|Y)ρ]⩾(1+lnM)-&rh... 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.
  • 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.
  • 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 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.
  • Bits through queues

    Publication Year: 1996, Page(s):4 - 18
    Cited by:  Papers (143)
    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.
  • Optimal biphase sequences with large linear complexity derived from sequences over Z4

    Publication Year: 1996, Page(s):206 - 216
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (884 KB)

    New families of biphase sequences of size 2r-1+1, r being a positive integer, are derived from families of interleaved maximal-length sequences over Z4 of period 2(2r-1). These sequences have applications in code-division spread-spectrum multiuser communication systems. The families satisfy the Sidelnikov bound with equality on θmax, which denotes ... 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.
  • Partial period crosscorrelations of geometric sequences

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

    The expectations and variances of partial period crosscorrelations for certain geometric sequences are estimated. The expectations of the partial period crosscorrelations are shown to be proportional to the periodic crosscorrelations. Bounds are found for the variance that show that with high probability the partial period crosscorrelations are small if the sequences are balanced 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