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
  • 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.
  • 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.
  • Simulation of random processes and rate-distortion theory

    Publication Year: 1996, Page(s):63 - 86
    Cited by:  Papers (76)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1876 KB)

    We study the randomness necessary for the simulation of a random process with given distributions, on terms of the finite-precision resolvability of the process. Finite-precision resolvability is defined as the minimal random-bit rate required by the simulator as a function of the accuracy with which the distributions are replicated. The accuracy is quantified by means of various measures: variati... 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.
  • Erasure, list, and detection zero-error capacities for low noise and a relation to identification

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

    For the discrete memoryless channel (χ, y, W) we give characterizations of the zero-error erasure capacity Cer and the zero-error average list size capacity Cal in terms of limits of suitable information (respectively, divergence) quantities (Theorem 1). However, they do not “single-letterize.” Next we assume that χ⊂y and W(x|x)>0 for all x∈&ch... 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.
  • 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.
  • Concept learning using complexity regularization

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

    In pattern recognition or, as it has also been called, concept learning, the value of a { 0,1}-valued random variable Y is to be predicted based upon observing an Rd-valued random variable X. We apply the method of complexity regularization to learn concepts from large concept classes. The method is shown to automatically find a good balance between the approximation error and the estim... 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 (22)
    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.
  • An inequality on guessing and its application to sequential decoding

    Publication Year: 1996, Page(s):99 - 105
    Cited by:  Papers (90)  |  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.
  • 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.
  • 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.
  • Fisher information and stochastic complexity

    Publication Year: 1996, Page(s):40 - 47
    Cited by:  Papers (346)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    By taking into account the Fisher information and removing an inherent redundancy in earlier two-part codes, a sharper code length as the stochastic complexity and the associated universal process are derived for a class of parametric processes. The main condition required is that the maximum-likelihood estimates satisfy the central limit theorem. The same code length is also obtained from the so-... 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.

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