IEEE Transactions on Information Theory

Volume 41 Issue 6  Part 2 • Nov. 1995

 This issue contains several parts.Go to:  Part 1 

Filter Results

Displaying Results 1 - 25 of 39
  • Asymptotic expansions and rate of convergence in signal detection

    Publication Year: 1995, Page(s):1773 - 1787
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1212 KB)

    The number of samples required for signal detection is considered as a function of the error probabilities. This problem is treated in the context of detecting a constant signal in additive, independent, and identically distributed noise. Detectors that base their decisions on the comparison with a threshold of accumulated, nonlinearly transformed observations are treated. Asymptotic expressions a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of random signals in Gaussian mixture noise

    Publication Year: 1995, Page(s):1788 - 1801
    Cited by:  Papers (49)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1331 KB)

    A locally optimal detection algorithm for random signals in dependent noise is derived and applied to independent identically distributed complex-valued Gaussian mixture noise. The resulting detector is essentially a weighted sum of power detectors-the power detector is the locally optimal detector for random signals in Gaussian noise. The weighting functions are modified to enhance the detection ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parameter estimation with multiterminal data compression

    Publication Year: 1995, Page(s):1802 - 1833
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2842 KB)

    The multiterminal estimation theory deals with an entirely novel problem which takes place in the void between information theory and statistics, that is, what amount of Fisher information can be attained under a restriction on the amount of Shannon information. The key idea here is the indivisible fusion of the information-theoretic universal coding problem and the statistical maximum-likelihood ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal importance sampling for some quadratic forms of ARMA processes

    Publication Year: 1995, Page(s):1834 - 1844
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1043 KB)

    The determination of the asymptotically efficient importance sampling distribution for evaluating the tail probability P(L/sub n/>u) for large n by Monte Carlo simulations, is considered. It is assumed that L/sub n/ is the likelihood ratio statistic for the optimal detection of signal with spectral density s/spl circ/ from noise with spectral density c/spl circ/, L/sub n/=(2n)/sup -1/X/sub n//s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fixed-interval smoothing for Markovian switching systems

    Publication Year: 1995, Page(s):1845 - 1855
    Cited by:  Papers (73)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1023 KB)

    A suboptimal approach to the fixed-interval smoothing problem for Markovian switching systems is examined. A smoothing algorithm is developed that uses two multiple-model filters, where one of the filters propagates in the forward-time direction and the other one propagates in the backward-time direction. A backward-time filtering algorithm based on the interacting multiple model concept is also d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weighted coverings and packings

    Publication Year: 1995, Page(s):1856 - 1867
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1154 KB)

    Introduces a generalization of the concepts of coverings and packings in Hamming space called weighted coverings and packings. This allows to formulate a number of well-known coding theoretical problems in a uniform manner. The authors study the existence of perfect weighted codes, discuss connections between weighted coverings and packings, and present many constructions for them. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear feedback communication systems with Markov sources: optimal system design and performance evaluation

    Publication Year: 1995, Page(s):1868 - 1876
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (906 KB)

    The optimal analog discrete-time feedback communication system is designed for the transmission of a Markov process, such as that generated by a combined source/channel encoder. The forward channel is affected by an additive white Gaussian noise, while the feedback channel is causal and noiseless; no repetition of the transmitted sample is assumed. On the basis of the minimum mean square error (MM... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sensitivity of channel capacity

    Publication Year: 1995, Page(s):1877 - 1888
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (934 KB)

    In some channels subject to crosstalk or other types of additive interference, the noise is the sum of a dominant Gaussian noise and a relatively weak non Gaussian contaminating noise. Although the capacity of such channels cannot be evaluated in general, the authors analyze the decrease in capacity, or sensitivity of the channel capacity to the weak contaminating noise. The main result is that fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels

    Publication Year: 1995, Page(s):1889 - 1902
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1187 KB)

    An upper bound on the maximal transmission rate over binary-input memoryless channels, provided that the decoding decision rule is given, is derived. If the decision rule is equivalent to the maximum-likelihood decoding (matched decoding), then the bound coincides with the channel capacity. Otherwise (mismatched decoding), it coincides with a known lower bound. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Necessary conditions for the optimality of variable-rate residual vector quantizers

    Publication Year: 1995, Page(s):1903 - 1914
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1244 KB)

    Necessary conditions for the optimality of variable-rate residual vector quantizers are derived, and an iterative descent algorithm based on a Lagrangian formulation is introduced for designing residual vector quantizers having minimum average distortion subject to an entropy constraint. Simulation results for entropy-constrained residual vector quantizers are presented for memoryless Gaussian, La... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized privacy amplification

    Publication Year: 1995, Page(s):1915 - 1923
    Cited by:  Papers (604)  |  Patents (54)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1146 KB)

    This paper, provides a general treatment of privacy amplification by public discussion, a concept introduced by Bennett, Brassard, and Robert for a special scenario. Privacy amplification is a process that allows two parties to distil a secret key from a common random variable about which an eavesdropper has partial information. The two parties generally know nothing about the eavesdropper's infor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the trellis structure of block codes

    Publication Year: 1995, Page(s):1924 - 1937
    Cited by:  Papers (100)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1668 KB)

    The problem of minimizing the vertex count at a given time index in the trellis for a general (nonlinear) code is shown to be NP-complete. Examples are provided that show that (1) the minimal trellis for a nonlinear code may not be observable, i.e. some codewords may be represented by more than one path through the trellis and (2) minimizing the vertex count at one time index may be incompatible w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds on trellis complexity of block codes

    Publication Year: 1995, Page(s):1938 - 1954
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3385 KB)

    The trellis state-complexity s of a linear block code is defined as the logarithm of the maximum number of states in its minimal trellis. We present a new lower bound on the state complexity of linear codes, which includes most of the existing bounds as special cases. The new bound is obtained by dividing the time axis for the code into several sections of varying lengths, as opposed to the divisi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of coding schemes for modulation and error control

    Publication Year: 1995, Page(s):1955 - 1968
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1429 KB)

    Several techniques for constructing practical codes for noisy modulation channels represented by (d,k) constraints, such as in magnetic and optical recording, are analyzed. Concatenated schemes based on inner sliding-window codes are compared with concatenated schemes based on inner block codes in terms of efficiency and reliability. The performance of the schemes is investigated in detail for (1,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A code decomposition approach for decoding cyclic and algebraic-geometric codes

    Publication Year: 1995, Page(s):1969 - 1987
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1789 KB)

    An approach based on code decomposition and partial transform for constructing algorithms for decoding cyclic codes and algebraic-geometric (AG) codes is introduced. A general decoding procedure applicable to arbitrary linear codes and their subfield subcodes is then developed. In particular, we have developed algorithms for error-and-erasure decoding of cyclic codes up to their actual minimum dis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The asymptotics of posterior entropy and error probability for Bayesian estimation

    Publication Year: 1995, Page(s):1988 - 1992
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (473 KB)

    We consider the Bayesian parameter estimation problem where the value of a finitary parameter X should be decided on the basis of i.i.d. sample Y/sup n/ of size n. In this context, the amount of missing information on X after observing Y/sup n/ may be evaluated by the posterior entropy, which is often called the equivocation or the conditional entropy, of X given Y/sup n/, while it is well known t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound on the probability of error in multihypothesis testing

    Publication Year: 1995, Page(s):1992 - 1994
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    Consider two random variables X and Y, where X is finitely (or countably-infinitely) valued, and where Y is arbitrary. Let /spl epsiv/ denote the minimum probability of error incurred in estimating X from Y. It is shown that /spl epsiv//spl ges//sub 0/spl les//spl alpha//spl les/1//sup sup/(1-/spl alpha/)P(/spl pi/(X|Y)/spl les//spl alpha/) where /spl pi/(X|Y) denotes the posterior probability of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic efficiency of a sequential multihypothesis test

    Publication Year: 1995, Page(s):1994 - 1997
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (413 KB)

    A sequential multihypothesis test known as the M-ary sequential probability ratio test (MSPRT) is generalized to account for nonuniform decision costs. Bounds on error probabilities and asymptotic expressions for the stopping time and error probabilities are given. A key result of this correspondence is a proof that the generalized MSPRT is asymptotically efficient. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the performance degradation from one-bit quantized detection

    Publication Year: 1995, Page(s):1997 - 2003
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (709 KB)

    It is common signal detection practice to base tests on quantized data and frequently, as in decentralized detection, this quantization is extreme: to a single bit. As to the accompanying degradation in performance, certain cases (such as that of an additive signal model and an efficacy measure) are well-understood. However, there has been little treatment of more general cases. In this correspond... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The entropy of consecutive order statistics

    Publication Year: 1995, Page(s):2003 - 2007
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (411 KB)

    Calculation of the entropy of a set of consecutive order statistics is relatively more complicated than that of the entropy of the individual order statistic, which has been studied by Wong and Chan (1990). We provide some fundamental relations occurring in the entropy of consecutive-order statistics, which are very useful for computations. We first consider the decomposition of the entropy of ord... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the distribution function of a random power series with Bernoulli variables as coefficients

    Publication Year: 1995, Page(s):2007 - 2008
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (189 KB)

    An explicit formula is given for the distribution function of the Bernoulli random power series when the argument is the pth root of 1/2. It is expressed as a spline of degree p. One application is to the study of intersymbol interference in communication theory. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Profit maximizing and price distortion minimizing codes for a channel model of an asset market

    Publication Year: 1995, Page(s):2009 - 2014
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (718 KB)

    A model of an asset market with noiseless price feedback is shown to achieve maximum profits for the market traders and also to achieve a point on the rate distortion function of the market input. A simplified version of the model, which is empirically more robust than the original, is shown to be a market operating with a fixed signal power. For this version it is found that there is a tradeoff b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Competitive optimality of source codes

    Publication Year: 1995, Page(s):2015 - 2019
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    Competitively optimal coding is considered and the following is proved. (1) If the competitively optimal code exists for a given source probability p(x), then it also attains the minimum expected codeword length. (2) If the Huffman code tree for p(x) is unbalanced in probability weight, then the competitively optimal code does not exist. Furthermore, the relation between competitively optimal codi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructions and properties of block codes for partial-response channels

    Publication Year: 1995, Page(s):2019 - 2026
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (884 KB)

    We report on block-coding techniques for partial-response channels with transfer function (1/spl mnplus/D/sup m/), m=1, 2, ... . We consider various constructions of block codes with prescribed minimum Euclidean distance. Upper and lower bounds to the size of a code with minimum squared Euclidean distance greater than unity are furnished. A table is presented of cardinalities of codes of small len... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient block-based addressing scheme for the nearly optimum shaping of multidimensional signal spaces

    Publication Year: 1995, Page(s):2026 - 2031
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (733 KB)

    We introduce an efficient addressing scheme for the nearly optimum shaping of a multidimensional signal constellation. The 2-D (two-dimensional) subspaces are partitioned into K energy shells of equal cardinality. The average energy of a 2-D shell can be closely approximated by a linear function of its index. In an N=2n-D space, we obtain K/sup n/ shaping clusters of equal cardinality. Shaping 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
Alexander Barg

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

email: abarg-ittrans@ece.umd.edu