IEEE Transactions on Information Theory

Volume 40 Issue 4 • Jul 1994

Filter Results

Displaying Results 1 - 25 of 41
  • On stochastic complexity estimation: a decision-theoretic approach

    Publication Year: 1994, Page(s):1181 - 1191
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    The concept of stochastic complexity developed by Rissanen(1989) leads to consistent probability density estimators. These density estimators are defined to achieve the best compromise between likelihood and simplicity, namely, the stochastic complexity based on the observed sample. In this paper, a density estimation-based complexity decision rule is proposed which uses the quality of these estim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantization based on statistical moments for signal detection: design and analysis

    Publication Year: 1994, Page(s):1192 - 1204
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    This paper addresses a signal detection problem based on a class of quantizers. The known moments of the underlying noise distribution are used to index a set of quantization points that have been predetermined under an assumed noise model. The fact that lower order moments are easy to obtain and that they are required in the implementation and analysis of most threshold detectors makes this appro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A recursive algorithm for computing Cramer-Rao-type bounds on estimator covariance

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

    We give a recursive algorithm to calculate submatrices of the Cramer-Rao (CR) matrix bound on the covariance of any unbiased estimator of a vector parameter θ_. Our algorithm computes a sequence of lower bounds that converges monotonically to the CR bound with exponential speed of convergence. The recursive algorithm uses an invertible “splitting matrix” to successively ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The length of a typical Huffman codeword

    Publication Year: 1994, Page(s):1246 - 1247
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    If pi(i=1,···, N) is the probability of the ith letter of a memoryless source, the length li of the corresponding binary Huffman codeword can be very different from the value -log pi. For a typical letter, however, li≈-logpi. More precisely, Pm -=Σ/sub j∈{i|l<-logpj-m}/pj&... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simplified understanding and efficient decoding of a class of algebraic-geometric codes

    Publication Year: 1994, Page(s):981 - 1002
    Cited by:  Papers (33)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1500 KB)

    An efficient decoding algorithm for algebraic-geometric codes is presented. For codes from a large class of irreducible plane curves, including Hermitian curves, it can correct up to [(d*-1)/2] errors, where d* is the designed minimum distance. With it we also obtain a proof of dmin⩾d* without directly using the Riemann-Roch theorem. The algorithm consists of Gaussian elimination on... View full abstract»

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

    Publication Year: 1994, Page(s):1122 - 1129
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    Lower bounds for K(n, R), the minimal number of codewords of any binary code of length n and covering radius R, are improved. The definition of multiexcess is introduced. A technique combining van Wee's (1991) method and linear inequalities for covering codes is used. A revised table for K(n, R) (n⩽33, R⩽10) is given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cross-correlation of p-ary GMW sequences

    Publication Year: 1994, Page(s):1253 - 1261
    Cited by:  Papers (15)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    The cross-correlation function of p-ary (p prime) GMW sequences is investigated. The well-known m-sequences are incorporated in these sequences. GMW sequences also have the two-level autocorrelation function, but their linear span may be much larger than those of m sequences. The calculation of the cross-correlation function of GMW sequences is reduced to the cross-correlation of the m-sequences b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on achievable convergence rates of parameter estimators via universal coding

    Publication Year: 1994, Page(s):1210 - 1215
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    Lower bounds on achievable convergence rates of parameter estimators towards the true parameter are derived via universal coding considerations. It is shown that for a parametric class of finite-alphabet information sources, if there exists a universal lossless code whose redundancy decays sufficiently rapidly, then it induces a limitation on the fastest achievable convergence rate of any paramete... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructions, families, and tables of binary linear covering codes

    Publication Year: 1994, Page(s):1270 - 1279
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB)

    Presents constructions and infinite families of binary linear covering codes with covering radii R=2,3,4. Using these codes, the authors obtain a table of constructive upper bounds on the length function l(r,R) for r⩽64 and R=2,3,4, where l(r, R) is the smallest length of a binary linear code with given codimension r and covering radius R. They obtain also upper bounds on l(r, R) for r=21, 28,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trellis-coded continuous-phase frequency-shift keying with ring convolutional codes

    Publication Year: 1994, Page(s):1057 - 1067
    Cited by:  Papers (65)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB)

    Trellis-coding techniques are applied to continuous-phase frequency-shift keying (CPFSK). A new coding scheme based on convolutional codes on the ring of integers modulo-P is shown to be a natural way to apply trellis coding to CPFSK. Previous work has decomposed CPFSK into two parts: a linear encoder, with memory called the continuous phase encoder (CPE), and a memoryless modulator (MM), where th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimality of the cell averaging CFAR detector

    Publication Year: 1994, Page(s):1226 - 1228
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    The cell averaging constant false alarm rate detector has been assumed to be optimal for detecting Swerling I targets embedded in exponential clutter and noise of unknown power. This is because the detector uses a minimum variance unbiased estimate (which is also a maximum likelihood estimate) of the unknown clutter-plus-noise power to set the threshold. The authors prove, using a result concernin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalizing the Fano inequality

    Publication Year: 1994, Page(s):1247 - 1251
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    The Fano inequality gives a lower bound on the mutual information between two random variables that take values on an M-element set, provided at least one of the random variables is equiprobable. The authors show several simple lower bounds on mutual information which do not assume such a restriction. In particular, this ran be accomplished by replacing log M with the infinite-order Renyi entropy ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions

    Publication Year: 1994, Page(s):1030 - 1043
    Cited by:  Papers (34)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1264 KB)

    Multilevel constructions of the binary Golay code and the Leech lattice are described. Both constructions are based upon the projection of the Golay code and the Leech lattice onto the (6,3,4) hexacode over GF(4). However, unlike the previously reported constructions, the new multilevel constructions make the three levels independent by way of using a different set of coset representatives for one... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple approach for construction of algebraic-geometric codes from affine plane curves

    Publication Year: 1994, Page(s):1003 - 1012
    Cited by:  Papers (47)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    The current algebraic-geometric (AG) codes are based on the theory of algebraic-geometric curves. In this paper we present a simple approach for the construction of AG codes, which does not require an extensive background in algebraic geometry. Given an affine plane irreducible curve and its set of all rational points, we can find a sequence of monomials xiyj based on the equ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient soft-decision Reed-Solomon decoding algorithm

    Publication Year: 1994, Page(s):1130 - 1139
    Cited by:  Papers (17)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    We develop a computationally efficient soft-decision Reed-Solomon (RS) decoding algorithm. Our new algorithm has direct applications to soft-decision decoding procedures such as the generalized-minimum-distance decoding algorithm. Our particular soft-decision decoding technique is not the innovation of the algorithm. The innovation is a new errors-and-erasures RS decoding algorithm that only works... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary prefix codes ending in a “1”

    Publication Year: 1994, Page(s):1296 - 1302
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    Binary prefix codes with the constraint that each codeword must end with a “1” have been recently introduced by Berger and Yeung (1990). We analyze the performance of such codes by investigating their average codeword length. In particular, we show that a very simple strategy permits the construction of a “1”-ended binary prefix code whose average codeword length is less th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general formula for channel capacity

    Publication Year: 1994, Page(s):1147 - 1157
    Cited by:  Papers (394)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB)

    A formula for the capacity of arbitrary single-user channels without feedback (not necessarily information stable, stationary, etc.) is proved. Capacity is shown to equal the supremum, over all input processes, of the input-output inf-information rate defined as the liminf in probability of the normalized information density. The key to this result is a new converse approach based on a simple new ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum sequence multisets for synchronous code-division multiple-access channels

    Publication Year: 1994, Page(s):1261 - 1266
    Cited by:  Papers (245)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    It is shown that the sum capacity of the symbol-synchronous code-division multiple-access channel with equal average-input-energy constraints is maximized precisely by those spreading sequence multisets that meet Welch's lower bound on total squared correlation. It is further shown that the symmetric capacity of the channel determined by these same sequence multisets is equal to the sum capacity View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on approximate steepest descent for likelihood maximization in exponential families

    Publication Year: 1994, Page(s):1215 - 1218
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    An approximate steepest descent strategy is described, converging in families of regular exponential densities to maximum likelihood estimates of density functions. These density estimates are also obtained by an application of the principle of minimum relative entropy subject to empirical constraints. We prove tight bounds on the increase of the log-likelihood at each iteration of our strategy fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improvement of the Van Wee bound for binary linear covering codes

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

    The Van Wee bound gives a lower bound on the cardinality of (block) codes with a prescribed covering radius. The author presents an improvement of this bound for binary linear codes and compares the results with other bounds mentioned in the literature. Almost all reported bounds can be obtained via the present bound as well; moreover, the present authors obtain a number of new lower bounds View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic aspects of two-dimensional convolutional codes

    Publication Year: 1994, Page(s):1068 - 1082
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1372 KB)

    Two-dimensional (2D) codes are introduced as linear shift-invariant spaces of admissible signals on the discrete plane. Convolutional and, in particular, basic codes are characterized both in terms of their internal properties and by means of their input-output representations. The algebraic structure of the class of all encoders that correspond to a given convolutional code is investigated and th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-order ergodicity of a complex harmonic process

    Publication Year: 1994, Page(s):1228 - 1229
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    The paper deals with high-order moment-ergodic properties of a complex process composed of superimposed sinusoids. This is efficiently achieved using a state-space representation of the signal and Kronecker algebra. First, a simple formulation of the stationarity hypothesis is given, and finally, the moment-ergodic theorem for the associated moments is derived View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures

    Publication Year: 1994, Page(s):1167 - 1180
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1108 KB)

    We consider first the estimation of the order, i.e., the number of states, of a discrete-time finite-alphabet stationary ergodic hidden Markov source (HMS). Our estimator uses a description of the observed data in terms of a uniquely decodable code with respect to a mixture distribution, obtained by suitably mixing a parametric family of distributions on the observation space. This procedure avoid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the maximum entropy of the sum of two dependent random variables

    Publication Year: 1994, Page(s):1244 - 1246
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    Investigates the maximization of the differential entropy h(X+Y) of arbitrary dependent random variables X and Y under the constraints of fixed equal marginal densities for X and Y. We show that max[h(X+Y)]=h(2X), under the constraints that X and Y have the same fixed marginal density f, if and only if f is log-concave. The maximum is achieved when X=Y. If f is not log-concave, the maximum is stri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error-locating pairs for cyclic codes

    Publication Year: 1994, Page(s):1108 - 1121
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1108 KB)

    A general decoding method for linear codes is investigated for cyclic codes. The decoding consists of solving two systems of linear equations. All but four binary cyclic codes of length less than 63 can so be decoded up to their actual distance. A new family of codes is given for which the decoding needs only O(n2) operations 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