IEEE Transactions on Information Theory

Issue 3 • May 1988

Filter Results

Displaying Results 1 - 25 of 29
  • Comments on "A note on perfect arithmetic codes

    Publication Year: 1988, Page(s):589 - 590
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (246 KB)

    J. Astola (ibid., vol. IT-32, p.443-5, May 1986) constructed new binary perfect arithmetic codes considering the modular distance introduced by T.R.N. Rao and O.N. Garcia (1971). The commenter states that, if the modular distance defined by W.E. Clark and J.J. Liang (1973) is considered, these codes are no longer perfect.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A spectral characterization of correlation-immune combining functions

    Publication Year: 1988, Page(s):569 - 571
    Cited by:  Papers (115)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (288 KB)

    It is shown that a Boolean combining function f(x) of n variables is mth-order correlation-immune if and only if its Walsh transform F(ω) vanishes for all ω with Hamming weight between 1 and m, inclusive. This result is used to extend slightly Siegenthaler's (IEEE Trans. Comput., vol. C-34, pp. 81-85, Jan. 1985) characterization of the algeb... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A class of binary burst error-correcting quasi-cyclic codes

    Publication Year: 1988, Page(s):463 - 479
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (952 KB)

    A class of binary quasi-cyclic burst error-correcting codes based upon product codes is studied. An expression for the maximum burst error-correcting capability for each code in the class is given. In certain cases, the codes exist in the class which have the same block length and number of check bits as the Gilbert codes, but correct longer bursts of errors than Gilbert codes. By shortening the c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal simultaneous detection and estimation of filtered discrete semi-Markov chains

    Publication Year: 1988, Page(s):551 - 568
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1184 KB)

    An optimal algorithm for the detection of noisy filtered discrete semi-Markov chains is presented. Estimation of the underlying model parameters is also considered. For a given path of the discrete semi-Markov chain the optimum estimates of the model parameters obtained by the maximum likelihood method are expressed as functions of the path. These functions are then used to derive a single maximum... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A cascaded coding scheme for error control and its performance analysis

    Publication Year: 1988, Page(s):448 - 462
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (912 KB)

    A coding scheme for error control in data communication systems is investigated. The scheme is obtained by cascading two error-correcting codes, called the inner and outer codes. Its error performance is analyzed for a binary symmetric channel with a bit-error rate ε<1/2. It is shown that, if the inner and outer codes are chosen properly, high reliability can be attained even for a high-ch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mixing collision resolution algorithms exploiting information of successful messages

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

    Algorithms for accessing a slotted-time collision-type broadcast are considered under a Poisson infinite-user model, where each user observes the channel and determines for each slot whether idle or success or collision has occurred. The highest throughput previously achieved for this model is 0.4878. A new scheme is introduced which does not exceed the limitations of the system model, yet achieve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fused trees and some new approaches to source coding

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

    The concept of fusion partition for the node set of a tree, and the concept of a fused tree corresponding to it, are discussed. A fused tree requires, in principle, significantly less memory for storage than the original tree yet allows the recovery of the original. Hence, it makes sense to store a tree in a fused form. Furthermore, if labels from an ordered set C are assigned to the bran... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detector design using a density fit to non-Gaussian noise

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

    Suboptimal nonlinear detectors for known small signals in non-Gaussian noise are investigated. It is assumed that either the locally optimal nonlinearity is too complex to use or that the noise density is not known precisely. A memoryless suboptimal nonlinearity (ZNL) can be chosen, and the family of densities for which it is optimal is found. A member of this family is then fitted to the observed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sphere-packing upper bounds on the free distance of trellis codes

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

    Sphere-packing arguments are used to develop upper bounds on the free distance of trellis codes. A general bounding procedure is presented. Sphere packing bounds, including bounds on the density of infinite regions, packings for hypercubes, and packings on the surface of a unit sphere, are then used to produce bounds for a wide variety of trellis codes. Among the applications are convolutional cod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Neural networks, orientations of the hypercube, and algebraic threshold functions

    Publication Year: 1988, Page(s):523 - 530
    Cited by:  Papers (49)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (728 KB)

    A class of possible generalizations of current neural networks models is described using local improvement algorithms and orientations of graphs. A notation of dynamical capacity is defined and, by computing bounds on the number of algebraic threshold functions, it is proven that for neural networks of size n and energy function of degree d, this capacity is O(nd+1<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-memory-processor trade-offs

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

    It is demonstrated that usual time-memory trade-offs offer no asymptotic advantage over exhaustive search. Instead, trade-offs between time, memory, and parallel processing are proposed. Using this approach it is shown that most searching problems allow a trade-off between C s, the cost per solution, and Cm, the cost of the machine: doubling Cm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Delta codes for line drawings

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

    A new class of chain codes for line drawings, named delta codes is introduced. Two specific types of fixed angle delta codes and ring delta codes are described. The area-of-error distortion and rate are calculated for two types of delta codes applied to straight and slowly curving lines, and it is shown that the delta outperforms other chain codes with the same set of link types. For rapidly curvi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity of the discrete-time Gaussian channel with intersymbol interference

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

    The discrete-time Gaussian channel with intersymbol interference (ISI) where the inputs are subject to a per symbol average-energy constraint is considered. The capacity of this channel is derived by means of a hypothetical channel model called the N-circular Gaussian channel (NCGC), whose capacity is readily derived using the theory of the discrete Fourier transform. The results obtained... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On PPM sequences with good autocorrelation properties

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

    The problem of designing sequences of Q-ary pulse-position-modulation (PPM) symbols that have good periodic autocorrelation properties is investigated. Two cases are considered. In the first it is assumed that only slot synchronization is present and thus cyclic shifts are one slot at a time; in the second PPM symbol synchronization is present, in which case cyclic shifts are by one symbol (Q slot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iteratively maximum likelihood decodable spherical codes and a method for their construction

    Publication Year: 1988, Page(s):480 - 485
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (420 KB)

    The authors propose a class of spherical codes which can be easily decoded by an efficient iterative maximum likelihood decoding algorithm. A necessary and sufficient condition for a spherical code to be iteratively maximum likelihood decodable is formulated. A systematic construction method for such codes based on shrinking of Voronoi corners is analyzed. The base code used for construction is th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of baseband signals using a delta modulator

    Publication Year: 1988, Page(s):537 - 543
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (408 KB)

    The performance of a digital delta modulator when used as a repeater for binary non-return-to-zero signals between a noisy channel and an error-free link is analyzed. A Markov chain is used to model the accumulator output (observation process) of the device, and a Bayes test with a probability of error criterion is formulated to evaluate its performance in additive band-limited Gaussian channel no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Baseband trellis codes with a spectral null at zero

    Publication Year: 1988, Page(s):425 - 434
    Cited by:  Papers (26)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (680 KB)

    A method is described for modifying classical N-dimensional trellis codes to provide baseband codes that combine a spectral null at DC with significant coding gain. The information rate of the classical code is decreased by one bit, and this extra redundancy is used to keep the running digital sum bounded. Equivalently, if the rate is held constant, then twice as many signal points are ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vector sets for exhaustive testing of logic circuits

    Publication Year: 1988, Page(s):513 - 522
    Cited by:  Papers (92)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (716 KB)

    (L, d)-universal sets are useful for exhaustively testing logic circuits with a large number of functional components, designed so that every functional component depends on at most d inputs. Randomized and deterministic constructions of ( L, d)-universal test sets are presented, and lower and upper bounds on the optimal sizes of such sets are proven. I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the covering radius of binary [14, 6] codes containing the all-one vector

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

    It is shown that the covering radius of any binary linear [14, 6] code containing the all-one vector is at least 4. Since the minimum covering radius of a binary linear [14, 6] code is 3, this shows that in general the minimum of the covering radius is not achieved by codes containing the all-one vector View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achievable rates for a constrained Gaussian channel

    Publication Year: 1988, Page(s):365 - 370
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (308 KB)

    The authors obtained lower bounds to the capacity of the continuous-time filtered additive Gaussian noise channel with two-valued inputs. Essentially, the problem reduces to the continuous-time peak-limited case, which remains an unsolved problem of primary importance in communication theory View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discrimination, signal detection, and estimation for Weibull-type Poisson processes

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

    Discrimination, signal detection, and estimation in the context of Weibull-type nonhomogeneous Poisson processes are considered for four different sampling plans: Type I and Type II censoring and same-shape and equal-distance sampling. Procedures based on likelihood functions and on extensions of the Kolmogorov-Smirnov statistic are developed. The results are pertinent to signal detection problems... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the [24, 12, 10] quaternary code and binary codes with an automorphism having two cycles

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

    A general decomposition theorem is given for codes over finite fields which have an automorphism of a given type. Such codes can be decomposed as direct sums of subcodes which may be viewed as shorter length codes over extension fields. If such a code is self-dual, sometimes the subcodes are also. This decomposition is applied to prove that the self-dual [24, 12, 10] quaternary code has no automor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Encoding and decoding of BCH codes using light and short codewords

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

    It is shown that every q-ary primitive Bose-Chaudhuri-Hocquenghen code of designed distance δ and sufficiently large length n contains a codeword c0 of weight w=O(δ) and degree deg( c0)=o(n). Here, the standard asymptotic notation O(δ) is used for a function f(δ) bounded a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On information transfer by envelope-constrained signals over the AWGN channel

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

    Using T.E. Duncan's theorem (1970) on the relation between mutual information and the mean-square error of the optimum causal estimator of a random signal in additive white Gaussian noise (AWGN), the maximum achievable information transfer over the AWGN channel is derived with the random telegraph wave input. The information transfer is bounded and symptotically determined for the Wiener phase-mod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An application of the theory of equivalence of Gaussian measures to a prediction problem

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

    An extension of a general theorem by J.A. Bucklew (ibid., vol. IT-31, 677-679, 1985) on the asymptotic optimality of a linear predictor based on an incorrect covariance function is given. The result is applied to the problem of predicting a small time lag into the future to obtain an easily verifiable condition under which the Taylor series predictor given by Bucklew is nearly optimal. The critica... 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