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: 7

  1. Robert G. Gallager
    Claude E. Shannon: A retrospective on his life, work, and impact. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2681-2695 [Journal]
  2. Gadi Miller, David Burshtein
    Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2696-2710 [Journal]
  3. Yu Kou, Shu Lin, Marc P. C. Fossorier
    Low-density parity-check codes based on finite geometries: A rediscovery and new results. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2711-2736 [Journal]
  4. Marco Breiling, Johannes B. Huber
    Combinatorial analysis of the minimum distance of turbo codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2737-2750 [Journal]
  5. San Ling, Patrick Solé
    On the algebraic structure of quasi-cyclic codes I: Finite fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2751-2760 [Journal]
  6. Bertrand M. Hochwald, Thomas L. Marzetta, Babak Hassibi
    Space-Time autocoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2761-2781 [Journal]
  7. Gerd Beyer, Karin Engdahl, Kamil Sh. Zigangirov
    Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part I. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2782-2792 [Journal]
  8. Gerd Beyer, Karin Engdahl, Kamil Sh. Zigangirov
    Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part II. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2793-2806 [Journal]
  9. Wilfried Meidl, Arne Winterhof
    Lower bounds on the linear complexity of the discrete logarithm in finite fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2807-2811 [Journal]
  10. Zsolt Kukorelly
    The Piling-up approximation in linear cryptanalysis. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2812-2823 [Journal]
  11. Radha Poovendran, John S. Baras
    An information-theoretic approach for design and analysis of rooted-tree-based multicast key management schemes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2824-2834 [Journal]
  12. Barbara Masucci, Douglas R. Stinson
    Efficient metering schemes with pricing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2835-2844 [Journal]
  13. David L. Donoho, Xiaoming Huo
    Uncertainty principles and ideal atomic decomposition. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2845-2862 [Journal]
  14. Elias Masry
    Local linear regression estimation under long-range dependence: Strong consistency and rates. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2863-2875 [Journal]
  15. Sam Efromovich, Vladimir Koltchinskii
    On inverse problems with unknown operators. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2876-2894 [Journal]
  16. Andrew B. Nobel, Terrence M. Adams
    Estimating a function from ergodic samples with additive noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2895-2902 [Journal]
  17. Natalia A. Schmid, Joseph A. O'Sullivan
    Thresholding method for dimensionality reduction in recognition systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2903-2920 [Journal]
  18. Eric M. Rains
    A semidefinite program for distillable entanglement. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2921-2933 [Journal]
  19. K. T. Arasu, Cunsheng Ding, Tor Helleseth, P. Vijay Kumar, Halvard Martinsen
    Almost difference sets and their sequences with optimal autocorrelation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2934-2943 [Journal]
  20. Peter Harremoës, Flemming Topsøe
    Inequalities between entropy and index of coincidence derived from information diagrams. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2944-2960 [Journal]
  21. Vivek K. Goyal, Serap A. Savari, Wei Wang
    On optimal permutation codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2961-2971 [Journal]
  22. Sangsin Na, David L. Neuhoff
    On the support of MSE-optimal, fixed-rate, scalar quantizers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2972-2982 [Journal]
  23. Gianfranco Cariolaro, Tomaso Erseghe, Lorenzo Vangelista
    Exact spectral evaluation of the family of digital pulse interval modulated signals. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2983-2992 [Journal]
  24. Long Duan, Bixio Rimoldi
    The iterative turbo decoding algorithm has fixed points. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2993-2995 [Journal]
  25. Garry Hughes
    A Vandermonde code construction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2995-2998 [Journal]
  26. Gennian Ge, Jianxing Yin
    Constructions for optimal (v, 4, 1) optical orthogonal codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2998-3004 [Journal]
  27. Erik Agrell, Alexander Vardy, Kenneth Zeger
    A table of upper bounds for binary codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:3004-3006 [Journal]
  28. Michael Yung Chung Wei, Lei Wei
    Construction of fast recovery codes using a new optimal importance sampling method. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:3006-3019 [Journal]
  29. Yan Xin, Ivan J. Fair
    Algorithms to enumerate codewords for DC2-constrained channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:3020-3025 [Journal]
  30. Chan Vee Chong, Vahid Tarokh
    A simple encodable/Decodable OFDM QPSK code with low peak-to-mean envelope power ratio. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:3025-3029 [Journal]
  31. Reihaneh Safavi-Naini, Yejing Wang
    New results on frame-proof codes and traceability schemes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:3029-3033 [Journal]
  32. Joseph A. O'Sullivan, Natalia A. Schmid
    Performance analysis of physical signature authentication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:3034-3039 [Journal]
  33. Jovan Dj. Golic
    Iterative optimum symbol-by-symbol decoding and fast correlation attacks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:3040-3049 [Journal]
  34. Wing-Kin Ma, Kon Max Wong, P. C. Ching
    On computing Verdu's upper bound for a class of maximum-likelihood multiuser detection and sequence detection problems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:3049-3053 [Journal]
  35. Michael Kohler, Adam Krzyzak
    Nonparametric regression estimation using penalized least squares. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:3054-3059 [Journal]
  36. Andreas Winter
    The capacity of the quantum multiple-access channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:3059-3065 [Journal]
  37. Alexei E. Ashikhmin, Emanuel Knill
    Nonbinary quantum stabilizer codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:3065-3072 [Journal]
  38. Suhas N. Diggavi, Thomas M. Cover
    The worst additive noise under a covariance constraint. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:3072-3081 [Journal]
  39. Tomohiko Uyematsu
    An algebraic construction of codes for Slepian-Wolf source networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:3082-3088 [Journal]
  40. Dror Baron, Andrew C. Singer
    On the cost of worst case coding length constraints. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:3088-3090 [Journal]
  41. Oliver M. Collins, N. Vasudev
    The effect of redundancy on measurement. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:3090-3096 [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