The SCEAS System
Navigation Menu

Journals in DBLP

IEEE Transactions on Information Theory
2005, volume: 51, number: 1


  1. 2004 IEEE Information Theory Society Paper Award. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:2-3 [Journal]

  2. 2004 IEEE Communications Society and Information Theory Society Joint Paper Award. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:4- [Journal]
  3. Tsachy Weissman, Erik Ordentlich, Gadiel Seroussi, Sergio Verdú, Marcelo J. Weinberger
    Universal discrete denoising: known channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:5-28 [Journal]
  4. Bo Wang, Junshan Zhang, Anders Høst-Madsen
    On the capacity of MIMO relay channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:29-43 [Journal]
  5. Igor Devetak
    The private classical capacity and quantum capacity of a quantum channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:44-55 [Journal]
  6. Charles H. Bennett, Patrick M. Hayden, Debbie W. Leung, Peter W. Shor, Andreas J. Winter
    Remote preparation of quantum states. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:56-74 [Journal]
  7. Xiaoming Sun, Runyao Duan, Mingsheng Ying
    The existence of quantum entanglement catalysts. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:75-80 [Journal]
  8. Minyue Fu
    Stochastic analysis of turbo decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:81-100 [Journal]
  9. Jing Sun, Oscar Y. Takeshita
    Interleavers for turbo codes using permutation polynomials over integer rings. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:101-119 [Journal]
  10. Michael Luby, Michael Mitzenmacher
    Verification-based decoding for packet-based low-density parity-check codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:120-127 [Journal]
  11. Ingo Steinwart
    Consistency of support vector machines and other regularized kernel classifiers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:128-142 [Journal]
  12. James A. Bucklew
    Conditional importance sampling estimators. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:143-153 [Journal]
  13. Jian-Kang Zhang, Aleksandar Kavcic, Kon Max Wong
    Equal-diagonal QR decomposition and its application to precoder design for successive-cancellation detection. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:154-172 [Journal]
  14. Tommy Guess, Mahesh K. Varanasi
    An information-theoretic framework for deriving canonical decision-feedback receivers in Gaussian channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:173-187 [Journal]
  15. Joel A. Tropp, Inderjit S. Dhillon, Robert W. Heath Jr., Thomas Strohmer
    Designing structured tight frames via an alternating projection method. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:188-209 [Journal]
  16. Christoforos N. Hadjicostis, George C. Verghese
    Coding approaches to fault tolerance in linear dynamic systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:210-228 [Journal]
  17. Weifeng Su, Zoltan Safar, K. J. Ray Liu
    Full-rate full-diversity space-frequency codes with optimum coding advantage. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:229-249 [Journal]
  18. Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
    Bounds on distance distributions in codes of known size. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:250-258 [Journal]
  19. Chaoping Xing
    Goppa geometric codes achieving the Gilbert-Varshamov bound. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:259-264 [Journal]
  20. Nissim Halabi, Guy Even
    Improved bounds on the word error probability of RA(2) codes with linear-programming-based decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:265-280 [Journal]
  21. D. J. Katz
    p-Adic valuation of weights in Abelian codes over /spl Zopf/(p/sup d/). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:281-305 [Journal]
  22. Peter J. Schreier, Louis L. Scharf, Clifford T. Mullis
    Detection and estimation of improper complex random signals. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:306-312 [Journal]
  23. Igor Vajda, Edward C. van der Meulen
    On minimum divergence adaptation of discrete bivariate distributions to given marginals. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:313-320 [Journal]
  24. Garry Bowen, Rajagopal Nagarajan
    On feedback and the classical capacity of a noisy quantum channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:320-324 [Journal]
  25. Ming-Yang Chen, Hua-Chieh Li, Soo-Chang Pei
    Algebraic identification for optimal nonorthogonality 4/spl times/4 complex space-time block codes using tensor product on quaternions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:324-330 [Journal]
  26. Mohammad Gharavi-Alkhansari, Alex B. Gershman
    Constellation space invariance of orthogonal space-time block codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:331-334 [Journal]
  27. Sharon Koubi, Mannque Mata-Montero, Nabil Shalaby
    Using directed hill-climbing for the construction of difference triangle sets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:335-339 [Journal]
  28. Kishan Chand Gupta, Palash Sarkar
    Improved construction of nonlinear resilient S-boxes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:339-348 [Journal]
  29. George N. Karystinos, Dimitrios A. Pados
    The maximum squared correlation, sum capacity, and total asymptotic efficiency of minimum total-squared-correlation binary signature sets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:348-355 [Journal]
  30. Haibin Kan, Hong Shen
    A counterexample for the open problem on the minimal delays of orthogonal designs with maximal rates. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:355-359 [Journal]
  31. Jen-Chun Chang
    Distance-increasing mappings from binary vectors to permutations. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:359-363 [Journal]
  32. Alexander Sokolovsky, Shraga I. Bross
    Attainable error exponents for the Poisson broadcast channel with degraded message sets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:364-374 [Journal]
  33. Holger Boche, Slawomir Stanczak
    Log-convexity of the minimum total power in CDMA systems with certain quality-of-service guaranteed. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:374-381 [Journal]
  34. Wenye Yang, Jerry D. Gibson, Tao He
    Coefficient rate and lossy source coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:381-386 [Journal]
  35. Xiao-Yu Hu, Evangelos Eleftheriou, Dieter-Michael Arnold
    Regular and irregular progressive edge-growth tanner graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:386-398 [Journal]
  36. Todd K. Moon, Jacob H. Gunther
    On the equivalence of two Welch-Berlekamp key equations and their error evaluators. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:399-401 [Journal]
  37. Philippe Gaborit, Carmen-Simona Nedeloaia, Alfred Wassermann
    On the weight enumerators of duadic and quadratic residue codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:402-407 [Journal]
  38. Marten van Dijk, Sebastian Egner, Marcus Greferath, Alfred Wassermann
    On two doubly even self-dual binary codes of length 160 and minimum weight 24. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:408-411 [Journal]
  39. Marc Andre Armand
    List decoding of generalized Reed-Solomon codes over commutative rings. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:411-419 [Journal]
  40. Les Reid, Cameron Wickham
    An elementary construction of codes from the groups of units of residue rings of polynomials. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:419-420 [Journal]
  41. Yonina C. Eldar, Albert M. Chan
    Correction to "On the Asymptotic Performance of the Decorrelator" and "An Optimal Whitening Approach to Linear Multiuser Detection". [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:421-0 [Journal]

  42. Compression and Coding Algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:422-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