The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Maurizio Longo, Tom D. Lookabaugh, Robert M. Gray
    Quantization for decentralized hypothesis testing under communication constraints. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:241-255 [Journal]
  2. John C. Kieffer
    Comparison of two optimum rates for noiseless encoding of a nonstationary information source. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:256-261 [Journal]
  3. John A. Gubner
    On the deterministic-code capacity of the multiple-access arbitrarily varying channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:262-275 [Journal]
  4. Kon Max Wong, Shuang Chen
    The entropy of ordered sequences and order statistics. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:276-284 [Journal]
  5. Thomas K. Philips, Donald F. Towsley, Jack K. Wolf
    On the diameter of a class of random graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:285-288 [Journal]
  6. Dan Hajela
    On computing the minimum distance for faster than Nyquist signaling. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:289-295 [Journal]
  7. Morteza Naraghi-Pour, David L. Neuhoff
    Mismatched DPCM encoding of autoregressive processes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:296-304 [Journal]
  8. Morteza Naraghi-Pour, David L. Neuhoff
    On the continuity of the stationary state distribution of DPCM. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:305-311 [Journal]
  9. Ofir Shalvi, Ehud Weinstein
    New criteria for blind deconvolution of nonminimum phase systems (channels). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:312-321 [Journal]
  10. Upamanyu Madhow, Michael B. Pursley
    Limiting performance of frequency-hop random access. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:322-333 [Journal]
  11. Tassos Nakasis, Anthony Ephremides
    Steady-state behavior of interacting queues-A numerical approach. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:334-346 [Journal]
  12. T. T. Kadota
    A nonlinear optimum-detection problem - I: Theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:347-357 [Journal]
  13. Gerald R. Benitz, James A. Bucklew
    Large deviation rate calculations for nonlinear detectors in Gaussian noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:358-371 [Journal]
  14. Yariv Ephraim, Lawrence R. Rabiner
    On the relations between modeling approaches for speech recognition. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:372-380 [Journal]
  15. Jehoshua Bruck, Moni Naor
    The hardness of decoding linear codes with preprocessing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:381-385 [Journal]
  16. Henk D. L. Hollmann
    Design of test sequences for VLSI self-testing using LFSR. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:386-392 [Journal]
  17. Jehoshua Bruck, Vwani P. Roychowdhury
    On the number of spurious memories in the Hopfield model. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:393-0 [Journal]
  18. Marcel van der Vlugt
    The true dimension of certain binary Goppa codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:397-0 [Journal]
  19. Richard A. Brualdi, Vera Pless
    Orphans of the first order Reed-Muller codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:399-0 [Journal]
  20. Alistair Moffat
    Linear time adaptive arithmetic coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:401-406 [Journal]
  21. Sulaiman Al-Bassam, Bella Bose
    On balanced codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:406-0 [Journal]
  22. József Dénes, Gary L. Mullen, Stephan J. Suchower
    Another generalized Golomb-Posner code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:408-0 [Journal]
  23. Leopold Bömer, Markus Antweiler
    Two-dimensional perfect binary arrays with 64 elements. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:411-0 [Journal]
  24. Zabih Nasseri, Morton Kanefsky
    Doubly adaptive DPCM. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:414-0 [Journal]
  25. Philippe Jacquet, Eric Merle
    Analysis of a stack algorithm for CSMA-CD random length packet communication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:420-0 [Journal]
  26. Evaggelos Geraniotis
    Robust matched filters for noise uncertainty within two alternating capacity classes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:426-0 [Journal]
  27. Pierre Comon, Dinh-Tuan Pham
    Estimating the order of a FIR filter for noise cancellation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:429-0 [Journal]
  28. T. T. Kadota
    A nonlinear optimum-detection problem-II: Simple numerical examples. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:434-0 [Journal]
  29. Kailash Birmiwal
    The minimum codeword length and redundancy in the binary Huffman code for uncertain sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:439-0 [Journal]
  30. Nick J. Patterson, Douglas H. Wiedemann
    Correction to 'The covering radius of the (215, 16) Reed-Muller code is at least 16276' (May 83 354-356). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:443-0 [Journal]
  31. Jovan Dj. Golic, Milorad M. Obradovic
    Correction to 'A lower bound on the redundancy of D-ary Huffman codes' (Nov 87 910-911). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:443- [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