IEEE Transactions on Information Theory

Issue 1 • January 1986

Filter Results

Displaying Results 1 - 20 of 20
  • Compression of two-dimensional data

    Publication Year: 1986, Page(s):2 - 8
    Cited by:  Papers (87)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (846 KB)

    Distortion-free compressibility of individual pictures, i.e., two-dimensional arrays of data, by finite-state encoders is investigated. For every individual infinite pictureI, a quantityrho(I)is defined, called the compressibility ofI, which is shown to be the asymptotically attainable lower bound on the compression ratio that can be achieved forIby any ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the minimum distance of cyclic codes

    Publication Year: 1986, Page(s):23 - 40
    Cited by:  Papers (91)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2163 KB)

    The main result is a new lower bound for the minimum distance of cyclic codes that includes earlier bounds (i.e., BCH bound, HT bound, Roos bound). This bound is related to a second method for bounding the minimum distance of a cyclic code, which we call shifting. This method can be even stronger than the first one. For all binary cyclic codes of length< 63(with two exceptions), we s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice

    Publication Year: 1986, Page(s):41 - 50
    Cited by:  Papers (101)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1508 KB)

    Two kinds of algorithms are considered.1)If *** is a binary code of lengthn, a "soft decision" decoding algorithm for *** changes an arbitrary point ofR^{n}into a nearest codeword (nearest in Euclidean distance).2)Similarly, a decoding algorithm for a latticeLambdainR^{n}changes an arbitrary point ofR^{n}into a closest la... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving sparse linear equations over finite fields

    Publication Year: 1986, Page(s):54 - 62
    Cited by:  Papers (123)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1574 KB)

    A "coordinate recurrence" method for solving sparse systems of linear equations over finite fields is described. The algorithms discussed all requireO(n_{1}(omega + n_{1})log^{k}n_{1})field operations, wheren_{1}is the maximum dimension of the coefficient matrix,omegais approximately the number of field operations required to apply the matrix to a test vector, and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On filtered binary processes

    Publication Year: 1986, Page(s):63 - 72
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1383 KB)

    The problem of calculating the probability density function of the output of anRCfilter driven by a binary random process with intervals generated by an equilibrium renewal process is studied. New integral equations, closely related to McFadden's original integral equations, are derived and solved by a matrix approximation method and by iteration. Transformations of the integral equatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variance expressions for four spectral-centroid estimators of a complex Gaussian process

    Publication Year: 1986, Page(s):73 - 78
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (737 KB)

    Variance expressions are derived for four unbiased centroid estimators of an asymmetrical spectrum of the complex envelope of a narrow-band Gaussian process. These estimators are obtained by cross-correlating the undistorted or hard-clipped component and the time derivative of the undistorted or hard-dipped quadrature component of the complex envelope. When both components are hard-clipped, the va... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On nonparametric estimation of a functional of a probability density

    Publication Year: 1986, Page(s):79 - 84
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (803 KB)

    The nonparametric estimate derived from the Hermite orthogonal system of the functionalI=int f^{2}(x) dxwherefis an unknown probability density, is studied. Sufficient conditions for the weak and strong consistency of the estimate are presented, and the rate of convergence is given. In particular, under mild assumptions onf, the rate of mean-square error convergenc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum probability of error for asynchronous Gaussian multiple-access channels

    Publication Year: 1986, Page(s):85 - 96
    Cited by:  Papers (1544)  |  Patents (105)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1394 KB)

    Consider a Gaussian multiple-access channel shared byKusers who transmit asynchronously independent data streams by modulating a set of assigned signal waveforms. The uncoded probability of error achievable by optimum multiuser detectors is investigated. It is shown that theK-user maximum-likelihood sequence detector consists of a bank of single-user matched filters followed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dual product constructions of Reed - Muller type codes (Corresp.)

    Publication Year: 1986, Page(s):103 - 106
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (607 KB)

    Various linear and nonlinearR(r,m)codes having parameters(2^{m}, 2^{k}, 2^{m-r})withk=sum_{i=0}^{r}left(^{m}_{i}right)are constructed fromR(r,q)andR(r,p)codes,m=p+q. A dual construction forR(m-r,m)codes fromR(p-r,p)andR(q-r,q)codes is also presented,m=p+q. As a simple corollary we have tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equidistant binary arithmetic codes (Corresp.)

    Publication Year: 1986, Page(s):106 - 108
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    LetC(B)denote the binary cyclicANcode with generatorA, whereAB=2^{n} - 1. It is known thatC(B)is equidistant ifBis a prime powerp^{k}, where either2or-2is primitive moduloBprovidedpequiv 1 pmod{3}{rm if} k > 1. It is conjectured that these are the onlyBsuch that View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic error probability of binary hypothesis testing for Poisson point-process observations (Corresp.)

    Publication Year: 1986, Page(s):113 - 115
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (430 KB)

    It is shown that the asymptotic probability of error of a binary equiprobable hypothesis test for observed Poisson point processes with rateslambda_{i}(t)=b_{i}(t)+(rho_{i}(t)+z)^{2}, i=0,1, z rightarrow infty, is equal to the error probability of optimum deterministic-signal detection in additive white Gaussian noise when the signals coincide with the square roots of the point-process ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A nonlocal approach for asymptotic memoryless detection theory (Corresp.)

    Publication Year: 1986, Page(s):115 - 120
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1200 KB)

    Previous literature on detector design has presented many tractable results using efficacy as a performance functional, which is a small signal or local approach. Some nonlocal issues of memoryless detection are considered. We argue that the asymptotic exponential rate of decrease of error probabilities, or Bayes risk, provides the appropriate asymptotic measure of performance. A main contribution... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive buffer- instrumented entropy-coded quantizer performance for memoryless sources

    Publication Year: 1986, Page(s):9 - 22
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1528 KB)

    Variable-length codes can be used in entropy coding the outputs of an optimum entropy-constrained quantizer. Transmitting these codes over a synchronous channel; however, requires a buffer connecting the entropy coder to the channel. In a practical application, this buffer is of finite size and hence might overflow or undertow. To alleviate this difficulty, we use an adaptive scheme in which the q... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State splitting for variable-length graphs (Corresp.)

    Publication Year: 1986, Page(s):108 - 113
    Cited by:  Papers (20)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    The state splitting algorithm of Adler, Coppersmith, and Hassner for graphs with edges of fixed length is extended to graphs with edges of variable lengths. This has the potential to improve modulation code construction techniques. Although the ideas of state splitting come from dynamical systems, completely graph-theoretic terms are used. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Memoryless detection of time-varying deterministic signals in dependent non-Gaussian noise (Corresp.)

    Publication Year: 1986, Page(s):133 - 137
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    Memoryless discrete-time detection of a known time-varying signal in dependent non-Gaussian noise is considered. Optimal detectors are specified for cases where the detector nonlinearity is time-invariant and time-varying. A performance comparison is provided by way of examples. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regular universal codeword sets (Corresp.)

    Publication Year: 1986, Page(s):129 - 133
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    Proof is given that no regular or synchronizable universal codeword sets can achieve optimality. Some asymptotic properties of a remarkable class of regular codeword sets related to the Fibonacci representation of integers are also obtained. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary DPSK transmission over terrestrial and satellite links (Corresp.)

    Publication Year: 1986, Page(s):125 - 129
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    It has been observed previously that downlink noise correlation has no effect on the average error probability of a differentially phase shift keyed (DPSK) satellite system when the symbols are equiprobable. We show thai this observation holds for a satellite system exhibiting amplitude-modulation-to-amplitude-modulation (AM-AM) conversion effects and amplitude-modulation-to-phase-modulation (AM-P... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum detection of a weak signal with minimal knowledge of dependency

    Publication Year: 1986, Page(s):97 - 102
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    The optimum nonlinearity is defined for detection of a weak signal when minimal knowledge of the dependency structure of the observations is available. Specifically, it is assumed that the observations form a one-dependent strictly stationary sequence of random variables and that only a finite number of moments of the marginal density and the correlation coefficient between consecutive observation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient balanced codes

    Publication Year: 1986, Page(s):51 - 53
    Cited by:  Papers (139)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    Coding schemes in which each codeword contains equally many zeros and ones are constructed in such a way that they can be efficiently encoded and decoded. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the estimation of variance for autoregressive and moving average processes (Corresp.)

    Publication Year: 1986, Page(s):120 - 125
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    The sample variance is commonly used to estimate the variance of stationary time series. When the second-order statistics of the process are known up to a scaling factor, this estimator is generally inefficient. In the case of an autoregressive (AR) process with unknown parameters, the sample variance is shown to be asymptotically efficient. However, the sample variance of a moving-average (MA) pr... 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