Amir Dembo On the capacity of associative memories with linear threshold functions. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:709-720 [Journal]
John K. Karlof Permutation codes for the Gaussian channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:726-732 [Journal]
Sergio Verdú The capacity region of the symbol-asynchronous Gaussian multiple-access channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:733-751 [Journal]
Imre Csiszár, Prakash Narayan Capacity and decoding rules for classes of arbitrarily varying channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:752-769 [Journal]
John S. Sadowsky A dependent data extension of Wald's identity and its application to sequential test performance computation. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:834-842 [Journal]
Alfred O. Hero III Lower bounds on estimator performance for energy-invariant parameters of multidimensional Poisson processes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:843-858 [Journal]
Gang George Yin Asymptotic properties of an adaptive beam former algorithm. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:859-867 [Journal]
Torleiv Kløve Bounds and construction for difference triangle sets. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:879-886 [Journal]
Amir Dembo Simple proof of the concavity of the entropy power with respect to Gaussian noise. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:887-0 [Journal]
Philippe Piret Two results on the permuting mailbox channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:888-0 [Journal]
Kar-Ming Cheung More on the decoder error probability for Reed-Solomon codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:895-0 [Journal]
Gary L. Mullen Permutation polynomials and nonsingular feedback shift registers over finite fields. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:900-0 [Journal]
David M. Mandelbaum Optimal type- B1 convolutional codes of rate 4/5. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:900-0 [Journal]
A. J. Han Vinck, Karel A. Post On the influence of coding on the mean time to failure for degrading memories with defects. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:902-0 [Journal]
G. David Forney Jr. A bounded-distance decoding algorithm for the Leech lattice, with generalizations. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:906-0 [Journal]
John S. Sadowsky Robust large deviations performance analysis for large sample detectors. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:917-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
