The SCEAS System
Navigation Menu

Journals in DBLP

IEEE Transactions on Information Theory
1985, volume: 31, number: 3

  1. Frans M. J. Willems, Edward C. van der Meulen
    The discrete memoryless multiple-access channel with cribbing encoders. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:313-327 [Journal]
  2. Gérard D. Cohen, Mark G. Karpovsky, H. F. Mattson Jr., James R. Schatz
    Covering radius - Survey and recent results. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:328-343 [Journal]
  3. Jacob Ziv
    On universal quantization. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:344-347 [Journal]
  4. J. Foster, Robert M. Gray, Mari O. Dunham
    Finite-state vector quantization for waveform coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:348-359 [Journal]
  5. S. Natarajan
    Large deviations, hypotheses testing, and source coding for finite Markov chains. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:360-365 [Journal]
  6. Brian H. Marcus
    Sofic systems and encoding data. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:366-377 [Journal]
  7. Lev B. Levitin, Carlos R. P. Hartmann
    A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:378-384 [Journal]
  8. Ronald L. Graham, Neil J. A. Sloane
    On the covering radius of codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:385-401 [Journal]
  9. Nariman Farvardin, James W. Modestino
    Rate-distortion performance of DPCM schemes for autoregressive sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:402-418 [Journal]
  10. Kristien de Bruyn
    Codes for the asymmetric broadcast channel, generated by permutations. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:419-0 [Journal]
  11. Kristien de Bruyn
    An iterative code construction for the broadcast channel with degraded message sets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:422-0 [Journal]
  12. Thomas R. Fischer, P. F. Dahm
    Variance estimation and adaptive quantization. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:428-0 [Journal]
  13. John S. Sadowsky, James A. Bucklew
    On the detectability of weak signals. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:433-0 [Journal]
  14. Philippe Piret
    Binary codes for compound channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:436-0 [Journal]
  15. Alfred M. Bruckstein, Thomas Kailath
    Recursive limited memory filtering and scattering theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:440-0 [Journal]
  16. Y. C. Yao
    Estimation of noisy telegraph processes: Nonlinear filtering versus nonlinear smoothing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:444-0 [Journal]
  17. D. E. Downie, Neil J. A. Sloane
    The covering radius of cyclic codes of length up to 31. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:446-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