IEEE Transactions on Information Theory

Volume 43 Issue 4 • July 1997

Filter Results

Displaying Results 1 - 25 of 39
  • Contributors

    Publication Year: 1997, Page(s):1382 - 1385
    Request permission for commercial reuse | PDF file iconPDF (32 KB)
    Freely Available from IEEE
  • About distances of discrete distributions satisfying the data processing theorem of information theory

    Publication Year: 1997, Page(s):1288 - 1293
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    The distances of discrete probability distributions are considered. Necessary and sufficient conditions for validity of the data processing theorem of information theory are established. These conditions are applied to the Burbea-Rao (1982) divergences and Bregman (1967) distances View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Second-order noiseless source coding theorems

    Publication Year: 1997, Page(s):1339 - 1341
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    Shannon's celebrated source coding theorem can be viewed as a “one-sided law of large numbers”. We formulate second-order noiseless source coding theorems for the deviation of the codeword lengths from the entropy. For a class of sources that includes Markov chains we prove a “one-sided central limit theorem” and a law of the iterated logarithm View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The weight distributions of extended binary primitive BCH codes of length 128

    Publication Year: 1997, Page(s):1364 - 1371
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    In previous work, a method was presented to compute the weight distribution of a linear block code by using its trellis diagram. In this correspondence, the method is improved by using the trellis structure of linear block codes. Another method with reduced computational complexity is also proposed which uses the invariant property of a code. With these methods, the weight distributions of all ext... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources

    Publication Year: 1997, Page(s):1101 - 1111
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    The redundancy problem of the fixed-database Lempel-Ziv (1977) algorithm is considered. It is demonstrated that for a class of φ-mixing sources which includes Markov sources, unifilar sources, and finite-state sources as special cases, the redundancy of the fixed-database Lempel-Ziv algorithm with database size n is lower-bounded by H(loglogn)/logn+O((logloglogn)/logn) and upper-bounded by 2H(... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correlated sources help transmission over an arbitrarily varying channel

    Publication Year: 1997, Page(s):1254 - 1255
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB)

    It is well known that the deterministic code capacity (for the average error probability criterion) of an arbitrarily varying channel (AVC) either equals its random code capacity or zero. Here it is shown that if two components of a correlated source are additionally available to the sender and receiver, respectively, the capacity always equals its random code capacity View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomized fusion rules can be optimal in distributed Neyman-Pearson detectors

    Publication Year: 1997, Page(s):1281 - 1288
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    We show that randomized fusion rules can be locally optimal in distributed detection systems under the Neyman-Pearson criterion. This result is contrary to common belief. We first formulate conditions for a randomized fusion rule to be locally optimal. Then, we present distribution functions of local observations that satisfy these conditions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized state-splitting algorithm

    Publication Year: 1997, Page(s):1326 - 1338
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    We describe a generalization of the state-splitting algorithm (also known as the Adler-Coppersmith-Hassner (1983) algorithm) for constructing encoders which encode arbitrary data into constrained systems of sequences. In the generalized algorithm, we replace approximate eigenvectors with approximate eigenmatrices to yield a framework for designing encoders with smaller sliding-block windows and th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The depth distribution-a new characterization for linear codes

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

    We apply the well-known operator of sequences, the derivative D, on codewords of linear codes. The depth of a codeword c is the smallest integer i such that Dic (the derivative applied i consecutive times) is zero. We show that the depth distribution of the nonzero codewords of an [n, k] linear code consists of exactly k nonzero values, and its generator matrix can be constructed from a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tight bounds on the minimum average weight per branch for rate (N-1)/N convolutional codes

    Publication Year: 1997, Page(s):1301 - 1305
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    Consider a cycle in the state diagram of a convolutional code. The average weight per branch of the cycle is equal to the total Hamming weight of all labels on the branches divided by the number of branches. Let w0 be the minimum average weight per branch over all cycles in the state diagram, except the zero state self-loop of weight zero. Codes with low w0 result in high bit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructions for difference triangle sets

    Publication Year: 1997, Page(s):1346 - 1349
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    Difference triangle sets are useful in many practical problems of information transmission. This article studies combinatorial and computational constructions for difference triangle sets having small scopes. Our algorithms have been used to produce difference triangle sets whose scopes are the best currently known View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved bounds for ternary linear codes of dimension 7

    Publication Year: 1997, Page(s):1377 - 1381
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    New codes of dimension 7 are presented which give improved bounds on the maximum possible minimum distance of ternary linear codes. These codes belong to the class of quasi-cyclic codes, and have been constructed using a stochastic optimization algorithm, tabu search. Thirty-two codes are given which improve or establish the current bounds for ternary codes. In addition, a table of upper and lower... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust and efficient recovery of a signal passed through a filter and then contaminated by non-Gaussian noise

    Publication Year: 1997, Page(s):1184 - 1191
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    Consider a channel where a continuous periodic input signal is passed through a linear filter and then is contaminated by an additive noise. The problem is to recover this signal when we observe n repeated realizations of the output signal. Adaptive efficient procedures, that are asymptotically minimax over all possible procedures, are known for channels with Gaussian noise and no filter (the case... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of the matrix pair method for blind channel identification

    Publication Year: 1997, Page(s):1245 - 1253
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    We study the estimation variance performance of the matrix pair (MP) method for estimating the impulse responses of multiple FIR channels driven by an unknown input sequence. A first-order perturbation analysis of the large-data-size performance of the MP method is presented and an explicit expression for the estimation variance is derived. Both the theoretical and simulation results are used to i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An information-spectrum approach to source coding theorems with a fidelity criterion

    Publication Year: 1997, Page(s):1145 - 1164
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1336 KB)

    The rate-distortion problem for the general class of nonstationary and/or nonergodic sources with an arbitrary distortion measure (not necessarily additive) is studied. We are especially concerned with the case of variable-rate coding under maximum-distortion criterion. It turns out that, in the framework where we cannot readily invoke the standard asymptotic equipartition property, an information... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fact about the logistic distribution

    Publication Year: 1997, Page(s):1280 - 1281
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    For the problem of weak signal detection, the locally optimum test statistic for a known signal in independent and identically distributed (i.i.d.) noise of probability density function f(·) is given. We show that the logistic distribution is the only example for which the locally-optimal nonlinearity has a uniform distribution View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bidirectional sequential decoding

    Publication Year: 1997, Page(s):1319 - 1326
    Cited by:  Papers (18)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    The main drawback of sequential decoding is the variability of its decoding effort which could cause decoding erasures. We propose and analyze an efficient bidirectional sequential decoding (BSD) technique to alleviate this drawback. In the proposed BSD, two decoders are used; one is called a forward decoder (FD), and is used to search the tree from the forward direction; while the other is called... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterization of the Bayes estimator and the MDL estimator for exponential families

    Publication Year: 1997, Page(s):1165 - 1174
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    We analyze the relationship between a minimum description length (MDL) estimator (posterior mode) and a Bayes estimator for exponential families. We show the following results concerning these estimators: (a) both the Bayes estimator with Jeffreys (1961) prior and the MDL estimator with the uniform prior with respect to the expectation parameter are nearly equivalent to a bias-corrected maximum-li... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Elliptic curve cryptosystems using curves of smooth order over the ring Zn

    Publication Year: 1997, Page(s):1231 - 1237
    Cited by:  Papers (7)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    We present a new cryptosystem based on elliptic curves over the ring Zn, where n=pq, in which the message is held in the exponent and not the group element. The security of this system is based on the difficulty of factoring n. A digital signature scheme and ID-based key exchange system are also given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity-constrained trellis quantizers

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

    A reasonable measure of quantizer complexity is the expected number of quanta per input sample for which distortion is computed. Given this measure, a rate-distortion-complexity theory is obtained by extending earlier work in alphabet-constrained rate-distortion theory. Numerical results show that operation on the alphabet-constrained rate-distortion bound can be obtained with a complexity of two.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ergodicity and fourth-order spectral moments

    Publication Year: 1997, Page(s):1273 - 1276
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    Relationships between ergodicity and structures of fourth-order spectral moments are investigated. In particular it is shown that second-order ergodicity of a random process is directly related to the distribution of these moments on the normal manifolds of the frequency domain. This result is illustrated by various examples View full abstract»

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

    Publication Year: 1997, Page(s):1294 - 1300
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    Unlike block codes, n-dimensional lattices can have minimal trellis diagrams with an arbitrarily large number of states, branches, and paths. In particular, we show by a counterexample that there is no f(n), a function of n, such that all rational lattices of dimension n have a trellis with less than f(n) states. Nevertheless, using a theorem due to Hermite, we prove that every integral lattice &L... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Arithmetic crosscorrelations of feedback with carry shift register sequences

    Publication Year: 1997, Page(s):1342 - 1345
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    An arithmetic version of the crosscorrelation of two sequences is defined, generalizing Mandelbaum's (1967) arithmetic autocorrelations. Large families of sequences are constructed with ideal (vanishing) arithmetic crosscorrelations. These sequences are decimations of the 2-adic expansions of rational numbers p/q such that 2 is a primitive root module q View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The multicovering radii of codes

    Publication Year: 1997, Page(s):1372 - 1377
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    The covering radius of a code is the least r such that the set of balls of radius r around codewords covers the entire ambient space. We introduce a generalization of the notion of covering radius. The m-covering radius of a code is the least radius such that the set of balls of that radius covers all m-tuples of elements in the ambient space. We investigate basic properties of m-covering radii. W... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive detection of known signals in additive noise by means of kernel density estimators

    Publication Year: 1997, Page(s):1192 - 1204
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    We consider the problem of detecting known signals contaminated by additive noise with a completely unknown probability density function f. To this end, we propose a new adaptive detection rule. It is defined by plugging a kernel density estimator fˆ of f into the maximum a posteriori (MAP) detector. The estimate fˆ can either be computed off-line from a training sequence or on-line simu... 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