Scheduled System Maintenance
On Tuesday, February 28, IEEE Xplore will undergo scheduled maintenance from 1:00-5:00 PM ET (18:00-22:00 UTC).
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

IEEE Transactions on Information Theory

Issue 3 • May 1993

Filter Results

Displaying Results 1 - 25 of 46
  • Secret key agreement by public discussion from common information

    Publication Year: 1993, Page(s):733 - 742
    Cited by:  Papers (736)  |  Patents (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1058 KB)

    The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y, respectively, but not sharing a secret key initially, is considered. An enemy who knows the random variable Z, jointly distributed with X and Y according to some probability distribution P/sub XYZ/, can also receive all messages exchanged by the two parties over a public channel. The goal of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to "A note on the Shannon capacity of runlength-limited codes"

    Publication Year: 1993, Page(s):1110 - 1112
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (218 KB)

    Two remarks in the above-titled paper by J. Ashley and P.H. Siegel (see ibid. vol.33, no.4, p.601-5, July 1987) pertaining to the rationality of the base b capacity of (d, k) runlength-limited (RLL) constraints and (d, k; c) charge-constrained RLL constraints, where b>2, are corrected.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical information and discrimination

    Publication Year: 1993, Page(s):1036 - 1039
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (470 KB)

    In analogy with the definition of Shannon information, M.H. De Groot (1962) defined statistical information as the difference between prior and posterior risk of a statistical decision problem. Relations are studied between the statistical information and the discrimination functions of information theory known as f-divergences. Using previous results, it is shown that every f-di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polyphase sequence with low autocorrelations

    Publication Year: 1993, Page(s):1085 - 1089
    Cited by:  Papers (34)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (489 KB)

    It is proved that Golomb sequences have perfect periodic autocorrelation. It is also proved that the magnitudes of the out-of-phase aperiodic autocorrelation values of Golomb sequences of length L for all L⩾14 are bounded by √(L /3). It is shown that Bg(L) is asymptotic to √(L/c) (where c≈4.348. .... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relative entropy between Markov transition rate matrices

    Publication Year: 1993, Page(s):1056 - 1057
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (291 KB)

    The relative entropy between two Markov transition rate matrices is derived from sample path considerations. This relative entropy is interpreted as a level-2.5 large-deviations action functional. That is, the level-two large-deviations action functional for empirical distributions of continuous-time Markov chains can be derived from the relative entropy using the contraction mapping principle View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new family of quadriphase sequences for CDMA

    Publication Year: 1993, Page(s):1083 - 1085
    Cited by:  Papers (5)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (341 KB)

    The construction of a family of quadriphase sequences that are suitable for code-division multiple-access spread spectrum (CMA/SS) communication is described. For a given parameter n, where n=2(mod 4), the period of the sequence is 2n-1 chips. The set of sequences asymptotically achieves Welch's lower bound on simultaneous cross-correlation and autocorrelation magnitud... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strong consistency of the contraction mapping method for frequency estimation

    Publication Year: 1993, Page(s):989 - 998
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (923 KB)

    Some statistical properties in regard to the contraction mapping (CM) method are discussed. One of the requirements in this method is that the filter be parameterized to satisfy a certain fundamental property. The parameterization clearly depends on the normalized noise spectrum which theoretically has to be known or estimated a priori. If this information is available, one can first whiten the no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strongly consistent code-based identification and order estimation for constrained finite-state model classes

    Publication Year: 1993, Page(s):893 - 902
    Cited by:  Papers (25)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1006 KB)

    Observations are made of data generated by a stationary ergodic finite-alphabet information source according to an unknown statistical model. Two modeling problems, the identification problem and the order estimation problem, are considered. It is required that the given model class in the identification problem and each given model class in the order estimation problem be a constrained finite-sta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximation theory of output statistics

    Publication Year: 1993, Page(s):752 - 772
    Cited by:  Papers (281)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1668 KB)

    Given a channel and an input process with output statistics that approximate the original output statistics with arbitrary accuracy, the randomness of the input processes is studied. The notion of resolvability of a channel, defined as the number of random bits required per channel use in order to generate an input that achieves arbitrarily accurate approximation of the output statistics for any g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal nonuniform signaling for Gaussian channels

    Publication Year: 1993, Page(s):913 - 929
    Cited by:  Papers (86)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1781 KB)

    Variable-rate data transmission schemes in which constellation points are selected according to a nonuniform probability distribution are studied. When the criterion is one of minimizing the average transmitted energy for a given average bit rate, the best possible distribution with which to select constellations points is a Maxwell-Boltzmann distribution. In principle, when constellation points a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Depth efficient neural networks for division and related problems

    Publication Year: 1993, Page(s):946 - 956
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1179 KB)

    An artificial neural network (ANN) is commonly modeled by a threshold circuit, a network of interconnected processing units called linear threshold gates. It is shown that ANNs can be much more powerful than traditional logic circuits, assuming that each threshold gate can be built with a cost that is comparable to that of AND/OR logic gates. In particular, the main results indicate that powering ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On complexity of trellis structure of linear block codes

    Publication Year: 1993, Page(s):1057 - 1064
    Cited by:  Papers (61)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (831 KB)

    An upper bound on the number of states of a minimal trellis diagram for a linear block code is derived. Using this derivation a cyclic (or shortened cyclic) code or its extended code is shown to be the worst in terms of trellis state complexity among the linear codes of the same length and dimension. The complexity of the minimal trellis diagrams for linear block codes of length 2m, inc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantizer monotonicities and globally optimal scalar quantizer design

    Publication Year: 1993, Page(s):1049 - 1053
    Cited by:  Papers (26)  |  Patents (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (619 KB)

    New monotonicity properties of optimal scalar quantizers are discussed. These monotonicities reveal a globally optimal scalar quantizer structure depending on the probability mass functions and on the number of quantizer levels. By incorporating the monotone quantizer structure into a dynamic programming process, the time complexities of previous algorithms for designing globally optimal scalar qu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding the ternary Golay code

    Publication Year: 1993, Page(s):1043 - 1046
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (462 KB)

    A decoding algorithm is presented for the ternary (11, 6, 5) Golay code. This algorithm is an algebraic decoding and relies on solving the Newton identities associated with the syndromes of the code. However, to complete the decoding some explicit values of Zech's logarithms need to be established View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An application of the Hopfield model to Huffman codes

    Publication Year: 1993, Page(s):1071 - 1076
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (669 KB)

    An application of the neural Hopfield model to the source (optimal) coding problem is presented. This application gives the structure of a Hopfield network, capable of calculating the lengths of the codewords that must be associated to a source alphabet so as to minimize their average length. The case of a stationary and memoryless block-to-variable-length source coding is discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Kernel classification rules from missing data

    Publication Year: 1993, Page(s):979 - 988
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    Nonparametric kernel classification rules derived from incomplete (missing) data are studied. A number of techniques of handling missing observation in the training set are taken into account. In particular, the straightforward approach of designing a classifier only from available data (deleting missing values) is considered. The class of imputation techniques is also taken into consideration. In... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic theory for a fast frequency detector

    Publication Year: 1993, Page(s):1031 - 1036
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (681 KB)

    A fast technique for efficient online signal detection and tracking is extended by analyzing the asymptotic distribution of the detector. A version of the technique is seen to have potentially greater precision than other fast estimators, the upper bound being O(1/n2/3). Coupled with another device, there is potential for achieving the convergence precision of the maxi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rate of convergence result for a universal D-semifaithful code

    Publication Year: 1993, Page(s):813 - 820
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (722 KB)

    The problem of optimal rate universal coding is considered in the context of rate-distortion theory. A D-semifaithful universal coding scheme for discrete memoryless sources is given. The main result is a refined covering lemma based on the random coding argument and the method of types. The average codelength of the code is shown to approach its lower bound, the rate-distortion function,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A time-varying convolutional encoder better than the best time-invariant encoder

    Publication Year: 1993, Page(s):1109 - 1110
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (309 KB)

    A periodically-time-varying binary (3, 2) convolutional code with period T=2 and memory M=1 having larger free distance than the best time-invariant (3, 2) convolutional code with M=1 is presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some properties of sequential predictors for binary Markov sources

    Publication Year: 1993, Page(s):887 - 892
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (665 KB)

    Universal predictions of the next outcome of a binary sequence drawn from a Markov source with unknown parameters is considered. For a given source, the predictability is defined as the least attainable expected fraction of prediction errors. A lower bound is derived on the maximum rate at which the predictability is asymptotically approached uniformly over all sources in the Markov class. This bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity of a binary channel with timing jitter at signal transitions modeled as a random walk

    Publication Year: 1993, Page(s):1064 - 1067
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (505 KB)

    The communication situation in which the time disparity between the receiver's clock and the transmitter's clock is modeled as a random walk is discussed. The channel capacity is obtained as a special case of capacity per unit cost. In this approach, the Baggen-Wolf channel is a timing jitter channel with memory View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical distributions of Hermitian quadratic forms in complex Gaussian variables

    Publication Year: 1993, Page(s):1076 - 1082
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (723 KB)

    Decision variables in numerous practical systems can frequently be characterized using a Hermitian quadratic form in complex Gaussian variates. Performance analysis involving these variates requires a complete description of the statistical distribution of the quadratic form. Such a complete description is presented. The method used is based on inverting the characteristic function of the quadrati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hinging hyperplanes for regression, classification, and function approximation

    Publication Year: 1993, Page(s):999 - 1013
    Cited by:  Papers (195)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1236 KB)

    A hinge function y=h(x) consists of two hyperplanes continuously joined together at a hinge. In regression (prediction), classification (pattern recognition), and noiseless function approximation, use of sums of hinge functions gives a powerful and efficient alternative to neural networks with computation times several orders of magnitude less than is obtained by fitting... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achieving the designed error capacity in decoding algebraic-geometric codes

    Publication Year: 1993, Page(s):743 - 751
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (783 KB)

    A decoding algorithm for codes arising from algebraic curves explicitly constructable by Goppa's construction is presented. Any configuration up to the greatest integer less than or equal to (d *-1)/2 errors is corrected by the algorithm whenever d*⩾6g, where d* is the designed minimum distance of the code and g is the genus of the curve. The algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Acquisition in direct-sequence spread-spectrum communication networks: an asymptotic analysis

    Publication Year: 1993, Page(s):903 - 912
    Cited by:  Papers (76)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1054 KB)

    The effect of multiple-access interference on the acquisition of direct-sequence spread-spectrum (DS/SS) signals is studied. A passive matched filter approach is used, and the acquisition window length, which is the length of the matched filter, determines the complexity of the acquisition scheme. The acquisition-based capacity of a DS/SS system is defined to be the maximum number of simultaneous ... 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