By Topic

IEEE Transactions on Information Theory

Issue 2 • Date March 1988

Filter Results

Displaying Results 1 - 25 of 27
  • Capacity and cutoff rate calculations for a concatenated coding system

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

    A model is developed for a concatenated coding system, and from it the overall channel cutoff rate and capacity is found using random coding arguments. The effects of interleaving between the inner and outer codes and of the availability of side information to the outer decoder are considered. The performance of several specific concatenated coding systems is calculated and used for comparison wit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the existence of optimum cyclic burst correcting codes over GF( q)

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

    A cyclic b-burst correcting code over GF(q) of redundancy r and length n=(qr-b+1-1)/(q-1) is said to be optimum. It is proved that a necessary condition for the existence of such a code is the existence of a square-free polynomial in GF(q)[x] of degree b-1 which is not divisible by x such that its ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for linear block code

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

    For a linear block code it is shown how the number of computations needed for the determination of an optimal encoder/decoder pair can be reduced by using the code's automorphism group. Furthermore, it is shown that the use of an unequal-error-protection-optical generator matrix and a minimum-weight coset leader decoder is suboptimal for a q-ary symmetry channel, but their determination n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding parity in a simple broadcast network

    Publication Year: 1988, Page(s):176 - 180
    Cited by:  Papers (55)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    A broadcast network of N+1 nodes is considered in which each binary digit transmitted by each node is received by every other node via a binary symmetric channel of given transition probability. The errors on these channels are independent over transmitters, receivers and time. Each node has a binary state, and the problem is to construct a distributed algorithm to find the parity of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general class of lower bounds in parameter estimation

    Publication Year: 1988, Page(s):338 - 342
    Cited by:  Papers (74)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    A general class of Bayesian lower bounds on moments of the error in parameter estimation is formulated, and it is shown that the Cramer-Rao, the Bhattacharyya, the Bobrovsky-Zakai, and the Weiss-Weinstein lower bounds are special cases in the class. The bounds can be applied to the estimation of vector parameters and any given function of the parameters. The extension of these bounds to multiple p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random access communication and graph entropy

    Publication Year: 1988, Page(s):312 - 314
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    A probabilistic problem that arises for conflict resolution in random-access communication is treated. An earlier conjecture is disproved and a technique for finding lower bounds on the number of graphs of given structure needed to cover all edges of a given graph is developed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The capacity of the arbitrarily varying channel revisited: positivity, constraints

    Publication Year: 1988, Page(s):181 - 193
    Cited by:  Papers (99)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (960 KB)

    A well-known result of R. Ahlswede (1970) asserts that the deterministic code capacity of an arbitrarily varying channel (AVC), under the average-error-probability criterion, either equals its random code capacity or else is zero. A necessary and sufficient condition is identified for deciding between these alternative, namely, the capacity is zero if and only if the AVC is symmetrizable. The capa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fixed-length strategies for the binary multiplying channel

    Publication Year: 1988, Page(s):314 - 318
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    An achievable rate region for the binary multiplying channel is established such that block codes exist at all rate pairs within this region, with error probability that decreases exponentially with increasing block length. The result are generalized to asymmetrical rate pair View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable computation by formulas in the presence of noise

    Publication Year: 1988, Page(s):194 - 197
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    It is shown that if formulas are used to compute Boolean functions in the presence of randomly occurring failures then: (1) there is a limit strictly less than 1/2 to the failure probability per gate that can be tolerated, and (2) formulas that tolerate failures must be deeper (and, therefore, compute more slowly) than those that do not. The heart of the proof is an information-theoretic argument ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new geometric capacity characterization of a discrete memoryless channel

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

    A novel geometrical characterization of the capacity of a discrete memoryless channel is proposed. It is based on Csiszar's theorem, which represents the capacity using the Kullback-Leibler discrimination information. A new geometrical capacity computing method is obtained View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the extreme eigenvalues of positive-definite Toeplitz matrices

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

    Easily computable bounds on the extreme eigenvalues of positive semidefinite (PSD) Toeplitz matrices are presented. The bounds are especially suitable for matrices of relatively small dimension. The bounds are derived for the wider class of PSD Hermitian matrices and interpreted via the Levinson-Durbin Algorithm for Toeplitz matrices. As a by-product of this derivation an order-recursive algorithm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relations between Belini-Tartara, Chazan-Zakai-Ziv, and Wax-Ziv lower bounds

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

    A class of lower bounds on the mean-square error in parameter estimation is presented that are based on the Belini-Tartara lower bound (1974). The Wax-Ziv lower bound (1977) is shown to be a special case in the class. These bounds often are significantly tighter than the Chazan-Zakai-Ziv lower bound (1975) when the parameter to be estimated is subject to ambiguity and threshold effects View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized two-threshold detection procedure

    Publication Year: 1988, Page(s):347 - 352
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    A modified sequential procedure for testing binary hypotheses with different means, proposed by C.C. Lee and J.B. Thomas (ibid., vol.IT-30, no.1, p.16-23, Jan. 1984), is generalized for application to the case of multiple hypotheses with different means/variances of the Gaussian distribution. The method constitutes a two-threshold test for fixed-size packages of samples with a sequential procedure... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation via compressed information

    Publication Year: 1988, Page(s):198 - 211
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    Some results from classical estimation theory are extended to the case in which data must be communicated from several places where observations are made to the place where the estimate is generated. Particular emphasis is placed on determining how the variance of an unbiased estimator depends on the communication rates. Explicit result are given for Gaussian sources View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On classification with empirically observed statistics and universal data compression

    Publication Year: 1988, Page(s):278 - 286
    Cited by:  Papers (57)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    Classification with empirically observed statistics is studied for finite alphabet sources. Efficient universal discriminant functions are described and shown to be related to universal data compression. It is demonstrated that if one of the probability measure of the two classes is not known, it is still possible to define a universal discrimination function which performs as the optimal (likelih... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spread ambiguity functions

    Publication Year: 1988, Page(s):343 - 347
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    A generalized spread ambiguity function is defined, and its relationship to P.M. Woodward's (1953) ambiguity function for different models is developed. A derivation and discussion of the properties of the spread ambiguity function are presented. It is shown that smoothing the ambiguity function by the scattering function of the channel does not alter the properties of the ambiguity function. Meas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved sphere bounds on the covering radius of codes

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

    The sphere bound is a trivial lower bound on K(n,R), the minimal cardinality of any binary code of length n and with covering radius R. By simple arguments it is considerably improved, to K(n,1)⩾2 n/n for n even. A table of lower and upper bounds on K(n,R) for n⩽3... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combined coding and modulation: theory and applications

    Publication Year: 1988, Page(s):223 - 236
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1028 KB)

    The theoretical aspects of the encoding process are investigated, resulting in a precise definition of linear codes together with theorems that clarify how they can be obtained. A particular subset of linear codes, called superlinear codes, for which the performance analysis is highly simplified is identified. The most relevant performance measures for the analysis of this class of codes are discu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Almost asymptotically optimal flag encoding of the integers

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

    A simple prefix-free encoding scheme for the positive integers is proposed in which a flag of f zeros is used to mark the end of a codeword, and bit stuffing is used to prevent premature appearance of the flag in the conventional binary coding of the integers. It is shown that this coding scheme is universal in the sense defined by P. Elias (1975) and that for large f its asympto... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal linear-quadratic systems for detection and estimation

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

    The problem of linear-quadratic systems for detection has long been solved by assuming the deflection criterion and Gaussian noise. It is shown here that the Gaussian assumption can be removed, and a complete solution is presented for an arbitrary probability distribution with finite fourth-order moments. The optimal solution can always be obtained by solving a linear system of equations. Some pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A decomposition approach to CPM

    Publication Year: 1988, Page(s):260 - 270
    Cited by:  Papers (286)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    It is shown that any continuous-phase-modulation (CPM) system can be decomposed into a continuous-phase encoder and a memoryless modulator in such a way that the former is a linear (modulo some integer P) time-invariant sequential circuit and the latter is also time invariant. This decomposition is exploited to obtain alternative realizations of the continuous-phase encoder (and hence of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Poisson models and mean-squared error for correlator estimator of time delay

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

    A method for modeling large errors in correlation-based time-delay estimation is developed in terms of level-crossing probabilities. The level-crossing interpretation for peak ambiguity leads directly to an exact expression for the probability of large error involving the hazard function associated with the level-crossing process. Two models for the distribution of the error over the level-crossin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the size of optimal difference triangle sets

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

    Applications of difference triangle sets are briefly described. New lower and upper bounds on the size of optimal difference triangle sets are given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential decoding for multiple access channels

    Publication Year: 1988, Page(s):246 - 259
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1024 KB)

    The use of sequential decoding in multiple access channels is considered. The Fano metric, which achieves all achievable rates in the one-user case, fails to do so in the multiuser case. A new metric is introduced and an inner bound is given to it achievable rate region. This inner bound region is large enough to encourage the use of sequential decoding in practice. The new metric is optimal, in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity of channels with block memory

    Publication Year: 1988, Page(s):322 - 324
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    The capacity of channels with block memory is investigated. It is shown that, when the problem is modeled as a game-theoretic problem, the optimum coding and noise distributions when block memory is permitted are independent from symbol to symbol within a block. Optimal jamming strategies are also independent from symbol to symbol within a block 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
Frank R. Kschischang

Department of Electrical and Computer Engineering