IEEE Transactions on Information Theory

Volume 37 Issue 2 • Mar 1991

Filter Results

Displaying Results 1 - 25 of 34
  • Strong converses in source coding relative to a fidelity criterion

    Publication Year: 1991, Page(s):257 - 262
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    Two strong converses are obtained for an abstract alphabet stationary ergodic source coded relative to an appropriate fidelity criterion. It is shown that given a distortion rate point (D, R) that lies below the rate distortion curve, (1) block codes that operate at rate level R must encode sample source blocks at a rate exceeding D with probability tending to one as the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the number of points on shells for shifted Z4n lattices

    Publication Year: 1991, Page(s):391 - 393
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    A conjecture is proven on the number of points on shells for the shifted Z4 and the shifted Z8 lattices. Furthermore, the results are extended to any shifted Z4n lattice (n=0, 1, . . .). These results provide an easy way to compute the number of points on shells for the type of lattices used in the design of multidimen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constrained solutions in importance via robust statistics

    Publication Year: 1991, Page(s):307 - 316
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    The problem of estimating estimating expectations of functions of random vectors via simulation is investigated. Monte Carlo simulations, also known as simple averaging, have been used as a direct means of estimation. A technique known as importance sampling can be used to modify the simulation via weighted averaging in the hope that the estimate will converge more rapidly to the expected value th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotically optimum quantization with time invariant breakpoints for signal detection

    Publication Year: 1991, Page(s):402 - 407
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    The nonlinear equations whose solution determines the locally optimum detection quantizer design are derived for a general parametric detection problem where the breakpoints are constrained to be time invariant. These quantizers maximize the efficacy of a test based on quantized data. Some specific optimum detection quantizer problems for the case of time-invariant breakpoints have been solved in ... View full abstract»

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

    Publication Year: 1991, Page(s):244 - 256
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB)

    The information capacity of the Poisson channel with random or time-varying noise intensity is obtained for time-varying peak and average constraints on the encoder intensity. The channel model is specified, and some definitions from information theory are given. Causal feedback is shown not to increase the channel capacity for the case of nonrandom noise intensity. For random noise intensity, use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation and classification of polynomial-phase signals

    Publication Year: 1991, Page(s):422 - 430
    Cited by:  Papers (237)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    The measurement of the parameters of complex signals with constant amplitude and polynomial phase, measured in additive noise, is considered. A novel new integral transform that is adapted for signals of this type is introduced. This transform is used to derive estimation and classification algorithms that are simple to implement and that exhibit good performance. The algorithms are extended to co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the maximum tolerable noise for reliable computation by formulas

    Publication Year: 1991, Page(s):388 - 391
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    It is shown that if formulas constructed from error-prone three-input gates are used to compute Boolean functions, then a per-gate failure probability of 1/6 or more cannot be tolerated. The result is shown to be tight if the per-gate failure probability is constant and precisely known View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel systems approach to universal receivers

    Publication Year: 1991, Page(s):291 - 306
    Cited by:  Papers (5)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1488 KB)

    The problem of communication over a channel with unknown characteristics is addressed. The true channel is from a known set of channels, but the transmitter and receiver do not know which of these channels is actually in effect. The goal of a universal receiver is to provide nearly optimal demodulation regardless of the channel that is actually in effect. A parallel receiver implementation is prop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal bit allocation via the generalized BFOS algorithm

    Publication Year: 1991, Page(s):400 - 402
    Cited by:  Papers (134)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    P.H. Westerink et al. (1988) developed an optimal bit allocation algorithm that is simplified when all operational distortion-rate functions (which are referred to as quantizer functions) are convex. This algorithm is restated using the generalized Breiman, Friedman, Olshen, and Stone (BFOS) algorithm (a recently developed technique for variable rate vector quantizer design) for both cases of conv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum-rank array codes and their application to crisscross error correction

    Publication Year: 1991, Page(s):328 - 336
    Cited by:  Papers (140)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    A μ-[n×n,k] array code C over a field F is a k-dimensional linear space of n×n matrices over F such that every nonzero matrix in C has rank ⩾μ. It is first shown that the dimension of such array codes must satisfy the Singleton-like bound k⩽n(n-μ+1). A ... View full abstract»

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

    Publication Year: 1991, Page(s):343 - 345
    Cited by:  Papers (72)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    In the theory of cyclic codes, it is common practice to require that (n,q)=1, where n is the word length and Fq is the alphabet. It is shown that the even weight subcodes of the shortened binary Hamming codes form a sequence of repeated-root cyclic codes that are optimal. In nearly all other cases, one does not find good cyclic codes by dropping the u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary [18,11]2 codes do not exist-Nor do [64,53]2 codes

    Publication Year: 1991, Page(s):349 - 351
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    A binary, linear block code C with block length n and dimension n is commonly denoted by [n, k] or, if its minimum distance is d, by [n, k,d]. The code's covering radius r(C) can be defined as the smallest number r such that any binary column vector of length (n-k) can be w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding capacity for a class of additive channels

    Publication Year: 1991, Page(s):233 - 243
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (980 KB)

    Coding capacity is considered for a class of additive dimension-limited channels. The channels may be with or without memory, stationary or nonstationary. The constraint is partially given in terms of an increasing family of finite-dimensional subspaces. A general expression for the capacity is obtained, which depends on the family of subspaces and the relation between the noise covariance and the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some aspects of fusion in estimation theory

    Publication Year: 1991, Page(s):420 - 422
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    The problem of fusing or combining various estimates to obtain a single good estimate is investigated. The problem of fusion in estimation theory is addressed, and several examples using common distributions in which virtually any method of fusion would be useless in approximating the random variable of interest are presented. A theorem which, for a very general situation, shows that fusion result... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 2-D quasi m-arrays and Gold code arrays

    Publication Year: 1991, Page(s):385 - 388
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    Two-dimensional quasi-maximal-area arrays (quasi-m-arrays) are proposed. These quasi-m-arrays are so named because their cyclic correlation properties are very close to those of the m-arrays. These arrays are generated by modulo-2 addition of maximal length sequences. The cyclic autocorrelation of any quasi-m-array is close to the delta-function. In addition, th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On universal hypotheses testing via large deviations

    Publication Year: 1991, Page(s):285 - 290
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    A prototype problem in hypotheses testing is discussed. The problem of deciding whether an i.i.d. sequence of random variables has originated from a known source P1 or an unknown source P2 is considered. The exponential rate of decrease in type II probability of error under a constraint on the minimal rate of decrease in type I probability of error is chosen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Necessary conditions for good error detection

    Publication Year: 1991, Page(s):375 - 378
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    The problem of determining the error detection capabilities of linear codes where the channel is a binary symmetric channel is addressed. Necessary conditions are given on the number of codewords in an [n,k] linear code and its dual for the probability of an undetected error to be upper bounded by 2-(n-k) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sample converses in source coding theory

    Publication Year: 1991, Page(s):263 - 268
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    The rate and distortion performance of a sequence of codes along a sample sequence of symbols generated by a stationary ergodic information source are studied. Two results are obtained: (1) the source sample sequence is encoded by an arbitrary sequence of block codes which operate at a fixed rate level R, and a sample converse is obtained which states that, with probability one, the lower... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fibonacci representations and finite automata

    Publication Year: 1991, Page(s):393 - 399
    Cited by:  Papers (9)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    Finite-state automata are used as a simple model of computation since only a finite memory is needed. The problem of passing from any representation to the normal representation of an integer within the Fibonacci numeration system, which is called the process of normalization, is addressed. It is shown that the normalization can be realized by means of infinite automata. More precisely, this funct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dense target signal processing

    Publication Year: 1991, Page(s):317 - 327
    Cited by:  Papers (51)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB)

    The problem of determining the density of targets at every range and velocity is addressed. These targets consist of a dense group of reflecting objects moving with different velocities and at different ranges. The problem of how to choose the outgoing signals and process the echoes of those signals from the targets to determine the density function is discussed. The problem is a classical inverse... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On entropy of pyramid structures

    Publication Year: 1991, Page(s):407 - 413
    Cited by:  Papers (21)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    An information-theoretic analysis of multiresolution pyramid structures is presented. The analysis is carried out using the concept of spectral entropy which, for Gaussian sources, is linearly related to the differential entropy. The spectral entropy is used to define the spectral roughness measure that, in turn, is an indicator of the amount of memory in a source. The more the memory in a source,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two extensions of the Viterbi algorithm

    Publication Year: 1991, Page(s):430 - 436
    Cited by:  Papers (24)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    The problem of minimum-cost correction of a corrupted set of data that has been generated by a known finite state machine (FSM) is examined. The Viterbi algorithm is modified to correct insertions and deletions as well as errors, still using a trellis diagram that has the same number of states as the FSM that generates the uncorrupted data. Two problems are examined. In the first problem the data ... View full abstract»

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

    Publication Year: 1991, Page(s):337 - 342
    Cited by:  Papers (78)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    A parity-check matrix for a q-ary repeated-root cyclic code is derived using the Hasse derivative. Then the minimum distance of a q-ary repeated-root cyclic code is expressed in terms of the minimum distance of a certain simple-root cyclic code. With the help of this result, several binary repeated-root cyclic codes of lengths up to n=62 are shown to contain the largest ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The average binary weight-enumerator for a class of generalized Reed-Solomon codes

    Publication Year: 1991, Page(s):346 - 349
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    An explicit weight-enumerator for the set of binary expansions of a class of generalized Reed-Solomon codes is derived. This enumerator is then used to show that most of these binary codes are asymptotically good, and to bound the rates of self-intersecting codes View full abstract»

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

    Publication Year: 1991, Page(s):351 - 365
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1060 KB)

    The covering radius of binary codes is studied. Bounds on K (n,R), the minimum cardinality of any binary code of length n and covering radius R, are found. Modifications of the van Wee lower bounds are proved for K(n,R), the minimal number of codewords in any binary code of length n and covering radius R. The... 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