By Topic

IEEE Transactions on Information Theory

Issue 2 • March 1993

Filter Results

Displaying Results 1 - 25 of 45
  • Trellis coding with multidimensional QAM signal sets

    Publication Year: 1993, Page(s):325 - 336
    Cited by:  Papers (41)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1132 KB)

    Trellis coding using multidimensional quadrature amplitude modulation (QAM) signal sets is investigated. Finite-size 2D signal sets are presented that have minimum average energy, are 90 degrees rotationally symmetric, and have from 16 to 1024 points. The best trellis codes using the finite 16-QAM signal set with two, four, six, and eight dimensions are found by computer search (the multidimension... View full abstract»

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

    Publication Year: 1993, Page(s):654 - 656
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    Large families of weakly correlated codes, much in the spirit of R. Gold (1967) and T. Kasami (1971), are constructed. More general codes than those of Gold and Kasami, generated in essentially the same way, and with a much simpler method of proof, are given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum support weights of binary codes

    Publication Year: 1993, Page(s):648 - 654
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    Some relations between the minimum support weights are discussed. In particular, the possible weight hierarchies of codes of dimension 4 are determined View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Primitive polynomials and m-sequences over GF(q m)

    Publication Year: 1993, Page(s):643 - 647
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    Procedures for obtaining primitive polynomials and m-sequences over GF(qm) in terms of primitive polynomials and m-sequences over GF(q) are presented. Using a degree mn primitive polynomial g( x) in GF[g, x], an m-sequence over GF(qm) can be expressed as a vector m-sequ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Avoiding decoder malfunction in the Peterson-Gorenstein-Zierler decoder

    Publication Year: 1993, Page(s):640 - 643
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    BCH decoders based on the Peterson-Gorenstein-Zierler algorithm can malfunction and produce output vectors that are no codewords. To avoid this malfunction a simple additional check is proposed that can be performed before the computation of the error locations. The additional check consists of the minimum number of algebraic equations in the syndrome components that are necessary over a general f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Uniform switching system by families of switching sets

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

    A new mathematical method in coding theory that is applicable to various practical problems in communication systems is introduced. The uniform switching system based on k-sets is defined, and its cardinalities, an index system, and error correctabilities are studied. The cardinalities of a uniform switching system based on general families of switching sets are discussed. The asymptotic ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Difference bases and sparse sensor arrays

    Publication Year: 1993, Page(s):716 - 721
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    Difference bases are discussed and their relevance to sensor arrays is described. Several new analytical difference base structures that result in near optimal low-redundancy sensor arrays are introduced. Algorithms are also presented for efficiently obtaining sparse sensor arrays and/or difference bases. New bounds, related to arrays that have both redundancies and holes in their coarray, are pre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust estimation of signal parameters with nonstationary and/or dependent data

    Publication Year: 1993, Page(s):617 - 623
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    A new approach toward robust parameter estimation is presented. As opposed to schemes based on classical saddlepoint techniques, the methods apply quite naturally to dependent and/or nonstationary data and also have the advantage of providing a quantitative measure of the degree of robustness offered by a particular estimator. It is shown why censoring observations of large magnitude does indeed i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on the asymptotics of distributed detection with feedback

    Publication Year: 1993, Page(s):633 - 640
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    The effect of feedback on the performance of a distributed Neyman-Pearson detection system consisting of n sensors, two-stage local quantizers, and a global detector is investigated. Two feedback schemes are discussed, only one of which yields an asymptotic gain in performance, as measured by an appropriate error exponent View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some results on the covering radii of Reed-Muller codes

    Publication Year: 1993, Page(s):366 - 378
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    Let R(r,m) be the rth-order Reed-Muller code of length 2m and let ρ(r,m ) be its covering radius. R(2,7), R(2,8), R (3,7), and R(4,8) are among those smallest Reed-Muller codes whose covering radii are not known. New bounds for the covering radii of these four codes are obtained. The results ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic server allocation to parallel queues with randomly varying connectivity

    Publication Year: 1993, Page(s):466 - 478
    Cited by:  Papers (371)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (976 KB)

    Consider N parallel queues competing for the attention of a single server. At each time slot each queue may be connected to the server or not depending on the value of a binary random variable, the connectivity variable. Allocation at each slot; is based on the connectivity information and on the lengths of the connected queues only. At the end of each slot, service may be completed with ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Block-coded M-PSK modulation over GF(M)

    Publication Year: 1993, Page(s):337 - 346
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    Channel codes where the redundancy is obtained not from parity symbols, but from expanding the channel signal-set, are addressed. They were initially proposed by G. Ungerboeck (1982) using a convolutional code. Here, a block coding approach is given. Rate m/(m+1) coded 2m+1-ary phase-shift keying (PSK) is considered. The expanded signal-set is given the structure of a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the asymptotic efficiency of importance sampling techniques

    Publication Year: 1993, Page(s):710 - 715
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    The asymptotic efficiency of importance sampling (IS) techniques for the simulation of rare events in a multidimensional nonlinear setting was studied by J.S. Sadowsky and J.A. Bucklew (see ibid., vol.36, p.579-88, 1990). Fundamental results on the asymptotic efficiency of the mean-value modification (MM) technique were derived. Additionally, a statement was made that other IS techniques cannot be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The input-output map of a monotone discrete-time quasireversible node [queueing theory]

    Publication Year: 1993, Page(s):543 - 552
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    A class of discrete-time quasi-reversible nodes called monotone, which includes discrete-time analogs of the ./M/∞ and ./M/1 nodes, is considered. For stationary ergodic nonnegative integer valued arrival processes, the existence and uniqueness of stationary regimes are proven when a natural rate condition is met. Coupling is used to prove the contractiveness of the input-output map relative... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The cutoff rate of time correlated fading channels

    Publication Year: 1993, Page(s):612 - 617
    Cited by:  Papers (18)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    The cutoff rate of Rician and Rayleigh channels characterized by time correlated fading is derived for M-ary phase shift keying (MPSK) modulation. It is useful for situations where perfect interleaving cannot be achieved. It indicates the practical achievable information rate of the channel when coding is employed. It is used to determine the potential coding gains of coded modulation ove... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the number of correctable errors for some AG-codes

    Publication Year: 1993, Page(s):681 - 684
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    An algorithm that, for codes from a regular plane curve, corrects up to (d*/2)-(m2/8)+(m/4)-(9/8) errors, where d* is the designed distance and m is the degree of the curve, was presented in an earlier work (see ibid., vol.35, p.811-21, 1989). It is now shown that this bound is the best possible for the algorithm considered View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decentralized sequential detection with a fusion center performing the sequential test

    Publication Year: 1993, Page(s):433 - 442
    Cited by:  Papers (102)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    A decentralized sequential detection problem is considered in which each one of a set of sensors receives a sequence of observations about the hypothesis. Each sensor sends a sequence of summary messages to the fusion center where a sequential test is carried out to determine the true hypothesis. A Bayesian framework for this problem is introduced, and for the case when the information structure i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the converse theorem in statistical hypothesis testing for Markov chains

    Publication Year: 1993, Page(s):629 - 633
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    Hypothesis testing for two Markov chains is considered. Under the constraint that the error probability of the first kind is less than or equal to exp(-rn), the error probability of the second kind is minimized. The geodesic that connects the two Markov chains is defined. By analyzing the geodesic, the power exponents are calculated and then represented in terms of Kullback-Leibler diverg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new model of numerical computer data and its application for construction of minimum-redundancy codes

    Publication Year: 1993, Page(s):389 - 397
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    Numerical computer data in many applications contain numerous leading and trailing zeros, and this data feature has been neglected in common source models and related data compression methods. A new approach to source modeling, consisting of the description of this data feature by probabilities pij of data values with i leading and j trailing zeros, is propose... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new Reed-Solomon code decoding algorithm based on Newton's interpolation

    Publication Year: 1993, Page(s):358 - 365
    Cited by:  Papers (36)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    A Reed-Solomon code decoding algorithm based on Newton's interpolation is presented. This algorithm has as main application fast generalized-minimum-distance decoding of Reed-Solomon codes. It uses a modified Berlekamp-Massey algorithm to perform all necessary generalized-minimum-distance decoding steps in only one run. With a time-domain form of the new decoder the overall asymptotic generalized-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic decoding using special divisors

    Publication Year: 1993, Page(s):694 - 698
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    The basic algorithm for decoding of algebraic-geometric codes corrects up to (dc-1)2-g/2 errors, where d c denotes the designed minimum distance of a code and g denotes the genus of a curve. The modified algorithm improves on this, but applies to a restricted class of codes. An extended modified algorithm that applies to all codes is formulated. It... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of a correlated queue in a communication system

    Publication Year: 1993, Page(s):456 - 465
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    A family of queues is studied for which the service time Bn of customer n and the interarrival time In between customers n-1 and n exhibit some sort of proportionality. The focus is on dependencies that arise naturally in the context of communication systems, where the finite speed of the communication links constrains the amount o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Valid parameter space of 2-D Gaussian Markov random fields

    Publication Year: 1993, Page(s):703 - 709
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    The valid parameter spaces of infinite- and finite-lattice (2-D noncausal) Gaussian Markov random fields (GMRFs) are investigated. For the infinite-lattice fields, the valid parameter space is shown to admit an explicit description; a procedure that yields the valid parameter space is presented. This procedure is applied to the second-order (neighborhood) 2-D GMRFs to obtain an explicit descriptio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploitation of cyclostationarity for identifying the Volterra kernels of nonlinear systems

    Publication Year: 1993, Page(s):535 - 542
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    A class of random time-series inputs for nonlinear time-invariant systems that permit the analytical specification of a set of operators on the input that are orthonormal over all time to the Volterra operators for all orders and all lag sets is introduced. The time series in this class are cyclostationary and complex valued. The orthonormal operators are used to obtain an input-output type of cro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On limiting characterizations of memoryless multiuser capacity regions

    Publication Year: 1993, Page(s):609 - 612
    Cited by:  Papers (20)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    The restriction to Gaussian inputs in the limiting expression for the capacity regions of memoryless Gaussian interference and multiple-access channels is shown to fall short of achieving capacity even if the inputs are allowed to be dependent and nonstationary. In addition, the equality between the limiting and the single-letter characterizations of memoryless multiple-access channel capacity is ... 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