IEEE Transactions on Information Theory

Volume 36 Issue 6 • Nov. 1990

Filter Results

Displaying Results 1 - 25 of 34
  • Capacity bounds for identification via broadcast channels that are optimal for the determination broadcast channel

    Publication Year: 1990, Page(s):1197 - 1205
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (718 KB)

    An inner bound to the capacity region for identification via a broadcast channel with feedback and a soft outer bound to the capacity region of a general broadcast channel without feedback are established, allowing randomized encoding in both cases. These results can be combined to determine the identification capacity region for the deterministic broadcast channel; the set of achievable second-or... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A class of codes for a T active users out of N multiple-access communication system

    Publication Year: 1990, Page(s):1206 - 1219
    Cited by:  Papers (54)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1181 KB)

    A code construction for a T active users out of N multiple-access system (TANMAS) is discussed. The multiple-access channel (MAC) that is used in the TANMAS is a discrete-time noiseless real adder channel used without feedback with N real or binary inputs. Each input may be affected by an unknown, slowly varying channel gain and by an unknown, slowly varying channel offset. A set of N codes is con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantization noise spectra

    Publication Year: 1990, Page(s):1220 - 1244
    Cited by:  Papers (282)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2142 KB)

    Several results describing the behavior of quantization noise in a unified and simplified manner are discussed. Exact formulas for quantizer noise spectra are developed. They are applied to a variety of systems and inputs, including scalar quantization (PCM), dithered PCM, sigma-delta modulation, dithered sigma-delta modulation, two-stage sigma-delta modulation, and second-order sigma-delta modula... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • One universally efficient estimation of the first-order autoregressive parameter and universal data compression

    Publication Year: 1990, Page(s):1245 - 1254
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (746 KB)

    A universal nearly efficient estimator is proposed for the first-order autoregressive (AR) model where the probability distribution of the driving noise is unknown. It is shown that universal estimators for the AR model can be derived from universal data compression algorithms and universal tests for randomness. In other words, estimators derived appropriately from efficient universal codes can be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence of the projection method for an autoregressive process and a matched DPCM code

    Publication Year: 1990, Page(s):1255 - 1264
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (835 KB)

    The key step in the analysis of differential pulse code modulation (DPCM) is to find the steady-state probability distribution of a random process in terms of which the code distortion can be evaluated. For the case of an autoregressive source and a matched DPCM code, a well-known approximation technique has been used for the evaluation of the steady-state distribution of the prediction error proc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust data fusion for multisensor detection systems

    Publication Year: 1990, Page(s):1265 - 1279
    Cited by:  Papers (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1338 KB)

    Minimax robust data fusion schemes for multisensor detection systems with discrete-time observations characterized by statistical uncertainty are developed and analyzed. Block, sequential, and serial fusion rules are considered. The performance measures used, and made robust with respect to the uncertainties, include the error probabilities of the hypothesis testing problem in the block fusion cas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for near-optimal placement of sensor elements

    Publication Year: 1990, Page(s):1280 - 1284
    Cited by:  Papers (47)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (491 KB)

    An important question in array design is that of where to place the elements of a sparse array for optimal performance in terms of its ability to detect and resolve a greater number of sources than conventionally possible. In particular, it has been shown that when sensor elements are arranged in the minimum redundancy fashion, by performing an augmentation technique on the covariances obtained fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds for parametric estimation with constraints

    Publication Year: 1990, Page(s):1285 - 1301
    Cited by:  Papers (179)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1610 KB)

    A Chapman-Robbins form of the Barankin bound is used to derive a multiparameter Cramer-Rao (CR) type lower bound on estimator error covariance when the parameter theta in R/sup n/ is constrained to lie in a subset of the parameter space. A simple form for the constrained CR bound is obtained when the constraint set Theta /sub C/, can be expressed as a smooth functional inequality constraint. It is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power-law shot noise

    Publication Year: 1990, Page(s):1302 - 1318
    Cited by:  Papers (139)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1514 KB)

    The behavior of power-law shot noise, for which the associated impulse response functions assume a decaying power-law form, is explored. Expressions are obtained for the moments, moment generating functions, amplitude probability density functions, autocorrelation functions, and power spectral densities for a variety of parameters of the process. For certain parameters the power spectral density e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new upper bound on the minimal distance of self-dual codes

    Publication Year: 1990, Page(s):1319 - 1333
    Cited by:  Papers (176)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1307 KB)

    It is shown that the minimal distance d of a binary self-dual code of length n>or=74 is at most 2((n+6)/10). This bound is a consequence of some new conditions on the weight enumerator of a self-dual code obtained by considering a particular translate of the code, called its shadow. These conditions also enable one to find the highest possible minimal distance of a self-dual code for all n>o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new table of constant weight codes

    Publication Year: 1990, Page(s):1334 - 1380
    Cited by:  Papers (205)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3664 KB)

    A table of binary constant weight codes of length n<or=28 is presented. Explicit constructions are given for most of the 600 codes in the table; the majority of these codes are new. The known techniques for constructing constant weight codes are surveyed, and a table of (unrestricted) binary codes of length n<or=28 is given.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructions and bounds for systematic tEC/AUED codes

    Publication Year: 1990, Page(s):1381 - 1390
    Cited by:  Papers (27)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (862 KB)

    Several methods of constructing systematic t-error correcting/all unidirectional error-detecting codes are described. These codes can be constructed by adding a tail to a linear t-error correcting code, but other constructions presented are more of an ad hoc nature. These codes will often be found as suitably chosen subsets of nonsystematic tEC/AUED codes. Further bounds on the word length of syst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of a modified Hebbian rule

    Publication Year: 1990, Page(s):1391 - 1397
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (623 KB)

    A modified Hebbian rule using the matrix G=sgn(X/sup T/X) to induce a certain mapping is discussed. This mapping g is specified as soon as one has chosen the m*n matrix X over U to construct G by use of the above expression. The analysis of g relies on simple counting arguments and on the use of Stirling's approximation to obtain asymptotic results.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of global load balancing by local adjustment

    Publication Year: 1990, Page(s):1398 - 1414
    Cited by:  Papers (17)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1588 KB)

    A set of M resource locations and a set of alpha M consumers are given. Each consumer requires a specified amount of resource, and is constrained to obtain the resource from a specified subset of locations. The problem of assigning consumers to resource locations so as to balance the load among the resource locations as much as possible is considered. It is shown that there are assignments, termed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the unnormalized solution of the filtering problem with counting process observations

    Publication Year: 1990, Page(s):1415 - 1425
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (905 KB)

    A general procedure to solve filtering problems for counting process observations is discussed. Linear (nonstochastic, integro-differential) equations describe the evolution of unnormalized conditional distribution of the state process between observation jump times, while at jump times a linear updating is required. Final normalization is the only nonlinear operation to be implemented. Quite gene... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity of the Gaussian channel with a finite number of input levels

    Publication Year: 1990, Page(s):1426 - 1428
    Cited by:  Papers (47)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (247 KB)

    An analytic confirmation of an observation made by G. Ungerboeck (1965) that approximately optimal performance on a Gaussian channel with capacity C can be obtained with about 2/sup C+1/ levels is given. In particular, the results imply that by using about 2/sup C-1/ levels, a rate of nearly C-1 bit can be achieved, and that by using 2/sup C+1/ levels a rate of about C-0.4 bits can be achieved.<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A binary analog to the entropy-power inequality

    Publication Year: 1990, Page(s):1428 - 1430
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    Let (X/sub n/), (Y/sub n/) be independent stationary binary random sequences with entropy H(X), H(Y), respectively. Let h( zeta )=- zeta log zeta -(1- zeta )log(1- zeta ), 0<or= zeta <or=1/2, be the binary entropy function and let sigma (X)=h/sup -1/ (H(X)), sigma (Y)=h/sup -1/ (H(Y)). Let z/sub n/=X/sub n/(+)Y/sub n/, where (+) denotes modulo-2 addition. The following analog of the entropy-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new recursive filter for systems with multiplicative noise

    Publication Year: 1990, Page(s):1430 - 1435
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (555 KB)

    An optimal linear recursive minimum mean-square-error estimator was previously developed by the authors (see IEEE Trans. Autom. Control, vol.34, no.5, p.568-74, May 1989) for a zero-mean signal corrupted by multiplicative noise in its measurement model. This recursive filter cannot be obtained by the recursive structure of a conventional Kalman filter where the new estimate is a linear combination... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum '1'-ended binary prefix codes

    Publication Year: 1990, Page(s):1435 - 1441
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (565 KB)

    The problem of finding a binary prefix code of minimum average codeword length for a given finite probability distribution subject to the requirement that each codeword must end with a 1 is considered. Lower and upper bounds to the performance of the optimum code are derived; the lower bound is tight for certain probability distributions. An algorithm that generates an optimum code for any given d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a class of multilevel universal source coding schemes

    Publication Year: 1990, Page(s):1442 - 1446
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (474 KB)

    This work seeks to reduce the computational complexity and the coding rate associated with a class of universal source coding schemes for encoding fixed length m-ary sequences into variable length sequences. The Lynch-Davisson (1966) minimax universal source coding scheme, the Tanaka-Ando-Leon-Garcia (TAL) weighted universal source coding scheme (1985), and Cover's general enumerative source codin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bit probabilities of optimal binary source codes

    Publication Year: 1990, Page(s):1446 - 1450
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (595 KB)

    The probabilities of the bits produced by an optimal binary source encoder for a memoryless source are analyzed. The class of sources for which the probability of zero must equal 1/2 for any such encoder is described. Procedures that minimize (maximize) the absolute difference of the bit probabilities are discussed. Corresponding upper bounds are derived and compared for the class of uniform sourc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On optimal quantization of noisy sources

    Publication Year: 1990, Page(s):1450 - 1452
    Cited by:  Papers (33)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (290 KB)

    Problems in optimal multidimensional quantization of sources corrupted by noise are addressed. Expressions for the optimum quantizer values and the optimum quantization rule for the weighted squared error distortion measure are found and calculated for the Gaussian signal in additive independent Gaussian noise problem. Some properties of the optimum quantizer, and its relations with the optimal es... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Any code of which we cannot think is good

    Publication Year: 1990, Page(s):1453 - 1461
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1040 KB)

    A central paradox of coding theory concerns the existence and construction of the best codes. Virtually every linear code is good, in the sense that it meets the Gilbert-Varshamov bound on distance versus redundancy. Despite the sophisticated constructions for codes derived over the years, however, no one has succeeded in demonstrating a constructive procedure that yields such codes over arbitrary... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the decoding of algebraic-geometric codes over F/sub q/ for q>or=16

    Publication Year: 1990, Page(s):1461 - 1463
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (311 KB)

    It is proved that for algebraic-geometric codes on a curve over F/sub q/ for q>or=37 or on a curve of sufficiently large genus over F/sub q/ for q>or=16 there exists a polynomial decoding algorithm up to (d*-1)/2 errors, d* being the designed minimum distance.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The trace description of irreducible quasi-cyclic codes

    Publication Year: 1990, Page(s):1463 - 1466
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (434 KB)

    The notion of a q-ary irreducible quasi-cyclic code of block length n and index r is introduced. A trace description of such a code is provided in a fashion similar to the trace description of irreducible cyclic codes. In particular, it is shown that an irreducible quasi-cyclic code of dimension k is completely described by an irreducible cyclic code and r elements from a field of cardinality q/su... 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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu