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
1991, volume: 37, number: 2

  1. Charles R. Baker
    Coding capacity for a class of additive channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:233-243 [Journal]
  2. Michael R. Frey
    Information capacity of the Poisson channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:244-256 [Journal]
  3. John C. Kieffer
    Strong converses in source coding relative to a fidelity criterion. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:257-262 [Journal]
  4. John C. Kieffer
    Sample converses in source coding theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:263-268 [Journal]
  5. William H. R. Equitz, Thomas M. Cover
    Successive refinement of information. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:269-275 [Journal]
  6. T. T. Kadota
    An optimum strategy for detection in the presence of random transient disturbance and white Gaussian noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:276-284 [Journal]
  7. Ofer Zeitouni, Michael Gutman
    On universal hypotheses testing via large deviations. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:285-290 [Journal]
  8. Upamanyu Madhow, Michael B. Pursley
    A parallel systems approach to universal receivers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:291-306 [Journal]
  9. Geoffrey C. Orsak, Behnaam Aazhang
    Constrained solutions in importance sampling via robust statistics. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:307-316 [Journal]
  10. Harold Naparst
    Dense target signal processing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:317-327 [Journal]
  11. Ron M. Roth
    Maximum-rank array codes and their application to crisscross error correction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:328-336 [Journal]
  12. Guy Castagnoli, James L. Massey, Philipp A. Schoeller, Niklaus von Seemann
    on repeated-root cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:337-342 [Journal]
  13. Jacobus H. van Lint
    Repeated-root cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:343-0 [Journal]
  14. Charles T. Retter
    The average binary weight-enumerator for a class of generalized Reed-Solomon codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:346-0 [Journal]
  15. Øyvind Ytrehus
    Binary [18, 11]2 codes do not exist - Nor do [64, 53]2 codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:349-0 [Journal]
  16. Iiro S. Honkala
    Modified bounds for coveting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:351-0 [Journal]
  17. Jens P. Pedersen, Carsten Dahl
    Classification of pseudo-cyclic MDS codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:365-0 [Journal]
  18. Klaus-Uwe Koschnick
    Some new constant weight codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:370-0 [Journal]
  19. Iiro S. Honkala, Heikki O. Hämäläinen
    Bounds for abnormal binary codes with covering radius one. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:372-0 [Journal]
  20. Patrick Perry
    Necessary conditions for good error detection. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:375-0 [Journal]
  21. Xiang-dong Hou
    Binary linear quasi-perfect codes are normal. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:378-0 [Journal]
  22. Toru Fujiwara, Minoru Ito, Tadao Kasami, Mitsuteru Kataoka, Jun Okui
    Performance analysis of disk allocation method using error-correcting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:379-0 [Journal]
  23. Chung J. Kuo, Harriett B. Rigas
    2-D quasi m -arrays and Gold code arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:385-0 [Journal]
  24. Bruce E. Hajek, Timothy Weller
    On the maximum tolerable noise for reliable computation by formulas. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:388-0 [Journal]
  25. Paul Fortier
    On the number of points on shells for shifted Z^4n lattices. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:391-0 [Journal]
  26. Christiane Frougny
    Fibonacci representations and finite automata. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:393-0 [Journal]
  27. Eve A. Riskin
    Optimal bit allocation via the generalized BFOS algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:400-0 [Journal]
  28. Rick S. Blum, Saleem A. Kassam
    Asymptotically optimum quantization with time invariant breakpoints for signal detection. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:402-0 [Journal]
  29. R. Padmanabha Rao, William A. Pearlman
    On entropy of pyramid structures. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:407-0 [Journal]
  30. Brian L. Hughes
    Interleaving and the arbitrarily varying channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:413-0 [Journal]
  31. Eric B. Hall, Alan E. Wessel, Gary L. Wise
    Some aspects of fusion in estimation theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:420-0 [Journal]
  32. Shimon Peleg, Boaz Porat
    Estimation and classification of polynomial-phase signals. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:422-0 [Journal]
  33. Anastasios T. Bouloutas, George W. Hart, Mischa Schwartz
    Two extensions of the Viterbi algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:430-0 [Journal]
  34. Charles G. Boncelet Jr.
    Order statistic distributions with multiple windows. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:436-0 [Journal]
  35. John M. Cioffi
    Review of 'Digital Transmission of Information' (Blahut, R.; 1990). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:443-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