Scheduled System Maintenance
On Tuesday, May 22, IEEE Xplore will undergo scheduled maintenance. Single article sales and account management will be unavailable
from 6:00am–5:00pm ET. There may be intermittent impact on performance from noon–6:00pm ET.
We apologize for the inconvenience.

IEEE Transactions on Information Theory

Volume 42 Issue 2 • March 1996

Filter Results

Displaying Results 1 - 25 of 37
  • Algebraic Function Fields and Codes [Book Reviews]

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (402 KB)
    Freely Available from IEEE
  • Universal portfolios with side information

    Publication Year: 1996, Page(s):348 - 363
    Cited by:  Papers (117)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1228 KB)

    We present a sequential investment algorithm, the μ-weighted universal portfolio with side information, which achieves, to first order in the exponent, the same wealth as the best side-information dependent investment strategy (the best state-constant rebalanced portfolio) determined in hindsight from observed market and side-information outcomes. This is an individual sequence result which sho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification with finite memory

    Publication Year: 1996, Page(s):337 - 347
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    Consider the following situation. A device called a classifier observes a probability law P on l-vectors from an alphabet of size A. Its task is to observe a second probability law Q and decide whether P≡Q or P and Q are sufficiently different according to some appropriate criterion. If the classifier has available an unlimited memory (so that it can remember P(z) exactly for all z), this is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the cost of finite block length in quantizing unbounded memoryless sources

    Publication Year: 1996, Page(s):480 - 487
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The problem of fixed-rate block quantization of an unbounded real memoryless source is studied. It is proved that if the source has a finite sixth moment, then there exists a sequence of quantizers Qn of increasing dimension n and fixed rate R such that the mean squared distortion Δ(Qn) is bounded as Δ(Qn )⩽D(R)+O(√(log n/n)), where D(R) is t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time discretization of continuous-time filters and smoothers for HMM parameter estimation

    Publication Year: 1996, Page(s):593 - 605
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (980 KB)

    In this paper we propose algorithms for parameter estimation of fast-sampled homogeneous Markov chains observed in white Gaussian noise. Our algorithms are obtained by the robust discretization of stochastic differential equations involved in the estimation of continuous-time hidden Markov models (HMM's) via the EM algorithm. We present two algorithms: the first is based on the robust discretizati... View full abstract»

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

    Publication Year: 1996, Page(s):641 - 649
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    We first consider repeated-root cyclic codes, i.e., cyclic codes whose block length is divisible by the characteristic of the underlying field. It is well known that the formula for the minimum distance of repeated-root cyclic codes is similar to that for generalized concatenated codes. We show that indecomposable repeated-root cyclic codes are product codes and that the minimum weight of each rep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bound on the mean-squared error in oversampled quantization of periodic signals using vector quantization analysis

    Publication Year: 1996, Page(s):469 - 479
    Cited by:  Papers (25)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    Oversampled analog-to-digital conversion is a technique which permits high conversion resolution using coarse quantization. Classically, by lowpass filtering the quantized oversampled signal, it is possible to reduce the quantization error power in proportion to the oversampling ratio R. In other words, the reconstruction mean-squared error (MSE) is in 𝒪(R-1). It was recently found... View full abstract»

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

    Publication Year: 1996, Page(s):554 - 565
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1144 KB)

    We study codes over GF(q) that can correct t channel errors assuming the error values are known. This is a counterpart to the well-known problem of erasure correction, where error values are found assuming the locations are known. The correction capabilities of these so-called t-location correcting codes (t-LCCs) are characterized by a new metric, the decomposability distance, which plays a role a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generation of matrices for determining minimum distance and decoding of cyclic codes

    Publication Year: 1996, Page(s):653 - 657
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    A simple method based on Newton's identities and their extensions is presented for determining the actual minimum distance of cyclic codes. More significantly, it is shown that this method also provides a mechanism for generating the type of syndrome matrices needed by Feng and Tzeng's (see ibid., vol.40, p.1364-1374, Sept. 1994) new procedure for decoding cyclic and BCH codes up to their actual m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large families of quaternary sequences with low correlation

    Publication Year: 1996, Page(s):579 - 592
    Cited by:  Papers (76)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    A family of quaternary (Z4-alphabet) sequences of length L=2r-1, size M⩾L2+3L+2, and maximum nontrivial correlation parameter Cmax⩽2√(L+1)+1 is presented. The sequence family always contains the four-phase family 𝒜. When r is odd, it includes the family of binary Gold sequences. The sequence family is easily generated using two shift r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple analysis of average queueing delay in tree networks

    Publication Year: 1996, Page(s):660 - 664
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    We develop an approach to the analysis of average queueing delay in a tree network of discrete-time queues with constant service time. The analysis of such systems is pertinent to packet-switched data networks with fixed-length packets. Our solution is based on considering an equivalent network, in which at each node packets in transit are given priority over exogenous arrivals. The solution to th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approaching capacity of a continuous channel by discrete input distributions

    Publication Year: 1996, Page(s):671 - 675
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    In this paper memoryless channels with general alphabets and input constraint are considered. Sufficient conditions are given that channel capacity can be approached by discrete input distributions or by uniform input distributions with finite support. As an example, the additive white Gaussian noise channel is considered View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generation of canonical M-sequences and dual bases

    Publication Year: 1996, Page(s):638 - 641
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    An expression for the shift necessary to obtain a canonical M-sequence is obtained in terms of the coefficients of the primitive polynomial that generates this m-sequence. This shift for obtaining a canonical M-sequence is also directly related to the shift for obtaining the location of the span “100...0” in the M-sequence. In addition, a recursion is developed for obtaining the dual b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The ternary Golay code, the integers mod 9, and the Coxeter-Todd lattice

    Publication Year: 1996, Page(s):636 - 637
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    The 12-dimensional Coxeter-Todd lattice can be obtained by lifting the ternary Golay code to a code over the integers mod 9 and applying Construction A 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 distribution of computation of a sequential decoder for multiple-access channels

    Publication Year: 1996, Page(s):399 - 408
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    The computational distribution of sequential decoding for discrete memoryless multiple-access channels is examined. It is shown that all possible collections of incorrect paths in the code tree may be described by bipartite graphs. Using this fact and a new decoding metric it is proved that the number of computations in the first incorrect subtree is a Paretean random variable, and that the parame... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Irregular sampling for spline wavelet subspaces

    Publication Year: 1996, Page(s):623 - 627
    Cited by:  Papers (35)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    Spline wavelets ψm(t) are important in time-frequency localization due to (i) ψm can be arbitrarily close to the optimal case as m is sufficiently large, (ii) ψm has compact support and simple analytic expression, which lead to effective computation. Although the spline wavelet subspaces are so simple, Walter's well-known sampling theorem does not hold ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the asymptotic distribution of the errors in vector quantization

    Publication Year: 1996, Page(s):461 - 468
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    In a recent paper, Lee and Neuhoff (see ibid., vol.42, no.2, p446-60, 1996) found an asymptotic formula for the distribution of the length of the errors produced by a vector quantizer with many quantization points. This distribution depends on the source probability density, the quantizer point density, and the quantizer shape profile. (The latter characterizes the shapes of the quantization cells... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A soft-output decoding algorithm for concatenated systems

    Publication Year: 1996, Page(s):543 - 553
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1016 KB)

    In order to fully utilize the SDD (soft-decision decoding) capacity of the outer codes in a concatenated system, reliability information on the inner decoder outputs (called soft outputs) needs to be provided to the outer decoder. This paper shows that a modified MAP algorithm can be effectively and accurately used to generate such information. In the course of the presentation, a metric based on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rate-splitting approach to the Gaussian multiple-access channel

    Publication Year: 1996, Page(s):364 - 375
    Cited by:  Papers (183)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1236 KB)

    It is shown that any point in the capacity region of a Gaussian multiple-access channel is achievable by single-user coding without requiring synchronization among users, provided that each user “splits” data and signal into two parts. Based on this result, a new multiple-access technique called rate-splitting multiple accessing (RSMA) is proposed. RSMA is a code-division multiple-acce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spread-response precoding for communication over fading channels

    Publication Year: 1996, Page(s):488 - 501
    Cited by:  Papers (45)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1352 KB)

    Interleaving is an important technique for improving the effectiveness of traditional error-correcting codes in data transmission systems that exhibit multipath fading. Such channels often arise in mobile wireless communications. We present an alternative to interleaving for such systems, which we term “spread-response precoding”. From the perspective of the coded symbol stream, spread... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic processes that generate polygonal and related random fields

    Publication Year: 1996, Page(s):606 - 617
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    A reversible, ergodic, Markov process taking values in the space of polygonally segmented images is constructed. The stationary distribution of this process can be made to correspond to a Gibbs-type distribution for polygonal random fields as introduced by Arak and Surgailis (1989) and a few variants thereof, such as those arising in Bayesian analysis of random fields. Extensions to generalized po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algebraic procedure for decoding beyond eBCH

    Publication Year: 1996, Page(s):649 - 652
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    We present a new way to find all possible error patterns up to a given weight greater than the designed error correcting capability (e BCH). Possible error positions are localized by indicators. Our method can be seen as an extension of the step-by-step decoder introduced by Massey (1965) for BCH codes. We consider the decoding of binary cyclic codes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the cardinality of systematic authentication codes via error-correcting codes

    Publication Year: 1996, Page(s):566 - 578
    Cited by:  Papers (12)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1084 KB)

    In both open and private communication the participants face potential threats from a malicious enemy who has access to the communication channel and can insert messages (impersonation attack) or alter already transmitted messages (substitution attack). Authentication codes (A-codes) have been developed to provide protection against these threats. In this paper we introduce a new distance, called ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weight enumerators of extremal singly-even [60,30,12] codes

    Publication Year: 1996, Page(s):658 - 659
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    Conway and Sloane (1990) have listed the possible weight enumerators for extremal self-dual codes up to length 72. In this correspondence, we construct extremal singly-even self-dual [60,30,12] codes whose weight enumerator does not appear in this list. In addition, we present the possible weight enumerators for extremal self-dual codes of length 60 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hashing of databases based on indirect observations of Hamming distances

    Publication Year: 1996, Page(s):664 - 671
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    We describe hashing of databases as a problem of information and coding theory. It is shown that the triangle inequality for the Hamming distances between binary vectors may essentially decrease the computational efforts of a search for a pattern in a database. Introduction of the Lee distance in the space, which consists of the Hamming distances, leads to a new metric space where the triangle ine... 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