The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Journals in DBLP

IEEE Transactions on Information Theory
2001, volume: 47, number: 5

  1. Shun-ichi Amari
    Information geometry on hierarchy of probability distributions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1701-1711 [Journal]
  2. Jorma Rissanen
    Strong optimality of the normalized ML models as universal codes and information in data. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1712-1717 [Journal]
  3. Vinay A. Vaishampayan, N. J. A. Sloane, Sergio D. Servetto
    Multiple-description vector quantization with lattice codebooks: Design and analysis. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1718-1734 [Journal]
  4. C. Sinan Güntürk, J. C. Lagarias, Vinay A. Vaishampayan
    On the robustness of single-loop sigma-Delta modulation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1735-1744 [Journal]
  5. Francine Blanchet-Sadri
    On unique, multiset, set decipherability of three-word codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1745-1757 [Journal]
  6. Tor Helleseth, Victor Zinoviev
    On coset weight distributions of the Z4-linear Goethals codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1758-1772 [Journal]
  7. Jacques Wolfmann
    Binary images of cyclic codes over Z4. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1773-1779 [Journal]
  8. Judy L. Walker
    Constructing critical indecomposable codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1780-1795 [Journal]
  9. Gitit Ruckenstein, Ron M. Roth
    Lower bounds on the anticipation of encoders for input-constrained channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1796-1812 [Journal]
  10. Eric K. Hall, Stephen G. Wilson
    Stream-oriented turbo codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1813-1831 [Journal]
  11. William Turin
    MAP Symbol decoding in channels with error bursts. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1832-1838 [Journal]
  12. Adriaan J. de Lind van Wijngaarden, Hiroyoshi Morita
    Partial-prefix synchronizable codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1839-1848 [Journal]
  13. Tsachy Weissman, Neri Merhav, Anelia Somekh-Baruch
    Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1849-1866 [Journal]
  14. Igor Vajda, Edward C. van der Meulen
    Optimization of Barron density estimates. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1867-1883 [Journal]
  15. Jean-Philippe Vert
    Adaptive context trees and text clustering. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1884-1901 [Journal]
  16. Vladimir Koltchinskii
    Rademacher penalties and structural risk minimization. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1902-1914 [Journal]
  17. Ewa Skubalska-Rafajlowicz
    Pattern recognition algorithms based on space-filling curves and orthogonal expansions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1915-1927 [Journal]
  18. Michael L. Honig, Weimin Xiao
    Performance of reduced-rank linear interference suppression. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1928-1946 [Journal]
  19. Jean-Christophe Pesquet, Eric Moreau
    Cumulant-based independence measures for linear mixtures. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1947-1956 [Journal]
  20. D. Richard Brown III, Mehul Motani, Venugopal V. Veeravalli, H. Vincent Poor, C. Richard Johnson Jr.
    On the performance of linear parallel interference cancellation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1957-1970 [Journal]
  21. Giuseppe Caire, Daniela Tuninetti
    The throughput of hybrid-ARQ protocols for the Gaussian collision channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1971-1988 [Journal]
  22. Sennur Ulukus, Roy D. Yates
    Iterative construction of optimum signature sequence sets in synchronous CDMA systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1989-1998 [Journal]
  23. Shraga I. Bross, Marat V. Burnashev, Shlomo Shamai
    Error exponents for the two-user Poisson multiple-access channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1999-2018 [Journal]
  24. Ken-ichi Kanatani, Daniel D. Morris
    Gauges and gauge transformations for uncertainty description of geometric structure with indeterminacy. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2017-2028 [Journal]
  25. Harish Viswanathan, Ram Zamir
    On the whiteness of high-resolution quantization errors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2029-2038 [Journal]
  26. Peter Harremoës
    Binomial and Poisson distributions as maximum entropy distributions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2039-2041 [Journal]
  27. Nader B. Ebrahimi
    Families of distributions characterized by entropy. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2042-2044 [Journal]
  28. Roxana Smarandache, Heide Gluesing-Luerssen, Joachim Rosenthal
    Constructions of MDS-convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2045-2049 [Journal]
  29. José Felipe Voloch
    On the duals of binary BCH codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2050-2051 [Journal]
  30. K. T. Arasu, T. Aaron Gulliver
    Self-dual codes over Fp and weighing matrices. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2051-2055 [Journal]
  31. Hao Chen, San Ling, Chaoping Xing
    Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2055-2058 [Journal]
  32. Hao Chen
    Some good quantum error-correcting codes from algebraic-Geometric codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2059-2061 [Journal]
  33. Fang-Wei Fu, Torleiv Kløve, Yuan Luo, Victor K. Wei
    On the Svanström bound for ternary constant-weight codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2061-2064 [Journal]
  34. Stavros Konstantinidis
    Relationships between different error-correcting capabilities of a code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2065-2069 [Journal]
  35. Suparna Datta, Steven W. McLaughlin
    Optimal block codes for M-ary runlength-constrained channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2069-2078 [Journal]
  36. Girish Ganesan, Petre Stoica
    Achieving optimum coded diversity with scalar codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2078-2080 [Journal]
  37. Yuhong Yang
    Minimax rate adaptive estimation over continuous hyper-parameters. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2081-2085 [Journal]
  38. Tomasz Przebinda, Victor E. DeBrunner, Murad Özaydin
    The optimal transform for the discrete Hirschman uncertainty principle. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2086-2090 [Journal]
  39. Cornelia Rößing, Vahid Tarokh
    A construction of OFDM 16-QAM sequences having low peak powers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2091-2094 [Journal]
  40. Jeong-Heon Kim, Hong-Yeop Song
    On the linear complexity of Hall's sextic residue sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2094-2096 [Journal]
  41. Ron Aharoni, Delman Lee
    On the achievability of the Cramér-Rao bound for Poisson distribution. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2096-2100 [Journal]
  42. David J. C. MacKay
    Errata for "Good error-correcting codes based on very sparse matrices". [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2101- [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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002