IEEE Transactions on Information Theory

Volume 37 Issue 6 • Nov 1991

Filter Results

Displaying Results 1 - 25 of 33
  • New lower bounds for asymmetric and unidirectional codes

    Publication Year: 1991, Page(s):1696 - 1704
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    New lower bounds on the sizes of asymmetric codes and unidirectional codes are presented. Various methods are used, three of them of special interest. The first is a partitioning method that is a modification of a method used to construct constant weight codes. The second is a combining codes method that is used to obtain a new code from a few others. The third method is shortening by weights that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On indecomposable Abelian codes and their vertices

    Publication Year: 1991, Page(s):1723 - 1731
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    Indecomposable nonsemisimple Abelian codes are investigated. The author describes all indecomposable Abelian group codes and shows that the minimal distance of such a code M is the product of the minimal distance of a semisimple Abelian group code and the minimal distance of the source module of M. It is illustrated that the minimal distance of every indecomposable Abelian code d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two proofs of Pinsker's conjecture concerning arbitrarily varying channels

    Publication Year: 1991, Page(s):1647 - 1649
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    M.S. Pinsker (1990) conjectured the following theorem: for an arbitrary varying channel (AVC), every rate below the random code capacity is achievable with deterministic list codes of constant list size, if the average error criterion is used. Two proofs of this theorem are given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The transient solution of time-dependent M/M/1 queues

    Publication Year: 1991, Page(s):1690 - 1696
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    The transient behavior of time-dependent M/M/1 queues is studied. The boundary probability function π0(t), which is the probability that the queue is empty at time t, is shown with analyticity arguments to satisfy a Volterra-type integral equation. The boundary integral equation is derived, and a numerical algorithm is used to solve the integral equation and to find... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations

    Publication Year: 1991, Page(s):1716 - 1723
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    The decoding capabilities of algebraic algorithms, mainly the Berlekamp-Massey algorithm, the Euclidean algorithm, and the authors' (1989) generalizations of these algorithms, are basically constrained by the minimum distance bounds of the codes. The authors introduce a more general procedure which breaks away from this restriction and which can determine the, error locations from nonrecurrent dep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The entropy theorem via coding bounds

    Publication Year: 1991, Page(s):1645 - 1647
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    The entropy theorem (also known as the Shannon-McMillan-Breiman theory or the asymptotic equipartition theorem) asserts that, for a stationary ergodic finite alphabet process, the sequence-(1/n)log p(x1n) converges almost surely to the entropy-rate H of the process. The entropy theorem has been used to establish asymptotic bounds on the per... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive estimation in mixture models with Markov regime

    Publication Year: 1991, Page(s):1683 - 1690
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    A recursive algorithm is proposed for estimation of parameters in mixture models, where the observations are governed by a hidden Markov chain. The often badly conditioned information matrix is estimated, and its inverse is incorporated into the algorithm. The performance of the algorithm is studied by simulations of a symmetric normal mixture. The algorithm seems to be stable and produce approxim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On two probabilistic decoding algorithms for binary linear codes

    Publication Year: 1991, Page(s):1707 - 1716
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    A generalization of the Sullivan inequality (1967) on the ratio of the probability of a linear code to that of any of its cosets is proved. Starting from this inequality, a sufficient condition for successful decoding of linear codes by a probabilistic method is derived. A probabilistic decoding algorithm for low-density parity-check codes is also analyzed. This method of analysis enables one to e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on repeated-root cyclic codes

    Publication Year: 1991, Page(s):1736 - 1737
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    G. Castagnoli et al. (see ibid., vol.37, no.2, p.337-42, 1991) and J.H. van Lint (see ibid., vol.37, no.2, p.343-5, 1991) analyzed cyclic codes with repeated roots. These studies fail to acknowledge a previous work by C.L. Chen (1969) which includes an analysis of even-length binary cyclic codes. Results from Chen's study are presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal classification for hidden Markov models

    Publication Year: 1991, Page(s):1586 - 1594
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    Binary hypotheses testing using empirically observed statistics is studied in the Neyman-Pearson formulation for the hidden Markov model (HMM). An asymptotically optimal decision rule is proposed and compared to the generalized likelihood ratio test (GLRT), which has been shown in earlier studies to be asymptotically optimal for simpler parametric families. The proof of the main theorem is provide... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The entropy of a randomly stopped sequence

    Publication Year: 1991, Page(s):1641 - 1644
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    A Wald-like equation is proved for the entropy of a randomly stopped sequence of independent identically distributed discrete random variables X1, X2. . ., with a nonanticipating stopping time N. The authors first define a general stopping time and the associated stopped sequence, and then present the two main theorems for the entropy of a stopped s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal sets matched to groups

    Publication Year: 1991, Page(s):1675 - 1682
    Cited by:  Papers (84)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    Recently, linear codes over ZM (the ring of integers mod M) have been presented that are matched to M -ary phase modulation. The general problem of matching signal sets to generalized linear algebraic codes is addressed based on these codes. A definition is given for the notion of matching. It is shown that any signal set in N-dimensional Euclidean sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trellis-coded vector quantization

    Publication Year: 1991, Page(s):1551 - 1566
    Cited by:  Papers (68)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1308 KB)

    Trellis-coded quantization is generalized to allow a vector reproduction alphabet. Three encoding structures are described, several encoder design rules are presented, and two design algorithms are developed. It is shown that for a stationary ergodic vector source, if the optimized trellis-coded vector quantization reproduction process is jointly stationary and ergodic with the source, then the qu... 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 subcodes of a code

    Publication Year: 1991, Page(s):1706 - 1707
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (148 KB)

    Let C be a binary linear code with covering radius R , and C0 a subcode of C of codimension i. An upper bound is obtained for the covering radius of C 0 in terms of R and i. When C 0 ={0}, the bound becomes the sphere covering bound for R View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On bit-serial multiplication and dual bases in GF(2m)

    Publication Year: 1991, Page(s):1733 - 1736
    Cited by:  Papers (10)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (348 KB)

    The existence of certain types of dual bases in finite fields GF(2 m) is discussed. These special types of dual bases are needed for efficient implementation of (generalized) bit-serial multiplication in GF(2m). In particular, the question of choosing a polynomial basis of GF(2m), for example {1, α, α 2, α3, . . ., α View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The distribution functions of certain random geometric series concerning intersymbol interference

    Publication Year: 1991, Page(s):1657 - 1662
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    The author presents some numerical methods for the calculation of the distribution functions of certain random geometric series. The semicontraction mapping approach of A. Huzii and H. Sugiyama (Electron. Commun. Jap.., vol.53-A, p.21-30, 1970) is generalized to give a convergent solution for most cases of interest. Also, initial approximations are discussed based on the moments of the distributio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cutting and stacking: a method for constructing stationary processes

    Publication Year: 1991, Page(s):1605 - 1617
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1068 KB)

    Cutting and stacking, a general method for constructing examples of stationary, ergodic, finite-alphabet processes with desired properties, is described. It has been used to construct counterexamples in ergodic theory. Recently, it has also been used to construct examples of interest in information theory and probability theory. The method builds a stationary ergodic process by describing sample p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Runlength-limited codes for mixed-error channels

    Publication Year: 1991, Page(s):1577 - 1585
    Cited by:  Papers (21)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    The mixed-error channel (MC) combines the binary symmetric channel and the peak shift channel. The construction of (d, k) constrained t-MC-error-correcting block codes is described. It is demonstrated that these codes can achieve a code rate close to the ( d, k) capacity. The encoding and decoding procedures are described. The performance of the constru... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A counterexample to a Voronoi constellation conjecture

    Publication Year: 1991, Page(s):1665 - 1666
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (148 KB)

    Voronoi constellations are of interest because it is possible to save on signal power by choosing a lattice for which the second moment of the Voronoi region is close to that of a sphere with the same dimensionality. A Voronoi constellation based on the lattice partition Λ/Λs is the set of points in some translate Λ+a that fall within the Voronoi region View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deterministic properties of analog median filters

    Publication Year: 1991, Page(s):1629 - 1640
    Cited by:  Papers (1)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    Two key deterministic properties of analog median filters are established. The first is that root signals are characterized by a special class of locally monotone functions, and the second is that the repeated application of a median filter produces a root signal which retains significant features in the original data. Both results are extensions of well known facts for discrete median filters. In... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parameter estimator based on a minimum discrepancy criterion: a Bayesian approach

    Publication Year: 1991, Page(s):1671 - 1675
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    A new estimation criterion based on the discrepancy between the estimator's error covariance and its information lower bound is proposed. This discrepancy measure criterion tries to take the information content of the observed data into account. A minimum discrepancy estimator (MDE) is then obtained under a linearity assumption. This estimator is shown to be equivalent to the maximum likelihood es... 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 direct-detection photon channel with intertransition-constrained binary input

    Publication Year: 1991, Page(s):1540 - 1550
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    The classical directed detection photon channel is modeled by an output νt (observed signal) describing the photon-arrival Poisson (count) process with intensity (rate) λt+λ0, where λt (photons/s) is the channel input (information carrying) intensity and λ0 (photons/s) is the dark current intensity. Upper and low... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On identification via multiway channels with feedback

    Publication Year: 1991, Page(s):1519 - 1526
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    For the case of complete feedback, a fairly unified theory of identification is presented. Its guiding principle is the discovery that communicators (sender and receiver) must set up a common random experiment with maximal entropy and use it as randomization for a suitable identification technique. It is shown how this can be done in a constructive manner. The proof of optimality (weak converse) i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two new binary codes obtained by shortening a generalized concatenated code

    Publication Year: 1991
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    The authors construct a [75,13,30] code and a [75,11,32] code. The minimum distances of these codes are one larger than the largest known (T. Verhoeff 1987) minimum distances of codes with the same length and dimension. As a [75,11,33] code does not exist, the [75,11,32] code is, in a sense, optimal. Both codes are obtained by judiciously shortening a [80,14,32] code that is obtained as a generali... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The number of cross-join pairs in maximum length linear sequences

    Publication Year: 1991, Page(s):1731 - 1733
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    It has been conjectured by T. Chang et al. (1990) that the number of cross-join pairs in a maximum length linear sequence equals (2n-1-1)(2n-1-2)/6. A maximum length linear sequence (an m-sequence) of length 2n-1 is a binary sequence which satisfies a linear recurrence whose characteristic polynomial is primitive of degree n. The number of primiti... 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