IEEE Transactions on Information Theory

Volume 35 Issue 1 • Jan. 1989

Filter Results

Displaying Results 1 - 25 of 30
  • Exponential-type error probabilities for multiterminal hypothesis testing

    Publication Year: 1989, Page(s):2 - 14
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (993 KB)

    Multiterminal hypothesis testing is considered, subject to the exponential-type constraint alpha /sub n/<or=exp(-nr) on the error probability of the first kind. The problem is to determine the minimum beta */sub n/ of the error probability of the second kind under the given constraint at limited rates R/sub 1/ and R/sub 2/ for observing the respective pairs of variables. Good lower bounds on th... View full abstract»

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

    Publication Year: 1989, Page(s):15 - 29
    Cited by:  Papers (104)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1170 KB)

    The authors' main finding is that any object among doubly exponentially many objects can be identified in blocklength n with arbitrarily small error probability via a discrete memoryless channel (DMC), if randomization can be used for the encoding procedure. A novel doubly exponential coding theorem is presented which determines the optimal R, that is, the identification capacity of the DMC as a f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification in the presence of feedback-a discovery of new capacity formulas

    Publication Year: 1989, Page(s):30 - 36
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (573 KB)

    A study is made of the identification problem in the presence of a noiseless feedback channel, and the second-order capacity C/sub f/ (resp. C/sub F/) for deterministic (resp. randomized) encoding strategies is determined. Several important phenomena are encountered. (1) Although feedback does not increase the transmission capacity of a discrete memoryless channel (DMC), it does increase the (seco... View full abstract»

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

    Publication Year: 1989, Page(s):37 - 43
    Cited by:  Papers (105)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (483 KB)

    The capacity of time-varying additive Gaussian noise channels with feedback is characterized. Toward this end, an asymptotic equipartition theorem for nonstationary Gaussian processes is proved. Then, with the aid of certain matrix inequalities, it is proved that the feedback capacity C/sub FB/ in bits per transmission and the nonfeedback capacity C satisfy C<or=C/sub FB/<or=2C and C<or=C... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dependence balance bounds for single-output two-way channels

    Publication Year: 1989, Page(s):44 - 53
    Cited by:  Papers (62)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (803 KB)

    If in a transmission the inputs of a single-output two-way channel exhibit some interdependence, this dependence must have been created during earlier transmissions. The idea that no more dependence can be consumed than is produced is used to obtain new upper bounds to the capacity region of the discrete memoryless single-output two-way channel. With these upper bounds it is shown that C.E. Shanno... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal data compression and repetition times

    Publication Year: 1989, Page(s):54 - 58
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (433 KB)

    A novel universal data compression algorithm is described. This algorithm encodes L source symbols at a time. An upper limit for the number of bits per source symbol is given for the class of binary stationary sources. In the author's analysis, a property of repetition times turns out to be of crucial importance.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information capacity of associative memories

    Publication Year: 1989, Page(s):59 - 68
    Cited by:  Papers (54)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (833 KB)

    Associative memory networks consisting of highly interconnected binary-valued cells have been used to model neural networks. Tight asymptotic bounds have been found for the information capacity of these networks. The authors derive the asymptotic information capacity of these networks using results from normal approximation theory and theorems about exchangeable random variables.<<ETX>>... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the linear complexity of functions of periodic GF(q) sequences

    Publication Year: 1989, Page(s):69 - 75
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    It is proved that the product of arbitrary periodic GF(q) sequences attains maximum linear complexity if their periods are pairwise coprime. The necessary and sufficient conditions are derived for maximum linear complexity of the product of two periodic GF(q) sequences with irreducible minimal characteristic polynomials. For a linear combination of products of arbitrary periodic GF(q) sequences, i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Systolic array processing of the Viterbi algorithm

    Publication Year: 1989, Page(s):76 - 86
    Cited by:  Papers (34)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1033 KB)

    Results on efficient forms of decoding convolutional codes based on the Viterbi algorithm by using systolic arrays are presented. Various properties of convolutional codes are discussed. A technique called strongly connected trellis decoding is introduced to increase the efficient utilization of all the systolic array processors. Issues dealing with the composite branch metric generation, survivor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multilevel codes based on partitioning

    Publication Year: 1989, Page(s):87 - 98
    Cited by:  Papers (131)  |  Patents (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1350 KB)

    Following V.V. Ginzburg (1984), a hierarchy of codes is proposed to match the geometric partitioning of a signal set. The authors show that coset codes (including Ungerboeck, lattice, and binary codes) and indeed any codes which rely on partitioning of the signal set are all subclasses of the proposed coding scheme. The combination of such codes in a multilevel scheme often leads to reduced comple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Short codes with a given covering radius

    Publication Year: 1989, Page(s):99 - 109
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (937 KB)

    The covering radius r of a code is the maximum distance from any vector in the space containing the code to the nearest codeword. The authors introduce a new function l(m,r), called the length function, which equals the smallest length of a binary code of codimension m and covering radius r. They investigate basic properties of the length function. Projective geometries over larger fields are used... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some new upper bounds on the covering radius of binary linear codes

    Publication Year: 1989, Page(s):110 - 122
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1041 KB)

    A Griesmer-like upper bound on the covering radius, R, is given. To the author's knowledge this is the only upper bound which explicitly depends on all three parameters n, k, and d. An upper bound on R for cyclic codes is then given which depends on the generator polynomial of the cyclic code and which, in many cases, leads to an improvement of the previous bound. An upper bound on the irreducible... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear multiuser detectors for synchronous code-division multiple-access channels

    Publication Year: 1989, Page(s):123 - 136
    Cited by:  Papers (1126)  |  Patents (108)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1215 KB)

    Under the assumptions of symbol-synchronous transmissions and white Gaussian noise, the authors analyze the detection mechanism at the receiver, comparing different detectors by their bit error rates in the low-background-noise region and by their worst-case behavior in a near-far environment where the received energies of the users are not necessarily similar. Optimum multiuser detection achieves... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Geometric source coding and vector quantization

    Publication Year: 1989, Page(s):137 - 145
    Cited by:  Papers (56)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    A geometric formulation is presented for source coding and vector quantizer design. Motivated by the asymptotic equipartition principle, the authors consider two broad classes of source codes and vector quantizers: elliptical codes and quantizers based on the Gaussian density function, and pyramid codes and quantizers based on the Laplacian density function. Elliptical and weighted pyramid vector ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some optimal and suboptimal receivers deriving information from nonsynchronized Poisson data

    Publication Year: 1989, Page(s):157 - 165
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (771 KB)

    The author derives receivers that make optimal sequence decisions from observations of modulated data in the absence of symbol synchronization for the direct-detection optical channel. He shows that, for soft-decision sequence estimation, the average number of likelihoods that must be evaluated need increase only linearly with the sequence length, with the average number of likelihood evaluations ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resequencing delay and buffer occupancy under the selective-repeat ARQ

    Publication Year: 1989, Page(s):166 - 173
    Cited by:  Papers (53)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (697 KB)

    Consider a communication network that regulates retransmissions of erroneous packets by a selective-repeat (SR) automatic repeat request (ARQ) protocol. Packets are assigned consecutive integers, and the transmitter continuously transmits them in order until a negative acknowledgement or a time-out is observed. The receiver, upon receipt of a packet, checks for errors and returns positive/negative... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the number of memories that can be perfectly stored in a neural net with Hebb weights

    Publication Year: 1989, Page(s):174 - 178
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    Let (w/sub ij/) be the weights of the connections of a neural network with n nodes, calculated from m data vectors v/sup 1/, ..., v/sup m/ in (1,-1)/sup n/, according to the Hebb rule. The author proves that if m is not too large relative to n and the v/sup k/ are random, then the w/sub ij/ constitute, with high probability, a perfect representation of the v/sup k/ in the sense that the v/sup k/ a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The strong converse theorem for hypothesis testing

    Publication Year: 1989, Page(s):178 - 180
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    The authors present the answer to a so-called converse problem by giving the explicit form of the power exponent. This strong converse should be regarded as completing a weak converse previously obtained by R.E. Blahut (1974).<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum a posteriori estimation of multichannel Bernoulli-Gaussian sequences

    Publication Year: 1989, Page(s):181 - 183
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    General problems and solutions are described for maximum a posteriori estimation of multichannel Bernoulli-Gaussian sequences, which are inputs to a linear discrete-time multivariable system. The authors first develop a separation principle, which indicates that one can estimate multichannel Gaussian amplitudes and Bernoulli events separately. They then discuss approaches for estimation of these q... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relationships between m-sequences over GF(q) and GF(q/sup m/)

    Publication Year: 1989, Page(s):183 - 186
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (423 KB)

    It is shown that m-sequences over GF(q/sup m/) of length q/sup nm/-1 corresponding to primitive polynomials in GF(q/sup m/,x) of degree n can be generated from known m-sequences over GF(q) of length q/sup nm/-1 obtained from primitive polynomials in GF(q,x) of degree mn. A procedure for generating the m-sequences over GF(q/sup 2/) from m-sequences over GF(q) was given which enables the generation ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the weight distribution of linear codes having dual distance d'>or=k

    Publication Year: 1989, Page(s):186 - 188
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (306 KB)

    Using only the principle of inclusion and exclusion, the author derives a formula for the weight distribution of an (n,k) code whose dual code has a minimum distance d'>or=k. The result yields a new condition on the weight distributions of a linear code and its dual which is necessary and sufficient for the code to be a maximum distance separable (MDS) code. Moreover, it shows how the weight di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some convolutional codes whose free distances are maximal

    Publication Year: 1989, Page(s):188 - 191
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (334 KB)

    The free distance of a convolutional code of rate 1/n is bounded by n times the constant length of its encoder. Two classes of convolutional codes whose free distances meet this bound are studied. A technique of constructing convolutional codes that meet this bound for all sufficiently large n is given.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments and additions to "Robust transmission of unbounded strings using Fibonacci representations

    Publication Year: 1989, Page(s):191 - 193
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (331 KB)

    An ambiguous point in the paper by Apostolico and Fraenkel (see ibid., vol.IT-33, no.2, p.238-45, March 1987) is clarified. New codes that have better asymptotic performances and better synchronization capability are introduced.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation of the entropy and information of absolutely continuous random variables

    Publication Year: 1989, Page(s):193 - 196
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (373 KB)

    A method is proposed for estimating the entropy and the mutual information of absolutely continuous random vectors, and an upper bound of the mean risks for the proposed estimators under strong mixing conditions is given.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the spectrum of fractional Brownian motions

    Publication Year: 1989, Page(s):197 - 199
    Cited by:  Papers (269)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    Fractional Brownian motions (FBMs) provide useful models for a number of physical phenomena whose empirical spectra obey power laws of fractional order. However, due to the nonstationary nature of these processes, the precise meaning of such spectra remains generally unclear. Two complementary approaches are proposed which are intended to clarify this point. The first one, based on a time-frequenc... 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
Alexander Barg

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

email: abarg-ittrans@ece.umd.edu