IEEE Transactions on Information Theory

Volume 36 Issue 5 • Sept. 1990

Filter Results

Displaying Results 1 - 25 of 28
  • The wavelet transform, time-frequency localization and signal analysis

    Publication Year: 1990, Page(s):961 - 1005
    Cited by:  Papers (2970)  |  Patents (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3699 KB)

    Two different procedures for effecting a frequency analysis of a time-dependent signal locally in time are studied. The first procedure is the short-time or windowed Fourier transform; the second is the wavelet transform, in which high-frequency components are studied with sharper time resolution than low-frequency components. The similarities and the differences between these two methods are disc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Entropic aspects of random fields on trees

    Publication Year: 1990, Page(s):1006 - 1018
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (763 KB)

    The existence of the entropy rate of shift-invariant random fields on binary trees is proven. Alternative representations of and bounds for the entropy rate and surface entropy rate are obtained in terms of conditional entropy. Particular emphasis is placed on Markov chain fields on trees; explicit results are obtained, some of which extend to a more complicated class of tree models.<<ETX>... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On channel capacity per unit cost

    Publication Year: 1990, Page(s):1019 - 1030
    Cited by:  Papers (325)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1018 KB)

    Memoryless communication channels with arbitrary alphabets where each input symbol is assigned a cost are considered. The maximum number of bits that can be transmitted reliably through the channel per unit cost is studied. It is shown that, if the input alphabet contains a zero-cost symbol, then the capacity per unit cost admits a simple expression as the maximum normalized divergence between two... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of information set decoding

    Publication Year: 1990, Page(s):1031 - 1037
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (637 KB)

    Information set decoding is an algorithm for decoding any linear code. Expressions for the complexity of the procedure that are logarithmically exact for virtually all codes are presented. The expressions cover the cases of complete minimum distance decoding and bounded hard-decision decoding, as well as the important case of bounded soft-decision decoding. It is demonstrated that these results ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Orbit and coset analysis of the Golay and related codes

    Publication Year: 1990, Page(s):1038 - 1050
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (847 KB)

    Let b be a code of length n over a field F, with automorphism group G; b/sub w/ denotes the subset of codewords of weight w. The goal is to classify the vectors of F/sup n/ into orbits under G and to determine their distances from the various subcodes b/sub w/. This is done for the first-order Reed-Muller, Nordstrom-Robinson, and Hamming codes of length 16, the Golay and shortened Golay codes of l... View full abstract»

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

    Publication Year: 1990, Page(s):1051 - 1060
    Cited by:  Papers (51)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (963 KB)

    A decoding algorithm for algebraic-geometric codes arising from arbitrary algebraic curves is presented. This algorithm corrects any number of errors up to ((d-g-1)/2), where d is the designed distance of the code and g is the genus of the curve. The complexity of decoding equals sigma (n/sup 3/) where n is the length of the code. Also presented is a modification of this algorithm, which in the ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Geometrical properties of optimal Volterra filters for signal detection

    Publication Year: 1990, Page(s):1061 - 1068
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (650 KB)

    Linear-quadratic filters are a special example of Volterra filters that are limited to the second order. It is shown that all the results recently published which are valid in the linear-quadratic case can be extended with the appropriate notations to Volterra filters of arbitrary order. Particularly, the optimum Volterra filter giving the maximum of the deflection for detecting a signal in noise ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis and further results on adaptive entropy-coded quantization

    Publication Year: 1990, Page(s):1069 - 1088
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2043 KB)

    Buffer underflow and overflow problems associated with entropy coding are completely eliminated by effectively imposing reflecting walls at the buffer endpoints. Synchronous operation of the AECQ (adaptive entropy-coded quantizer) encoder and decoder is examined in detail, and it is shown that synchronous operation is easily achieved without side information. A method is developed to explicitly so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on epsilon -rate for linear, time-invariant, multiinput/multioutput channels

    Publication Year: 1990, Page(s):1089 - 1097
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    Upper and lower bounds on the epsilon -rate of a linear, time-invariant multiple input multiple output channel are derived by using the same volume argument previously used by W.L. Root (1968) for single input single output channels. Because these bounds are not very tight, an approximation to the epsilon -rate is presented which lies between the upper and lower bounds, and can be used to compare ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimized permutation modulation

    Publication Year: 1990, Page(s):1098 - 1100
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (241 KB)

    Permutation modulation is a class of group codes for the Gaussian channel. A group code is a set of vectors obtained by a group of orthogonal matrices operating on an initial vector. An important problem is to find the initial vector yielding the largest minimum Euclidean distance between two vectors. This problem is solved for permutation modulation. The performance of such optimized permutation ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error probability for digital transmission over nonlinear channels with application to TCM

    Publication Year: 1990, Page(s):1101 - 1110
    Cited by:  Papers (33)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (818 KB)

    The computation of upper and lower bounds to error probability in digital transmission over nonlinear channels with a finite memory is considered. By using orthogonal Volterra series, the authors derive a canonical representation for discrete nonlinear systems, based on a linear convolutional code and a memoryless mapper. This representation shows that finite-memory, discrete nonlinear systems can... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Worst-case interactive communication. I. Two messages are almost optimal

    Publication Year: 1990, Page(s):1111 - 1126
    Cited by:  Papers (61)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1540 KB)

    The reduction in communication achievable by interaction is investigated. The model assumes two communicators: an informant having a random variable X, and a recipient having a possibly dependent random variable Y. Both communicators want the recipient to learn X with no probability of error, whereas the informant may or may not learn Y. To that end, they alternate in transmitting messages compris... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the cutoff point for pairwise enabling in multiple access systems

    Publication Year: 1990, Page(s):1127 - 1133
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    Let p/sup 0/ be the minimum Bernoulli probability for which pairwise enabling is an optimal group testing algorithm under a Bernoulli arrival sequence model. In a previous work, it was shown that 0.430<or=p/sup 0/<or=0.568 for unbounded Bernoulli arrival sequences, based on the threshold probabilities at which certain triple enabling algorithms (operating with and without the aid of a helpfu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Path map symbol release rules and the exponential metric tree (source coding)

    Publication Year: 1990, Page(s):1134 - 1139
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (542 KB)

    To design a tree coder for source coding with a fidelity criterion, one must choose a suitable code generator, an efficient tree search algorithm, an appropriate distortion measure, and a path map symbol release rule. The performance of several path map symbol release rules when used with exhaustive searching of the exponential metric tree is investigated. The average single-letter distortion of f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the undetected error probabilities of linear codes for both error correction and detection

    Publication Year: 1990, Page(s):1139 - 1141
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (261 KB)

    The author investigates the (n, k, d>or=2t+1) binary linear codes, which are used for correcting error patterns of weight at most t and detecting other error patterns over a binary symmetric channel. In particular, for t=1, it is shown that there exists one code whose probability of undetected errors is upper-bounded by (n+1) (2/sup n-k/-n)/sup -1/ when used on a binary symmetric channel with t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New results on self-orthogonal unequal error protection codes

    Publication Year: 1990, Page(s):1141 - 1144
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (382 KB)

    A lower bound on the length of binary self-orthogonal unequal error protection (UEP) codes is derived, and two design procedures for constructing optimal self-orthogonal UEP codes are proposed. With this lower bound, known self-orthogonal UEP codes can be evaluated. It is pointed out that, for given values of minimum distance and code rate, the self-orthogonal codes must be relatively long, so opt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error-erasure decoding of binary cyclic codes, up to a particular instance of the Hartmann-Tzeng bound

    Publication Year: 1990, Page(s):1144 - 1149
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (483 KB)

    It is shown that error-erasure decoding for a cyclic code allows the correction of a combination of t errors and r erasures when 2t+r< sigma /sub 0/; the parameter sigma /sub 0/ denotes a particular instance of the Hartmann-Tzeng bound. This procedure is an improvement on the error-erasure decoding algorithm developed by G.D. Forney (1965), which works when 2t+r< sigma , where sigma denotes ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identities and approximations for the weight distribution of q-ary codes

    Publication Year: 1990, Page(s):1149 - 1153
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (347 KB)

    An explicit formula is derived that enumerates the complete weight distribution of an (n, k, d) linear code using a partially known weight distribution. An approximation formula for the weight distribution of q-ary linear (n, k, d) codes is also derived. It is shown that, for a given q-ary linear (n, k, d) code, the ratio of the number of codewords of weight u to the number of words of weight u ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • There is no (24, 12, 10) self-dual quaternary code

    Publication Year: 1990, Page(s):1153 - 1156
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (427 KB)

    An attempt at directly constructing a (24, 12, 10) extremal quaternary code is reported. The attempt at directly constructing the generator matrix of the code is detailed. It was found that no such code exists.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of circulant matrices to the construction and decoding of linear codes

    Publication Year: 1990, Page(s):1157 - 1163
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (751 KB)

    The Fourier transform technique is used to analyze and construct several families of double-circulant codes. The minimum distance of the resulting codes is lower-bounded by 2 square root r and can be decoded easily employing the standard BCH decoding algorithm or the majority-logic decoder of Reed-Muller codes. A decoding procedure for Reed-Solomon codes is presented, based on a representation of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new search for skewsymmetric binary sequences with optimal merit factors

    Publication Year: 1990, Page(s):1163 - 1166
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    Previous results on skewsymmetric sequences with low autocorrelation obtained by making exhaustive searches for sequences with optimal merit factor are extended up to length 69. A sieve that required both the symmetric and antisymmetric components of a skewsymmetric sequence to have high merit factor to make limited searches up to length 117 was used, and many sequences with merit factor greater t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear spans of modified de Bruijn sequences

    Publication Year: 1990, Page(s):1166 - 1167
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (210 KB)

    Order n modified de Bruijn sequences are created by removing a single zero from the longest run of zeros in period 2/sup n/ de Bruijn sequences. The M sequences are then the natural undisguised linear subset of modified de Bruijn sequences. Theorems are given on the linear spans of modified de Bruijn sequences and data are presented for 4<or=n<or=6.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Uniqueness of the generalized Barker sequence of length 6

    Publication Year: 1990, Page(s):1167 - 1170
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (375 KB)

    It is proven that there is a unique generalized Barker sequence of length 6, modulo the group of Barker-preserving transformations.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating and counting binary bent sequences

    Publication Year: 1990, Page(s):1170 - 1173
    Cited by:  Papers (32)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (438 KB)

    Two general classes of binary bent sequences, bent-based and linear-based, are introduced. Algorithms that allow easy generation of bent sequences from either class are given. Based on some simple computation and a computer search, the authors conjecture a lower bound on the total number of binary bent sequences of a given order. This lower bound is exact for bent sequences of order 16; a list is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monotonicity properties for the stochastic knapsack

    Publication Year: 1990, Page(s):1173 - 1179
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    A stochastic system is considered in equilibrium with N servers, no waiting room, and K classes of customers. A class-k customer requires b/sub k/ servers and releases them simultaneously after a random period of time. This multiclass blocking system is motivated by loss networks that support a variety of traffic types (e.g. voice, video, facsimile). The effect of increasing the state-dependent ar... 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