By Topic

IEEE Transactions on Information Theory

Issue 5 • September 1979

Filter Results

Displaying Results 1 - 20 of 20
  • The source coding theorem revisited: A combinatorial approach

    Publication Year: 1979, Page(s):544 - 548
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (738 KB)

    A combinatorial approach is proposed for proving the classical source coding theorems for a finite memoryless stationary source (giving achievable rates and the error probability exponent). This approach provides a sound heuristic justification for the widespread appearence of entropy and divergence (Kullback's discrimination) in source coding. The results are based on the notion of composition cl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Higher-dimensional Hadamard matrices

    Publication Year: 1979, Page(s):566 - 572
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1056 KB)

    The concept of a Hadamard matrix as a binary orthogonal matrix is extended to higher dimensions. Ann-dimensional Hadamard matrix[h_{ijk cdots n}]is defined as one in which all parallel(n - 1)-dimensional layers, in any axis-normal orientation, are uncorrelated. This is equivalent to the requirements thath_{ijk cdots n} = pm1and thatsum_{p} sum_{q} s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity theorems for the relay channel

    Publication Year: 1979, Page(s):572 - 584
    Cited by:  Papers (2583)  |  Patents (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1730 KB)

    A relay channel consists of an inputx_{l}, a relay outputy_{1}, a channel outputy, and a relay senderx_{2}(whose transmission is allowed to depend on the past symbolsy_{1}. The dependence of the received symbols upon the inputs is given byp(y,y_{1}|x_{1},x_{2}). The channel is assumed to be memoryless. In this paper the following ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational moments for sequential decoding of convolutional codes

    Publication Year: 1979, Page(s):584 - 591
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (935 KB)

    The long standing conjecture is established that, for a discrete memoryless channel, there exists a linear convolutional code with infinite constraint length such that therhoth(rho geq 1)moment of the number ofF-hypotheses in the Fano sequential decoding algorithm is bounded, provided that the transmission rateRis less thanE_{0}( rho,r)/ rho, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of weak signals in narrowband non-Gaussian noise

    Publication Year: 1979, Page(s):592 - 600
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1162 KB)

    A class of nonlinear receiver structures is described for the detection of weak signals in non-Gaussian narrowband noise. In particular, the concept of a locally optimum receiver structure is extended to the ease of narrowband signal and noise models. A useful class of non-Gaussian narrowband noise models is developed for which the locally optimum receiver implementation is explicitly determined. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distribution-free performance bounds for potential function rules

    Publication Year: 1979, Page(s):601 - 604
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (430 KB)

    In the discrimination problem the random variabletheta, known to take values in{1, cdots ,M}, is estimated from the random vectorX. All that is known about the joint distribution of(X, theta)is that which can be inferred from a sample(X_{1}, theta_{1}), cdots ,(X_{n}, theta_{n})of sizendrawn from that distribution. A discrimination ... View full abstract»

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

    Publication Year: 1979, Page(s):609 - 612
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (743 KB)

    It is known that extended Goppa cedes are invariant under the group of transformationsZ rightarrow (A Z + B ) / ( CZ + D ), withA D + BC neq 0. This invariance is used here to classify cubic and quartic irreducible Goppa codes and to investigate their symmetry groups. A computer has been used to determine the actual group of the codes of length 33 (for cubics and quarries). I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The average number of weighings to locate a counterfeit coin (Corresp.)

    Publication Year: 1979, Page(s):616 - 617
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (353 KB)

    A solution is obtained to the problem of finding the minimum of the average number of weighings, using a balance, needed to locate one light coin from amongncoins of whichn - 1are genuine and of the same weight. Optimal strategies are determined, and the anomaly that it may be better to work withn + 1coins rather thannis examined and explained. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The weighted nearest neighbor rule for class dependent sample sizes (Corresp.)

    Publication Year: 1979, Page(s):617 - 619
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    The nearest neighbor rule is considered for data samples obtained by selectingN_{i}independent samples with the conditional distribution corresponding to classC_{i}. It is shown that a weighted distance rule can The nearest neighbor nde is considered for data samples obtained by selectingN_{i}independent samples with the conditional distribution corresponding to cl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to 'Kalman Filtering in Two Dimensions'

    Publication Year: 1979, Page(s):628 - 629
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (257 KB)

    In the above paper,^{1}the two-dimensional (2-D) reduced update Kalman filter was introduced as an optimal approximation to the 2-D Kalman filter for scalar observations obtained from a raster scan. The reduced update filter consists of two parts: a prediction part and a reduced update part, i.e., an update of View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Review of 'Digital Image Processing' (Gonzalez, R. C., and Wintz, P.; 1977)

    Publication Year: 1979, Page(s):630 - 631
    Request permission for commercial reuse | PDF file iconPDF (336 KB)
    Freely Available from IEEE
  • Tree algorithms for packet broadcast channels

    Publication Year: 1979, Page(s):505 - 515
    Cited by:  Papers (555)  |  Patents (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1472 KB)

    The multiaccessing of a broadcast communication channel by independent sources is considered. Previous accessing techniques suffer from long message delays, low throughput, and/or congestion instabilities. A new class of high-speed, high-throughput, stable, multiaccessing algorithms is presented. Contentions resolving tree algorithms are introduced, and they are analyzed for specific probabilistic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantization schemes for bivariate Gaussian random variables

    Publication Year: 1979, Page(s):537 - 543
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    The problem of quantizing two-dimensional Gaussian random variables is considered. It is shown that, for all but a finite number of cases, a polar representation gives a smaller mean square quantization error than a Cartesian representation. Applications of the results to a transform coding scheme known as spectral phase coding are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the algorithmic foundation of information theory

    Publication Year: 1979, Page(s):557 - 566
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1616 KB)

    The information content of binary sequences is defined by minimal program complexity measures and is related to computable martingales. The equivalence of the complexity approach and the martingale approach after restriction to effective random tests is used to establish generalized source coding theorems and converses. Finite state complexity and decomposable martingales are related to classical ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Access-control disciplines for multi-access communication channels: Reservation and TDMA schemes

    Publication Year: 1979, Page(s):516 - 536
    Cited by:  Papers (78)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3416 KB)

    Reservation and TDMA schemes are studied for governing the access-control discipline for a network of terminals communicating through a multi-access broadcast channel. A single repeater is employed to allow a fully connected network structure. A channel can be characterized as inducing a Iow propagation-delay value, as for terrestrial radio or fine networks, or as being associated with a higher pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the strong information singularity of certain stationary processes (Corresp.)

    Publication Year: 1979, Page(s):605 - 609
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    In an exploratory paper, T. Berger studied discrete random processes which generate information slower than linearly with time. One of his objectives was to provide a physically meaningful definition of a deterministic process, and to this end he introduced the notion of strong information singularity. His work is supplemented by demonstrating that a large class of convariance stationary processes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal source coding of finite alphabet sources via composition classes

    Publication Year: 1979, Page(s):549 - 557
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1384 KB)

    The universal source coding theorem for stationary sources states that, by using a preselected code with sufficiently large block length, any stationary source can be encoded arbitrarily close to the optimum performance theoretically attainable for the source. The code construction typically used to prove this theorem offers no performance guarantees for nonstationary sources. A code construction ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum linear coding in continuous-time communication systems with noisy side information at the decoder (Corresp.)

    Publication Year: 1979, Page(s):612 - 616
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    The problem of optimal coding in a communication system with a noiseless feedback link and with noisy side information at the decoder is treated. The message is taken as a Gaussian random variable and both the main and the side channels are assumed to be continuous white-Gaussian. A linear encoding-decoding scheme is developed which attains the well-known performance bounds for the special cases o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Point process estimators of Gaussian optical field intensities (Corresp.)

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

    A remarkably simple stochastic equation of evolution for approximately minimum mean square error estimates of the intensity of a Gaussian optical field is obtained, and its performance experimentally demonstrated. The estimator is based on observations of individual photoelectron occurrence times. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of a coherent quantum signal in thermal noise (Corresp.)

    Publication Year: 1979, Page(s):624 - 628
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    Methods are presented for calculating the minimum attainable probability of error in detecting a coherent quantum signal received amid thermal noise in the limits of Iow and high signal-to-noise ratio. In the latter limit, quantum-mechanical perturbation theory is applied to solving the detection operator equation approximately. Graphical results are furnished for binary signals transmitted with e... 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