Rudolf Ahlswede, Imre Csiszár Common randomness in information theory and cryptography - I: Secret sharing. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1121-1132 [Journal]
Henry J. Landau On the density of phase-space expansions. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1152-1156 [Journal]
Neri Merhav Universal decoding for memoryless Gaussian channels with a deterministic interference. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1261-1269 [Journal]
Jacob Ziv, Neri Merhav A measure of relative entropy between individual sequences with application to universal classification. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1270-1279 [Journal]
Neri Merhav, Meir Feder Universal schemes for sequential decision from individual data sequences. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1280-1292 [Journal]
Jonathan J. Ashley Sliding block codes between constrained systems. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1303-1309 [Journal]
Nikhil Balram, José M. F. Moura Noncausal Gauss Markov random fields: Parameter structure and estimation. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1333-1355 [Journal]
Jérôme Idier, Yves Goussard Markov modeling for Bayesian restoration of two-dimensional layered structures. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1356-1373 [Journal]
Gerald R. Benitz Asymptotic results for maximum likelihood estimation with an array of sensors. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1374-1385 [Journal]
Mark Stamp, Clyde F. Martin An algorithm for the k-error linear complexity of binary sequences with period 2n. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1398-0 [Journal]
M. Eugene Meyer, D. V. Gokhale Kullback-Leibler information measure for studying convergence rates of densities and distributions. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1401-0 [Journal]
Rudolf Ahlswede The maximal error capacity of arbitrarily varying channels for constant list sizes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1416-0 [Journal]
Gerhard J. M. van Wee Some new lower bounds for binary and ternary covering codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1422-0 [Journal]
Henk D. L. Hollmann A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1424-0 [Journal]
John A. Gubner Distributed estimation and quantization. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1456-0 [Journal]
Philippe Jacquet Random infinite trees and supercritical behavior of collision resolution algorithms. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1460-0 [Journal]
Venkat Anantharam Correction to 'The Input-Output Map of a Monotone Discrete-Time Quasireversible Node'. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1466-0 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP