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.
  • 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.
  • Exact analysis of the Lempel-Ziv algorithm for i.i.d. sources

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

    The authors apply the Lempel-Ziv incremental parsing (LZIP) algorithm to an i.i.d. source and obtain the expected length of the ith parsed segment. From this formula, the data compression ratio of LZIP is calculated in the framework of a variable-to-fixed length coding scheme 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 (104)
    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.
  • An updated table of minimum-distance bounds for binary linear codes

    Publication Year: 1993, Page(s):662 - 677
    Cited by:  Papers (120)  |  Patents (31)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (860 KB)

    Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binary linear code with word length n and dimension k, are shown 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 (41)
    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.
  • Dynamic server allocation to parallel queues with randomly varying connectivity

    Publication Year: 1993, Page(s):466 - 478
    Cited by:  Papers (390)  |  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.
  • 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.
  • A coded ARQ scheme with the generalized Viterbi algorithm

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

    A coded automatic repeat request (ARQ) scheme based on a generalized Viterbi decoding algorithm is proposed. The scheme utilizes the error propagation, which is commonly observed in reduced-complexity decoding, as a means of error detection. It is shown that a small undetectable error probability is obtained with a small retransmission probability for a discrete memoryless channel, contrary to the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perfect (d,k)-codes capable of correcting single peak-shifts

    Publication Year: 1993, Page(s):656 - 662
    Cited by:  Papers (33)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (684 KB)

    Codes for the multibit peak-shift recording channel, called (d ,k)-codes of reduced length N, are considered. Arbitrary (d,k)- and perfect (d,k)-codes capable of correcting single peak-shifts of given size t are defined. For the construction of perfect codes, a general combinatorial method connected with finding `good' weight ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust multiple classification of known signals in additive noise-an asymptotic weak signal approach

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

    The problem of extracting one out of a finite number of possible signals of known form given observations in an additive noise model is considered. Two approaches are studied: either the signal with shortest distance to the observed data or the signal having maximal correlation with some transformation of the observed data is chosen. With a weak signal approach, the limiting error probability is 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.
  • 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.
  • Phased burst error-correcting array codes

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

    Various aspects of single-phased burst-error-correcting array codes are explored. These codes are composed of two-dimensional arrays with row and column parities with a diagonally cyclic readout order; they are capable of correcting a single burst error along one diagonal. Optimal codeword sizes are found to have dimensions n1 ×n2 such that n<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the minimum distance of ternary cyclic codes

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

    There are many ways to find lower bounds for the minimum distance of a cyclic code, based on investigation of the defining set. Some new theorems are derived. These and earlier techniques are applied to find lower bounds for the minimum distance of ternary cyclic codes. Furthermore, the exact minimum distance of ternary cyclic codes of length less than 40 is computed numerically. A table is given ... 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.
  • Coding for skew-tolerant parallel asynchronous communications

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

    A communication channel consisting of several subchannels transmitting simultaneously and asynchronously is considered, an example being a board with several chips, where the subchannels are wires connecting the chips and differences in the lengths of the wires can result in asynchronous reception. A scheme that allows transmission without an acknowledgment of the message, therefore permitting pip... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the minimum expected duration of a coin tossing game

    Publication Year: 1993, Page(s):581 - 593
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (976 KB)

    The following coin tossing game is analyzed: a store of N fair coins is given and it is desired to achieve M heads in a round of tosses of the coins. To allow for unfavorable sequences of tails, restarts are permitted at any epoch in the game where, in any restart, all coins are returned to store and tosses are begun anew from tabula rasa. A restart strategy is a prescription tha... 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 (24)
    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.
  • 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.
  • On the reliability function of the ideal Poisson channel with noiseless feedback

    Publication Year: 1993, Page(s):491 - 503
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (968 KB)

    A coding scheme for the channel under peak power and average power constraints on the input is presented, and its asymptotic error exponent is shown to coincide, at all rates below capacity, with the sphere packing error exponent, which, for the case at hand, is known to be unachievable without feedback for rates below the critical rate. An upper bound on the error exponent achievable with feedbac... 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 (14)  |  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.
  • Distributed algorithms for computing shortest pairs of disjoint paths

    Publication Year: 1993, Page(s):443 - 455
    Cited by:  Papers (47)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1184 KB)

    Distributed algorithms for finding two disjoint paths of minimum total length from each node to a destination are presented. The algorithms have both node-disjoint and link-disjoint versions and provide each node with information sufficient to forward data on the disjoint paths. It is shown that this problem can be reduced to the problem of finding a minimal shortest path from each node to the des... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The linear programming bound for binary linear codes

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

    Combining Delsarte's (1973) linear programming bound with the information that certain weights cannot occur, new upper bounds for dmin (n,k), the maximum possible minimum distance of a binary linear code with given word length n and dimension k, are derived 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