The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Journals in DBLP

IEEE Transactions on Information Theory
1990, volume: 36, number: 3

  1. Bertrand S. Clarke, Andrew R. Barron
    Information-theoretic asymptotics of Bayes methods. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:453-471 [Journal]
  2. Michael L. Honig, Kenneth Steiglitz, B. Gopinath, Stephen P. Boyd
    Bounds on maximum throughput for digital communications with finite-precision and amplitude constraints. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:472-484 [Journal]
  3. Richard J. Barton, H. Vincent Poor
    An RKHS approach to robust L2 estimation and signal detection. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:485-501 [Journal]
  4. Iickho Song, Saleem A. Kassam
    Locally optimum detection of signals in a generalized observation model: The known signal case. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:502-515 [Journal]
  5. Iickho Song, Saleem A. Kassam
    Locally optimum detection of signals in a generalized observation model: The random signal case. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:516-530 [Journal]
  6. László Györfi, Elias Masry
    The L1 and L2 strong consistency of recursive kernel density estimation from dependent samples. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:531-539 [Journal]
  7. Jørn Justesen, Erik Paaske, Mark Ballan
    Quasi-cyclic unit memory convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:540-547 [Journal]
  8. Agnes Hui Chan, Richard A. Games
    On the linear span of binary sequences obtained from q-ary m-sequences, q odd. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:548-552 [Journal]
  9. Michael J. Wiener
    Cryptanalysis of short RSA secret exponents. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:553-558 [Journal]
  10. Serena M. Zabin, H. Vincent Poor
    Recursive algorithms for identification of impulsive noise channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:559-578 [Journal]
  11. John S. Sadowsky, James A. Bucklew
    On large deviations theory and asymptotically efficient Monte Carlo estimation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:579-588 [Journal]
  12. Dale H. Mugler
    Computationally efficient linear prediction from past samples of a band-limited signal and its derivative. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:589-596 [Journal]
  13. Randall K. Bahr
    Asymptotic analysis of error probabilities for the nonzero-mean Gaussian hypothesis testing problem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:597-607 [Journal]
  14. Tat Simchony, Ramalingam Chellappa, Ze'ev Lichtenstein
    Relaxation algorithms for MAP estimation of gray-level images with multiplicative noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:608-613 [Journal]
  15. Nader Mahravari
    Random-access communication with multiple reception. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:614-0 [Journal]
  16. Feng Guo, Yoichiro Watanabe
    On graphs in which the Shannon capacity is unachievable by finite product. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:622-0 [Journal]
  17. Shlomo Shamai, Israel Bar-David
    On the capacity penalty due to input-bandwidth restrictions with an application to rate-limited binary signaling. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:623-0 [Journal]
  18. Kapil K. Chawla, Dilip V. Sarwate
    Upper bounds on the probability of error for M-ary orthogonal signaling in white Gaussian noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:627-0 [Journal]
  19. P. Vijay Kumar, Chao-Ming Liu
    On lower bounds to the maximum correlation of complex roots-of-unity sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:633-0 [Journal]
  20. Agnes Hui Chan, Mark Goresky, Andrew Klapper
    On the linear complexity of feedback registers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:640-0 [Journal]
  21. Yuichi Saitoh, Kazuhiko Yamaguchi, Hideki Imai
    Some new binary codes correcting asymmetric/unidirectional errors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:645-0 [Journal]
  22. Peter Fuchs, Gerhard Hofer, Günter Pilz
    Codes from planar near rings. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:647-0 [Journal]
  23. W. Cary Huffman
    On extremal self-dual quaternary codes of lengths 18 to 28, I. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:651-0 [Journal]
  24. W. Cary Huffman
    On 3-elements in monomial automorphism groups of quaternary codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:660-0 [Journal]
  25. Wende Chen, Iiro S. Honkala
    Lower bounds for q-ary covering codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:664-0 [Journal]
  26. Mario Blaum
    A family of efficient burst-correcting array codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:671-0 [Journal]
  27. John J. O'Reilly, A. Popplewell
    A further note on DC-free coset codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:675-0 [Journal]
  28. Amer A. Hassan, Wayne E. Stark
    On decoding concatenated codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:677-0 [Journal]
  29. Xiang-dong Hou
    Some results on the norm of codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:683-0 [Journal]
  30. Gilles Lachaud, Jacques Wolfmann
    The weights of the orthogonals of the extended quadratic binary Goppa codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:686-0 [Journal]
  31. Shyue-Win Wei, Che-Ho Wei
    On high-speed decoding of the (23, 12, 7) Golay code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:692-0 [Journal]
  32. Øyvind Ytrehus, Tor Helleseth
    There is no binary [25, 8, 10] code (corresp.). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:695-0 [Journal]
  33. Markus Antweiler, Leopold Bömer, Hans-Dieter Lüke
    Perfect ternary arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:696-0 [Journal]
  34. Jacob Ziv
    Review of 'Open Problems in Communication and Computation' (Cover, T.M., and Gopinath, B., Eds.; 1987). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:706-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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002