The SCEAS System
Navigation Menu

Journals in DBLP

IEEE Transactions on Information Theory
1984, volume: 30, number: 2

  1. Odile Macchi
    Guest Editorial by Odile M. Macchi, Member IEEE. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:131-133 [Journal]
  2. M. Watanabe
    The 2r th mean convergence of adaptive filters with stationary dependent random variables. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:134-139 [Journal]
  3. M. Metivier, P. Priouret
    Applications of a Kushner and Clark lemma to general classes of stochastic algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:140-150 [Journal]
  4. Lennart Ljung
    Analysis of stochastic gradient algorithms for linear regression problems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:151-160 [Journal]
  5. Odile Macchi, Eweda Eweda
    Convergence analysis of self-adaptive equalizers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:161-176 [Journal]
  6. Harold J. Kushner, A. Shwartz
    Weak convergence and asymptotic properties of adaptive filters with constant gains. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:177-182 [Journal]
  7. R. R. Bitmead
    Persistence of excitation conditions and the convergence of adaptive schemes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:183-190 [Journal]
  8. Allen Gersho
    Adaptive filtering with binary reinforcement. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:191-198 [Journal]
  9. H. Clergeot
    Filter-order selection in adaptive maximum likelihood estimation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:199-210 [Journal]
  10. Bernard Widrow, E. Walach
    On the statistical efficiency of the LMS algorithm with nonstationary inputs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:211-221 [Journal]
  11. Hanoch Lev-Ari, Thomas Kailath, John M. Cioffi
    Least-squares adaptive lattice and transversal filters: A unified geometric theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:222-236 [Journal]
  12. C. Richard Johnson Jr.
    Adaptive IIR filtering: Current results and open issues. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:237-250 [Journal]
  13. I. D. Landau
    A feedback system approach to adaptive filtering. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:251-261 [Journal]
  14. László Györfi
    Adaptive linear procedures under general conditions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:262-267 [Journal]
  15. V. B. Lawrence, T. L. Lim
    The effect of bias on the linear canceller. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:268-274 [Journal]
  16. E. Walach, Bernard Widrow
    The least mean fourth (LMF) adaptive algorithm and its family. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:275-282 [Journal]
  17. Benjamin Friedlander, J. O. Smith
    Analysis and performance evaluation of an adaptive notch filter. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:283-298 [Journal]
  18. Shigeichi Hirasawa, Masao Kasahara, Yasuo Sugiyama, Toshihiko Namekawa
    Modified product codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:299-305 [Journal]
  19. John G. Cleary, Ian H. Witten
    A comparison of enumerative and adaptive codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:306-315 [Journal]
  20. Kenneth S. Vastola, Harold Vincent Poor
    Robust Wiener-Kolmogorov theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:316-327 [Journal]
  21. Sergio Verdú, Harold Vincent Poor
    On minimax robustness: A general approach and applications. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:328-340 [Journal]
  22. James A. Bucklew
    Two results on the asymptotic performance of quantizers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:341-347 [Journal]
  23. Jacob Ziv
    Fixed-rate encoding of individual sequences with side information. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:348-352 [Journal]
  24. G. L. Katsman, Michael A. Tsfasman, Serge G. Vladut
    Modular curves and codes with a polynomial construction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:353-355 [Journal]
  25. Sherman Stein
    Packings of Rn by certain error spheres. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:356-363 [Journal]
  26. W. Hamaker, Sherman Stein
    Combinatorial packings of R3 by certain error spheres. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:364-368 [Journal]
  27. Thomas M. Cover
    An algorithm for maximizing expected log investment return. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:369-373 [Journal]
  28. Kenneth S. Vastola, Harold Vincent Poor
    On the p-point uncertainty class. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:374-0 [Journal]
  29. Helmut Jürgensen
    A note on the Arimoto-Blahut algorithm for computing the capacity of discrete memoryless channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:376-0 [Journal]
  30. Shunsuke Ihara
    Maximum entropy spectral analysis and ARMA processes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:377-0 [Journal]
  31. Alexander V. Trushkin
    Monotony of Lloyd's method II for log-concave density and convex error weighting function. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:380-0 [Journal]
  32. Ian W. McKeague
    On the converse to the coding theorem for the continuous time white Gaussian channel with feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:383-0 [Journal]
  33. J. F. Huang, Saligram G. S. Shiva, Gérald E. Séguin
    On certain projective geometry codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:385-0 [Journal]
  34. Torleiv Kløve
    The probability of undetected error when a code is used for error correction and detection. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:388-0 [Journal]
  35. L. M. H. E. Driessen
    On an infinite series of [4n, 2n] binary codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:392-0 [Journal]
  36. Tor Helleseth
    Further classifications of codes meeting the Griesmer bound. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:395-0 [Journal]
  37. G. F. M. Beenker
    A note on extended quadratic residue codes over GF(9) and their ternary images. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:403-0 [Journal]
  38. J. C. C. M. Remijn, Cornelis de Vroedt
    The minimum distance of the [38, 19] ternary extended QR-code is 11. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:405-0 [Journal]
  39. Don Coppersmith, Gadiel Seroussi
    On the minimum distance of some quadratic residue codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:407-0 [Journal]
  40. Shih-Chun Chang
    Further results on coding for T-user multiple-access channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:411-0 [Journal]
  41. Don R. Halverson, Gary L. Wise
    Asymptotic memoryless discrete-time detection of phi-mixing signals in phi-mixing noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:415-0 [Journal]
  42. Kiran M. Rege
    Min-max linear estimation of band-limited sequences in the presence of random noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:417-0 [Journal]
  43. Don R. Halverson, Gary L. Wise
    Approximately optimal memoryless detection of random signals in dependent noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:420-0 [Journal]
  44. D. B. Hoang, M. J. T. Ng
    Optimal smoother for discrete time point processes with finite-state Markov rate. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:425-0 [Journal]
  45. Chong-Yung Chi, Jerry M. Mendel
    Improved maximum-likelihood detection and estimation of Bernoulli-Gaussian processes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:429-0 [Journal]
  46. Gianfranco L. Pierobon
    Codes for zero spectral density at zero frequency. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:435-0 [Journal]
  47. T. P. McGree, George R. Cooper
    Upper bounds and construction techniques for signal sets with constrained synchronous correlation and specified time-bandwidth product. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:439-0 [Journal]
  48. Ezio Biglieri
    Probability of error for digital systems with inaccurately known interference. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:443-0 [Journal]
  49. Victor A. Vilnrotter, Eugene R. Rodemich
    A generalization of the near-optimum binary coherent state receiver concept. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:446-0 [Journal]
  50. P. Vijay Kumar
    On bent sequences and generalized bent functions (Ph.D. thesis abstr.). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:450-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