IEEE Transactions on Information Theory

Issue 6 • November 1985

Filter Results

Displaying Results 1 - 20 of 20
  • Rate distortion when side information may be absent

    Publication Year: 1985, Page(s):727 - 734
    Cited by:  Papers (128)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1027 KB)

    The problem is considered of encoding a discrete memoryless source when correlated side information may or may not be available to the decoder. It is assumed that the side information is not available to the encoder. The rate-distortion functionR (D_{l}, D_{2})is determined whereD_{1}is the distortion achieved with side information andD_{2}is the distortion achieve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-way source coding with a fidelity criterion

    Publication Year: 1985, Page(s):735 - 740
    Cited by:  Papers (67)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (799 KB)

    Let(X_{i}, Y_{i}), i= 1,2 cdots, be a sequence of independent, identically distributed bivariate random variables and consider the following communication situation. TheXcomponent of the process is observed at some location, sayA, while theYcomponent is observed at a different location, sayB. TheX(Y)component of the process has to b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A transform tree code for stationary Gaussian sources

    Publication Year: 1985, Page(s):761 - 768
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1259 KB)

    A new tree code is introduced for discrete-time stationary Gaussian sources with hounded, integrable power spectra and the squared-error distortion measure. The codewords in the tree are reconstructions of Karhunen-Loève transforms of the source words. The branching factor and the number of code letters per branch may vary with level in the tree. A theorem that guarantees the existence of an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The concatenated structure of cyclic and Abelian codes

    Publication Year: 1985, Page(s):788 - 793
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (851 KB)

    It is shown that a linear two-dimensional cyclic code of lengthnNcan be factorized into a direct sum of concatenated codes, with cyclic inner and outer codes and, conversely, thai a two-dimensional cyclic code can be constructed in this way. This result is extended, and it appears that the Abelian codes are obtainable by taking a direct sum of several concatenations of cyclic codes. Cod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On generator matrices of MDS codes (Corresp.)

    Publication Year: 1985, Page(s):826 - 830
    Cited by:  Papers (42)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    It is shown that the family ofq-ary generalized Reed-Solomon codes is identical to the family ofq-ary linear codes generated by matrices of the form[I|A], whereIis the identity matrix, andAis a generalized Cauchy matrix. Using Cauchy matrices, a construction is shown of maximal triangular arrays over GF(q), which are constant along ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating the frequency of a noisy sinusoid by linear regression (Corresp.)

    Publication Year: 1985, Page(s):832 - 835
    Cited by:  Papers (270)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (546 KB)

    The estimation of the parameters of a sinusoid from observations of signal samples corrupted by additive noise is investigated. At high signal-to-noise ratios the additive noise is viewed as an equivalent phase noise, suggesting frequency and phase estimation by linear regression on the signal phase. The variances of the regression estimates are shown to achieve the Cramer-Rao bounds. A formula fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Review of 'Approximation and Weak Convergence Methods for Random Processes, with Applications to Stochastic Systems Theory' (Kushner, H.J.; 1984)

    Publication Year: 1985, Page(s):841 - 842
    Request permission for commercial reuse | PDF file iconPDF (343 KB)
    Freely Available from IEEE
  • Correction to 'An Asymptotically Nonadaptive Algorithm for Conflict Resolution in Multiple-Access Channels'

    Publication Year: 1985, Page(s): 841
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (126 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error recovery for variable length codes

    Publication Year: 1985, Page(s):794 - 801
    Cited by:  Papers (74)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (960 KB)

    When an error occurs in the encoded bit stream produced by a variable length code, the decoder may lose synchronization. A state model for synchronization recovery is developed, and a method for determining the expected span of source symbols lost is presented. The performance of various codes with respect to error recovery is discussed. Two examples are given where equivalent optimal codes have a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximation of locally optimum detector nonlinearities (Corresp.)

    Publication Year: 1985, Page(s):835 - 838
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The problem of finding a detector nonlinearity that maximizes the efficacy (or asymptotic processing gain) over a class of suboptimal nonlinearities is considered. It is shown that this efficacy maximization problem is essentially the same as the problem of finding the minimum-mean-square-error approximation to the locally optimal detector nonlinearity. This result is compared with some intuitive ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new entropy power inequality

    Publication Year: 1985, Page(s):751 - 760
    Cited by:  Papers (75)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1064 KB)

    A strengthened version of Shannon's entropy power inequality for the case where one of the random vectors involved is Gaussian is proved. In particular it is shown that if independent Gaussian noise is added to an arbitrary, multivariate random variable, the entropy power of the resulting random variable is a concave function of the variance (power) of the added noise. The strengthened inequality ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust multiple-input matched filtering: Frequency and time-domain results

    Publication Year: 1985, Page(s):812 - 821
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1504 KB)

    Robust matched filtering is considered for multiple-input systems, with problems formulated in both frequency and time domains being given specific treatment. Robust solutions are found for bounded classes containing well-defined but not exactly specified input characteristics. Several properties for some special cases of interest are examined, and an example is given to illustrate the usefulness ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Golomb rectangles

    Publication Year: 1985, Page(s):781 - 787
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB)

    There are a number of communications problems involving two-dimensional arrays with constrained correlation functions. Golomb's two classes of radar arrays and sonar arrays are examined. Improved bounds, optimal cases, and computational procedures are reported. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random coding bound and codes produced by permutations for the multiple-access channel

    Publication Year: 1985, Page(s):741 - 750
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1104 KB)

    A random coding bound for the multiple-access channel (MAC) is given, and it is shown to be obtainable universally for all MAC's with common input and output alphabets. For channels for which the random coding bound may be achieved by codes consisting of codewords of a single type for each sender, this bound is also achievable by codes produced by permutations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimax robust coding for channels with uncertainty statistics

    Publication Year: 1985, Page(s):802 - 811
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1568 KB)

    The problem of minimax robust coding for classes of channels with uncertainty in their statistical description is addressed. Specific consideration is given to: 1) discrete memoryless channels with uncertainty in the probability transition matrices; 2) discrete-time stationary Gaussian channels with spectral uncertainty; and to uncertainty with classes determined by 2-alternating Choquet capacitie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mean value of the output of a discrete-time Volterra system driven by a Markov chain (Corresp.)

    Publication Year: 1985, Page(s):838 - 841
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    A discrete-time system described by a truncated Volterra series whose input is a Markov chain is considered. A general explicit formula is derived for the mean value of the output process in terms of the transition-probability matrix of the input and of the Volterra kernels. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The rate-distortion region for multiple descriptions without excess rate

    Publication Year: 1985, Page(s):721 - 726
    Cited by:  Papers (91)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    During recent years there has been strong interest in a certain source coding problem, which some authors call the "problem of multiple descriptions." Old and new wringing techniques enable us to establish a single-letter characterization of the rate-distortion region in the case of no excess rate for the joint description. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approximation to the weight distribution of binary linear codes

    Publication Year: 1985, Page(s):769 - 780
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1016 KB)

    Binary primitive BCH codes form a large class of powerful error-correcting codes. The weight distributions of primitive BCH codes are unknown except for some special classes, such as the single, double, triple error-correcting codes and some very low-rate primitive BCH codes. However, asymptotic results for the weight distribution of a large subclass of primitive BCH codes have been derived by Sid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on dichotomous feature extraction (Corresp.)

    Publication Year: 1985, Page(s):831 - 832
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    An error is corrected in an expression, for misclassification probability with dichotomous (binary) random variables, and the perils of dichotomous feature extraction are exhibited. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust detection of signals: A large deviations approach

    Publication Year: 1985, Page(s):822 - 825
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    Robust detection of a signal is considered for the case of independent and identically distributed observations. Following an asymptotic but nonlocal approach, the exponential rates of decrease of the error probabilities are considered as measure of performance. Under this measure a robust detection structure for the symmetric density case is derived. This detection structure is a generalization o... 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