IEEE Transactions on Information Theory

Volume 34 Issue 1 • Jan. 1988

Filter Results

Displaying Results 1 - 23 of 23
  • Sliding-block coding for input-restricted channels

    Publication Year: 1988, Page(s):2 - 26
    Cited by:  Papers (42)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2279 KB)

    Work on coding arbitrary sequences into a constrained system of sequences (called a sofic system) is presented. Such systems model the input constraints for input-restricted channels (e.g., run-length limits and spectral constraints for the magnetic recording channel). In this context it is important that the code be noncatastrophic to ensure that the decoder has limited error propagation. A const... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Arbitrarily varying channels with constrained inputs and states

    Publication Year: 1988, Page(s):27 - 34
    Cited by:  Papers (50)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    Random coding theorems are proved for discrete memoryless arbitrarily varying channels (AVCs) with constraints on the transmitted codewords and channel state sequences. Two types of constraints are considered: peak (i.e. required for each n-length sequence almost surely) and average (over the message set or over an ensemble). For peak constraints on the codewords and on the channel state sequences... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Totally asynchronous Slepian-Wolf data compression

    Publication Year: 1988, Page(s):35 - 44
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (802 KB)

    It is proved that the Slepian-Wolf data compression theorem still holds when both encoders are operating totally asynchronously. In addition it is shown that in this case the Wyner-Ahlswede-Korner source-coding theorem holds.<<ETX>> View full abstract»

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

    Publication Year: 1988, Page(s):45 - 54
    Cited by:  Papers (94)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (697 KB)

    Several results on binary (d, k) codes are given. First, a novel derivation for the capacity of these codes based on information-theoretic principles is given. Based on this result the spectrum of a (d, k) code is computed. Finally, the problem of computing the capacity of the binary symmetric channel under the condition that the input sequences satisfy the (d, k) constraint is considered. Lower b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An upper bound on the cutoff rate of sequential decoding

    Publication Year: 1988, Page(s):55 - 63
    Cited by:  Papers (18)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (770 KB)

    An upper bound is given on the cutoff rate of discrete memoryless channels. This upper bound, which coincides with a known lower bound, determines the cutoff rate, and settles a long-standing open problem.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Syndrome and transition count are uncorrelated (logic circuit testing)

    Publication Year: 1988, Page(s):64 - 69
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (453 KB)

    In the testing of logic circuits, two proposed data-compression methods use the number of ones (syndrome) and the number of sequence changes (transition count). An enumeration N(m, k, t) of the number of length-m binary sequences having syndrome value k and transition count t is developed. Examination of this result reveals that the parallel compression of these two methods has small overlap in er... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the computation of the performance probabilities for block codes with a bounded-distance decoding rule

    Publication Year: 1988, Page(s):70 - 78
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (765 KB)

    When a block code is used on a discrete memoryless channel with an incomplete decoding rule that is based on a generalized distance, the probability of decoding failure, the probability of erroneous decoding, and the expected number of symbol decoding errors can be expressed in terms of the generalized weight enumerator polynomials of the code. For the symmetric erasure channel, numerically stable... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of linear receivers for data communication signals

    Publication Year: 1988, Page(s):79 - 92
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1228 KB)

    The optimization of receivers constrained to consist of a (linear) filter and level slicer is considered for general data communication signals in additive white Gaussian noise. Special consideration is given to the two limiting cases of arbitrarily low and high signal-to-noise ratios (SNRs). The low-SNR case results in an average matched filter receiver; the high-SNR filter is shown to be the sol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modulatable orthogonal sequences and their application to SSMA systems

    Publication Year: 1988, Page(s):93 - 100
    Cited by:  Papers (74)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (573 KB)

    A set of N-1 orthogonal sequences of period N/sup 2/ is proposed, where N is a natural number. Each orthogonal sequence proposed can be modulated by N complex numbers of absolute value 1, so the modulated sequence is also orthogonal. When N is an odd prime number, the absolute value of the cross-correlation function between any two of the N-1 orthogonal sequences is constant and satisfies the math... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conflict multiplicity estimation and batch resolution algorithms

    Publication Year: 1988, Page(s):101 - 110
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (923 KB)

    The standard model of a multiple-access channel with ternary feedback is considered. When packets of a batch of k nodes initially collide, it is assumed that no a priori statistical information about k is available. An algorithm is presented and analyzed that enables the nodes to compute a statistical estimate of k. Combining the estimation procedure with tree algorithms leads to batch-resolution ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating random integrals from noisy observations: sampling designs and their performance

    Publication Year: 1988, Page(s):111 - 127
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1203 KB)

    The problem of estimating a weighted average of a random process from noisy observations at a finite number of sampling points is considered. The performance of sampling designs with optimal or suboptimal, but easily computable, estimator coefficients is studied. Several examples and special cases are studied, including additive independent noise, nonlinear distortion with noise, and quantization ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Balancing sets of vectors

    Publication Year: 1988, Page(s):128 - 130
    Cited by:  Papers (40)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (363 KB)

    For n>0, d>or=0, n identical to d (mod 2), let K(n, d) denote the minimal cardinality of a family V of +or-1 vectors of dimension n, such that for any +or-1 vector w of dimension n there is a v in V such that mod v-w mod <or=d, where v-w is the usual scalar product of v and w. A generalization of a simple construction due to D.E. Knuth (1986) shows that K(n, d)<or=(n/(d+1)). A linear a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some characterizations of the directed divergence using cyclic symmetry

    Publication Year: 1988, Page(s):130 - 134
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (501 KB)

    An axiomatic characterization of the directed divergence based on a weak condition of cyclic symmetry is given.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the entropy series

    Publication Year: 1988, Page(s):134 - 138
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (402 KB)

    Upper bounds on the entropy of a countable integer-valued random variable are furnished in terms of the expectation of the logarithm function. In particular, an upper bound is derived that is sharper than that of P. Elias (ibid., vol.IT-21, no.2, p.194-203, 1975), for all values of E/sub p/(log). Bounds that are better only for large values of E/sub p/ than the previous known upper bounds are also... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A (16, 9, 6, 5, 4) error-correcting DC free block code

    Publication Year: 1988, Page(s):138 - 141
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (425 KB)

    A (2n, k, l, c, d) DC free binary block code is a code of length 2n, constant weight n, 2/sup k/ codewords, maximum runlength of a symbol l, maximum accumulated charge c, and minimum distance d. The purpose of this code is to achieve DC freeness and error correction at the same time. The goal is to keep the rate k/2n and d large and l and c small. Of course, these are conflicting goals. H.C. Ferre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coset correlation of m-sequences

    Publication Year: 1988, Page(s):141 - 143
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (258 KB)

    It is well-known that there exists a unique shift l of the m-sequence S(k) such that the value of S/sub 0/(k)=S(k+l) is only determined by the cyclotomic coset to which k belongs. A measure called the 'coset correlation' is introduced. It is proven that the shift l can be determined by the coset correlation.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • N-shift cross-orthogonal sequences

    Publication Year: 1988, Page(s):143 - 146
    Cited by:  Papers (237)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (371 KB)

    N-shift cross-orthogonal sequences and a complete complementary code derived from them are defined and discussed. A general method for generating this code is also discussed. A synchronous multiple-user spread-spectrum multiple system is proposed that uses N-shift cross-orthogonal sequences.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Frequency-hopping code sequence designs having large linear span

    Publication Year: 1988, Page(s):146 - 151
    Cited by:  Papers (74)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    In frequency-hopping spread-spectrum multiple-access communication systems, it is desirable to use sets of hopping patterns that, in addition to having good Hamming correlation properties and large period, are also derived from sequences having large linear span. Here, two such frequency hopping code sequence designs that are based on generalized bent functions and generalized bent sequences are p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Number of degrees of freedom, correlation times, and equivalent bandwidths of a random process

    Publication Year: 1988, Page(s):151 - 155
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (470 KB)

    New definitions for the number of degrees of freedom (NDF) of a stationary process are proposed and their general form derived for Gaussian processes. Correlation times and equivalent bandwidths, which have been important in random processes and some fields in physics, are deduced from the first-order and second-order NDF and studied.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representations for multivariate reciprocal Gaussian processes

    Publication Year: 1988, Page(s):155 - 157
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    Multivariate reciprocal Gaussian processes are represented as a sum of two independent processes: a piecewise Markov process, which is also represented in terms of a Wiener-type process, and a time-dependent linear transformation of a normally distributed random vector. This result is then applied to the first-passage time problem.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonstationary noise effects in the Abel inversion

    Publication Year: 1988, Page(s):158 - 161
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    A method for calculating the autocorrelation function of the output noise resulting from the Abel inversion of a wide-sense stationary random process is presented. An internal formula that expresses the autocorrelation in terms of the power spectral density of the input noise and explicitly as a function of radial position is derived. Asymptotic approximations for the variance are found for the ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Determination of the merit factor of Legendre sequences

    Publication Year: 1988, Page(s):161 - 164
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (294 KB)

    M.J.E. Golay (ibid., vol.IT-23, no.1, p.43-51, 1977) has used the ergodicity postulate to calculate that the merit factor F of a Legendre sequence offset by a fraction f of its length has an asymptotic value given by 1/F=(2/3)-4 mod f mod +8f/sup 2/, mod f mod <or=1/2, which gives F=6 for mod f mod =1/4. Here this is proved without using the ergodicity postulate.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds for the size of radar arrays

    Publication Year: 1988, Page(s):164 - 167
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    Improved upper and lower bounds for the size of radar arrays are presented.<<ETX>> 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