IEEE Transactions on Information Theory

Issue 2 • Mar 1991

Filter Results

Displaying Results 1 - 25 of 34
  • Information capacity of the Poisson channel

    Publication Year: 1991, Page(s):244 - 256
    Cited by:  Papers (38)
    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.
  • 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.
  • 2-D quasi m-arrays and Gold code arrays

    Publication Year: 1991, Page(s):385 - 388
    Cited by:  Papers (12)
    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.
  • Maximum-rank array codes and their application to crisscross error correction

    Publication Year: 1991, Page(s):328 - 336
    Cited by:  Papers (130)  |  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.
  • 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.
  • Bounds for abnormal binary codes with covering radius one

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

    The normality of binary codes is studied. The minimum cardinality of a binary code of length n with covering radius R is denoted by K(n,R). It is assumed that C is an (n,M)R code, that is, a binary code of length n with M codewords and covering radius R. It is shown that if C is an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of disk allocation method using error-correcting codes

    Publication Year: 1991, Page(s):379 - 384
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    The problem of distributing a Cartesian product file on multiple disks to maximize the parallelism for partial match queries is addressed. C. Faloutsos et al. (1989) have proposed an allocation method for Cartesian product files on multiple disks by using linear error-correcting codes. The performance of the allocation method is analyzed. Some conditions under which the allocation method is strict... 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 (50)
    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.
  • Order statistic distributions with multiple windows

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

    Algorithms for computing the distributions of order statistic related estimators with moving or multiple windows are presented. These algorithms may be used to compute joint distributions of moving window estimators, such as moving median filters, or of estimators made from ranking operations on multiple windows, such as many stacked or morphological filters. The presented algorithms make no distr... 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.
  • 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.
  • 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.
  • Some new constant weight codes

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

    A(n,d, w) denotes the maximum cardinality of any binary code of length n, minimum distance d, and constant weight w. The results of a search for good constant weight codes using a combinatorial optimization algorithm are reported. A brief description of the algorithm is given. The problem of constructing a constant weight code of lengt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary linear quasi-perfect codes are normal

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

    Whether quasi-perfect codes are normal is addressed. Let C be a code of length n, dimension k, covering radius R, and minimal distance d. It is proved that C is normal if d⩾2R-1. Hence all quasi-perfect codes are normal. Consequently, any [n,k ]R binary linear code with minimal distance d 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.
  • Constrained solutions in importance via robust statistics

    Publication Year: 1991, Page(s):307 - 316
    Cited by:  Papers (17)
    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.
  • 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.
  • 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.
  • 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.
  • 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.
  • An optimum strategy for detection in the presence of random transient disturbance and white Gaussian noise

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

    Detection of a deterministic signal is considered Because of the presence of the transient disturbance, the traditional totally probabilistic criteria are no longer appropriate, since they cannot be related to the physical reality, as in the case of stationary ergodic noise only. A mixed strategy is proposed for the detection where the disturbance is treated as a semideterministic object while whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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 maximum tolerable noise for reliable computation by formulas

    Publication Year: 1991, Page(s):388 - 391
    Cited by:  Papers (33)
    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.
  • On repeated-root cyclic codes

    Publication Year: 1991, Page(s):337 - 342
    Cited by:  Papers (70)  |  Patents (2)
    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.
  • Classification of pseudo-cyclic MDS codes

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

    Linear codes are considered. A code is characterized by the length n, the dimension k, and the minimum distance d. An [n,k,d] code over the finite field GF(q) is said to be maximum distance separable (MDS) if d=n-k+1. A. Krishna and D.V. Sarwate (1990) investigated the existence of pseudo-cyclic MDS codes ove... 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