IEEE Transactions on Information Theory

Issue 2 • April 1967

Filter Results

Displaying Results 1 - 25 of 49
  • Binary pulse compression codes

    Publication Year: 1967, Page(s):156 - 167
    Cited by:  Papers (61)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1452 KB)

    An analytical technique for generating good binary pulse compression codes is developed. The first step in constructing a code of a given lengthNis to divide all the residues moduloNand less thanNinto residue classes. A code digita(i)=pm 1is assigned to all members,i, of certain of these classes anda(i)=-1toNand all membe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound to the distribution of computation for sequential decoding

    Publication Year: 1967, Page(s):167 - 174
    Cited by:  Papers (82)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1243 KB)

    In sequential decoding, the number of computations which the decoder must perform to decode the received digits is a random variable. In this paper, we derive a Paretian lower bound to the distribution of this random variable. We show thatP [C > L]L^{-rho}, whereCis the number of computations which the sequential decoder must perform to decode a block ofLam... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential detection and composite hypotheses with application to a signal of uncertain amplitude

    Publication Year: 1967, Page(s):175 - 183
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1442 KB)

    The optimum sequential detector for two-hypotheses problems when both hypotheses are simple is a likelihood ratio processor in tandem with the optimum stopping rule. When one of the two hypotheses is composite, the optimum detector consists of a likelihood ratio processor, an optimum stopping rule, and an updating processor on the distributed parameters of the composite hypothesis. Discussed is a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-orthogonal quasi-cyclic codes

    Publication Year: 1967, Page(s):183 - 195
    Cited by:  Papers (84)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1981 KB)

    A new class of linear block codes, called self-orthogonal quasi-cyclic codes, is defined. It is shown that the problem of designing these codes is equivalent to the problem of designing disjoint difference sets. As a result, several classes of optimal and near-optimal codes can be constructed analytically and other codes can be found by a computer-aided search procedure. A list of codes is given f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction: Coding for a class of unknown signals

    Publication Year: 1967, Page(s): 195
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (108 KB)

    The author of the above paper, which appeared in this Transactions, vol. IT-12, pp. 189-195, April 1966, has called the following to the attention of the Editor. The symbol d should have read d(c): in the first line after (3); in the right-hand side of (4); in the first and seventh lines of the last paragraph; and on the same page, and in (8) and (11). The following definition should be inserted a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum pulse amplitude modulation--I: Transmitter-receiver design and bounds from information theory

    Publication Year: 1967, Page(s):196 - 208
    Cited by:  Papers (122)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2000 KB)

    Intersymbol interference and additive noise are two common sources of distortion in data transmission systems. For pulse amplitude modulation (PAM) communication links, the combination of transmitter waveform and linear receiver that minimizes the mean-squared error arising from these sources is determined. An extension to include the effects of timing jitter is performed in a companion paper. Per... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum pulse amplitude modulation--II: Inclusion of timing jitter

    Publication Year: 1967, Page(s):209 - 216
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1138 KB)

    A method is presented for specifying transmitter waveforms and receiver filters for pulse amplitude modulation (PAM) systems which are subject to distortion from additive noise, intersymbol interference, and timing jitter. A criterion of minimum mean-squared error is used. For the case of band-limited transmission, specific procedures are developed for computing optimum transmitters, optimum recei... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A coding theorem for a class of unknown channels

    Publication Year: 1967, Page(s):217 - 220
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (588 KB)

    We consider the problem of communication over a channel which is selected 1) in a fashion unknown to the communicator, 2) as a function of past history, 3) from a given set of discrete memoryless channels, and 4) for the purpose of maximizing the degradation in performance. An upperbound on error probability insurable with block coding is obtained which exponentially approaches zero with block len... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A binary channel characterization using partitioned Markov chains

    Publication Year: 1967, Page(s):221 - 227
    Cited by:  Papers (275)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (934 KB)

    The characterization of binary communication channels using functions of finite-state Markov chains is considered. Two distributions which are relevant to code evaluation, i.e., the error-free run and error-cluster distributions, are derived. It is shown for anN-state model, partitioned into a group ofkerror-free states andN-kerror states, that the general form of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General methods for the derivation of sampling theorems

    Publication Year: 1967, Page(s):227 - 230
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (584 KB)

    This paper presents an integral representation for the derivation of sampling expansions. The representation uses the theory of self-adjoint differential equations. Different methods of evaluating the resulting triple integral have different physical significances and yield the commonly used approaches to the derivation of sampling expansions. The first- and second-order differential operators are... 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 noiseless photon channel

    Publication Year: 1967, Page(s):230 - 236
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (971 KB)

    An expression is derived for the capacity of a noiseless photon channel as a function of bandwidth, carrier frequency, and average signal power. This expression is an extension of a formula derived by Gordon which is applicable in the limit of narrow bandwidth. By comparison of the two results, it is shown that Gordon's formula is highly accurate over a large range of bandwidth, and that significa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Arithmetic codes with large distance

    Publication Year: 1967, Page(s):237 - 242
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (947 KB)

    Arithmetic codes are error-correcting or detecting codes implemented by ordinary arithmetic operations. Arithmetic codes with large distance, and therefore, capable of multierror correction are constructed. These codes are analogous to the finite field codes corresponding to maximal recurring sequences generated by shift registers whose characteristic polynomial is a primitive polynomial. These ar... View full abstract»

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

    Publication Year: 1967, Page(s):242 - 246
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (709 KB)

    A subclass of cyclic codes of composite block lengthn=n' cdot n", withn'andn"relatively prime, is studied. It is shown how, under certain conditions, these codes may be factorized into subcodes of block lengthn'andn"and how they are related to codes of block lengthn'orn", over extension fields of the base field. The probl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The asymptotic relative efficiency of mixed statistical tests

    Publication Year: 1967, Page(s):247 - 255
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1095 KB)

    Mixed statistical tests are described. It is shown that these tests have a much higher efficiency than conventionally used statistics such as the sign test and polarity coincidence correlation without the high operational complexity of the Wilcoxon, Mann-Whitney, Kendalltau, or Fisher-Yates: Terry-Hoeffding tests. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Differentiation of Karhunen-Loève expansion and application to optimum reception of sure signals in noise

    Publication Year: 1967, Page(s):255 - 260
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (797 KB)

    The first part of this paper is concerned with differentiation of the Karhunen-Loève expansion of a stochastic process. In particular, we establish that the expansion series can be differentiated term by term while retaining the same sense of convergence, ff the covarianceR(s, t)has a continuous second partial derivative and the sample functionx(t)is almost surely differ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error bounds for convolutional codes and an asymptotically optimum decoding algorithm

    Publication Year: 1967, Page(s):260 - 269
    Cited by:  Papers (2225)  |  Patents (122)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1452 KB)

    The probability of error in decoding an optimal convolutional code transmitted over a memoryless channel is bounded from above and below as a function of the constraint length of the code. For all but pathological channels the bounds are asymptotically (exponentially) tight for rates aboveR_{0}, the computational cutoff rate of sequential decoding. As a function of constraint length the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approximate theory of prediction for data compression

    Publication Year: 1967, Page(s):274 - 278
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (636 KB)

    This paper presents results applicable to data-compression systems of the prediction-comparison type. In this type of system advantage is taken of the inherent predictability of the data. Any sample which can be predicted to within some threshold is not transmitted and the prediction is inserted in place of the actual sample in the data. This error feedback affects data predictability in a nonline... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the best finite set of linear observables for discriminating two Gaussian signals

    Publication Year: 1967, Page(s):278 - 284
    Cited by:  Papers (71)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1006 KB)

    Consider the problem of discriminating two Gaussian signals by using only a finite number of linear observables. How to choose the set of n observables to minimize the error probabilityP_{e}, is a difficult problem. BecauseH, the Hellinger integral, andH^{2}form an upper and a lower bound forP_{e}, we minimizeHinstead. We find that the set of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modified version of Price's theorem

    Publication Year: 1967, Page(s):285 - 288
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (485 KB)

    Price's theorem for zero-memory nonlinear devices with Gaussian inputs is modified to make the theorem more amenable to the analysis of functions of more than two Gaussian variates. In the general case a single ordinary differential equation for the output correlation function is derived. Several examples illustrate the applicability of the modified version. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some noises withI/fspectrum, a bridge between direct current and white noise

    Publication Year: 1967, Page(s):289 - 298
    Cited by:  Papers (161)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1607 KB)

    Noises in thin metallic fills, semiconductors, nerve tissues, and many other media, have measured spectral densities proportional tof^theta - 2}withfthe frequency andthetaa constant0 leq theta < 2. The energy of these "f^{theta-2}noises" behaves more "erratically" in time, than expected from functions subject to the Wiener-Khinchin spectral theory. Mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the optimum estimation of the spectra of certain discrete stochastic processes

    Publication Year: 1967, Page(s):298 - 304
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1022 KB)

    It is assumed that a signal consisting of a constant plus at mostNsinusoids and corrupted by noise is observed at equally spaced time intervals for a finite length of time. An optimum least-mean-square error estimate of the spectral components (i.e., the mean value and the amplitude, phase, and frequency of each sinusoidal component) of the signal is derived based on a large signal-to-n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A class of majority logic decodable codes (Corresp.)

    Publication Year: 1967, Page(s):305 - 307
    Cited by:  Papers (80)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (450 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.
  • Some additional upper bounds for fixed-weight codes of specified minimum distance

    Publication Year: 1967, Page(s):307 - 308
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (291 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.
  • An adaptive realization of the optimum receiver for a sporadically recurrent waveform in noise (Corresp.)

    Publication Year: 1967, Page(s):308 - 311
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (692 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.
  • The effect of autoregressive dependence on a nonparametric test (Corresp.)

    Publication Year: 1967, Page(s):311 - 313
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (481 KB)

    The sign test, which is nonparametric when used on independent data, is shown to lose its distribution-free property on data of the formX_{t}= varrho X_{t-1} + W_{t}, 0 < |varrho | < 1, where{W_{t}}is a sequence of independent and identically distributed random variables. Asymptotic normality of the sign-test statistic is proved in two cases. If the data{X_{t} 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