The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Bart Verboven, Edward C. van der Meulen
    Capacity bounds for identification via broadcast channels which are optimal for the deterministic broadcast channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1197-1205 [Journal]
  2. Peter Mathys
    A class of codes for a T active users out of N multiple-access communication system. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1206-1219 [Journal]
  3. Robert M. Gray
    Quantization noise spectra. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1220-1244 [Journal]
  4. Neri Merhav, Jacob Ziv
    On universally efficient estimation of the first order autoregressive parameter and universal data compression. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1245-1254 [Journal]
  5. Morteza Naraghi-Pour, David L. Neuhoff
    Convergence of the projection method for an autoregressive process and a matched DPCM code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1255-1264 [Journal]
  6. Evaggelos Geraniotis, Yawgeng A. Chau
    Robust data fusion for multisensor detection systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1265-1279 [Journal]
  7. David Pearson, S. Unnikrishna Pillai, YoungJik Lee
    An algorithm for near-optimal placement of sensor elements. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1280-1284 [Journal]
  8. John D. Gorman, Alfred O. Hero III
    Lower bounds for parametric estimation with constraints. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1285-1301 [Journal]
  9. Steven B. Lowen, Malvin Carl Teich
    Power-law shot noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1302-1318 [Journal]
  10. John H. Conway, Neil J. A. Sloane
    A new upper bound on the minimal distance of self-dual codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1319-1333 [Journal]
  11. Andries E. Brouwer, James B. Shearer, Neil J. A. Sloane, Warren D. Smith
    A new table of constant weight codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1334-1380 [Journal]
  12. Frank H. Böinck, Henk C. A. van Tilborg
    Constructions and bounds for systematic t EC/AUED codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1381-1390 [Journal]
  13. Philippe Piret
    Analysis of a modified Hebbian rule. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1391-1397 [Journal]
  14. Bruce E. Hajek
    Performance of global load balancing of local adjustment. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1398-1414 [Journal]
  15. Wolfgang H. Kliemann, Giorgio Koch, Federico Marchetti
    On the unnormalized solution of the filtering problem with counting process observations. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1415-1425 [Journal]
  16. Lawrence H. Ozarow, Aaron D. Wyner
    On the capacity of the Gaussian channel with a finite number of input levels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1426-0 [Journal]
  17. Shlomo Shamai, Aaron D. Wyner
    A binary analog to the entropy-power inequality. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1428-0 [Journal]
  18. B. S. Chow, W. P. Birkemeier
    A new recursive filter for systems with multiplicative noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1430-0 [Journal]
  19. Toby Berger, Raymond W. Yeung
    Optimum '1' ended binary prefix codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1435-0 [Journal]
  20. David Hertz, Yehuda Azenkot
    On a class of multilevel universal source coding schemes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1442-0 [Journal]
  21. Bruce L. Montgomery, Harvey Diamond, B. V. K. Vijaya Kumar
    Bit probabilities of optimal binary source codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1446-0 [Journal]
  22. Ender Ayanoglu
    On optimal quantization of noisy sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1450-0 [Journal]
  23. John T. Coffey, Rodney M. Goodman
    Any code of which we cannot think is good. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1453-0 [Journal]
  24. Serge G. Vladut
    On the decoding of algebraic-geometric codes over Fq for q>=16. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1461-0 [Journal]
  25. Gérald E. Séguin, Germain Drolet
    The trace description of irreducible quasi-cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1463-0 [Journal]
  26. Gerhard J. M. van Wee
    Binary coveting codes are normal. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1466-0 [Journal]
  27. Patrick Solé
    Asymptotic bounds on the covering radius of binary codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1470-0 [Journal]
  28. Aimo Tietäväinen
    An upper bound on the covering radius as a function of the dual distance. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1472-0 [Journal]
  29. Margaret Ann Bernard, Bhu Dev Sharma
    A lower bound on average crowded length of variable length error-correcting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1474-0 [Journal]
  30. Xiang-dong Hou
    An improved sphere covering bound for the codes with n = 3R + 2. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1476-0 [Journal]
  31. Ning Zhang, Solomon W. Golomb
    On the crosscorrelation of generalized Barker sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1478-0 [Journal]
  32. Patrick Fitzpatrick, Graham H. Norton
    Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1480-0 [Journal]
  33. Leopold Bömer, Markus Antweiler
    Periodic complementary binary sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1487-0 [Journal]
  34. Eric Bach
    A note on square roots in finite fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1494-0 [Journal]
  35. Antoine Lobstein, Gerhard J. M. van Wee
    Correction to 'On normal and subnormal q-ary codes' (Nov 89 1291-1295). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1498-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