Shlomo Shamai On the capacity of a direct-detection photon channel with intertransition-constrained binary input. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1540-1550 [Journal]
Paul C. Shields Cutting and stacking: A method for constructing stationary processes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1605-1617 [Journal]
John K. Goutsias A theoretical analysis of Monte Carlo algorithms for the simulation of Gibbs random field images. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1618-1628 [Journal]
Murk J. Bottema Deterministic properties of analog median filters. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1629-1640 [Journal]
Paul C. Shields The entropy theorem via coding bounds. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1645-0 [Journal]
Rudolf Ahlswede, Ning Cai Two proofs of Pinsker's conjecture concerning arbitrarily varying channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1647-0 [Journal]
Peter J. Smith The distribution functions of certain random geometric series concerning intersymbol interference. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1657-0 [Journal]
Xiang-Gen Xia, Zhen Zhang A note on difference methods for the prediction of band-limited signals from past samples. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1662-0 [Journal]
Patrick Headley A counterexample to a Voronoi constellation conjecture. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1665-0 [Journal]
Kwok-Wai Tam, Yuehua Wu On rates of convergence of general information criteria in signal processing when the noise covariance matrix is arbitrary. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1667-0 [Journal]
Chen-Yu Chang, Shyang Chang Parameter estimator based on a minimum discrepancy criterion: A Bayesian approach. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1671-0 [Journal]
Tuvi Etzion New lower bounds for asymmetric and unidirectional codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1696-0 [Journal]
Ludo M. G. M. Tolhuizen Two new binary codes obtained by shortening a generalized concatenated code. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1705-0 [Journal]
Xiang-dong Hou On the covering radius of subcodes of a code. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1706-0 [Journal]
Miodrag V. Zivkovic On two probabilistic decoding algorithms for binary linear codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1707-0 [Journal]
Gui Liang Feng, Kenneth K. Tzeng Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1716-0 [Journal]
Douglas R. Stinson On bit-serial multiplication and dual bases in GF(2m). [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1733-0 [Journal]
Terry P. Speed Review of 'Stochastic Complexity in Statistical Inquiry' (Rissanen, J.; 1989). [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1739-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
