The SCEAS System
Navigation Menu

Journals in DBLP

IEEE Transactions on Information Theory
1981, volume: 27, number: 3

  1. Lee D. Davisson, Robert J. McEliece, Michael B. Pursley, Mark S. Wallace
    Efficient universal noiseless source codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:269-279 [Journal]
  2. Christopher B. Jones
    An efficient coding system for long source sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:280-291 [Journal]
  3. Thomas M. Cover, Cyril S. K. Leung
    An achievable rate region for the multiple-access channel with feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:292-298 [Journal]
  4. Hirosuke Yamamoto
    Source coding theory for cascade and branching communication systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:299-307 [Journal]
  5. Robert J. Fontana, Robert M. Gray, John C. Kieffer
    Asymptotically mean stationary channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:308-316 [Journal]
  6. James W. Sennott, Linn I. Sennott
    A queueing model for analysis of a bursty multiple-access communication channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:317-321 [Journal]
  7. Thomas H. E. Ericson
    Modulation by means of linear periodic filtering. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:322-326 [Journal]
  8. Neil J. A. Sloane
    Tables of sphere packings and spherical codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:327-338 [Journal]
  9. Roland G. Wilson
    Orthogonal multilevel pseudorandom sequences and impulse sequences derived from them. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:339-342 [Journal]
  10. Bradley W. Dickinson
    Properties and applications of Gaussian autoregressive processes in detection theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:343-0 [Journal]
  11. Takeshi Hashimoto, Suguru Arimoto
    A hierarchy of codes for memoryless channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:348-0 [Journal]
  12. Shigeichi Hirasawa, Masao Kasahara, Yasuo Sugiyama, Toshihiko Namekawa
    An improvement of error exponents at low rates for the generalized version of concatenated codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:350-0 [Journal]
  13. Ezio Biglieri
    The computational cutoff rate of channels having memory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:352-0 [Journal]
  14. John B. Anderson
    Simulated error performance of multi-h phase codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:357-0 [Journal]
  15. László Györfi
    The rate of convergence of kn-NN regression estimates and classification rules. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:362-0 [Journal]
  16. Wlodzimierz Greblicki
    Asymptotic efficiency of classifying procedures using the Hermite series estimate of multivariate probability densities. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:364-0 [Journal]
  17. Jorge I. Galdos
    A rate distortion theory lower bound on desired function filtering error. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:366-0 [Journal]
  18. William A. Gardner
    Design of nearest prototype signal classifiers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:368-0 [Journal]
  19. Panayota Papantoni-Kazakos
    Sliding block encoders that are rho-bar continuous functions of their input. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:372-0 [Journal]
  20. Dimitris Anastassiou, David J. Sakrison
    A probability model for simple closed random curves. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:376-0 [Journal]
  21. Panlop Zeephongsekul
    Almost total information convergence of order alpha for a sequence of point processes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:381-0 [Journal]
  22. Choon Peng Tan
    On the entropy of the Malay language. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:383-0 [Journal]
  23. Neil J. A. Sloane
    Review of 'Projective Geometries over Finite Fields' (J. W. P. Hirschfeld, 1979). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:385-0 [Journal]
  24. Peter E. Caines
    Review of 'Linear Systems' (T. Kailath, 1980). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:385- [Journal]
  25. Aurel A. Lazar
    Optimal information processing using counting point process observations (Ph.D. Thesis abstr.). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:387- [Journal]
  26. Kou-Hu Tzou
    Digital decoding of convolutional codes (Thesis abstr.). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:387- [Journal]
  27. Mark D. Vanstrum
    An algorithm for optimal linear map (M.S. Thesis abstr.). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:387-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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002