The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Martin J. Wainwright, Tommi Jaakkola, Alan S. Willsky
    MAP estimation via agreement on trees: message-passing and linear programming. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3697-3717 [Journal]
  2. Tsachy Weissman, Erik Ordentlich
    The empirical distribution of rate-constrained source codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3718-3733 [Journal]
  3. I. Hen, Neri Merhav
    On the error exponent of trellis source coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3734-3741 [Journal]
  4. Mitsuharu Arimura, Hirosuke Yamamoto
    Asymptotic redundancy of the MTF scheme for stationary ergodic sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3742-3752 [Journal]
  5. Da-ke He, En-Hui Yang
    The universality of grammar-based codes for sources with countably infinite alphabets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3753-3765 [Journal]
  6. D. Endres, P. Földiák
    Bayesian bin distribution inference and mutual information. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3766-3779 [Journal]
  7. Jan Poland, Marcus Hutter
    Asymptotics of discrete MDL for online prediction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3780-3795 [Journal]
  8. Nicolas Bissantz, Hajo Holzmann, Axel Munk
    Testing parametric assumptions on band- or time-limited signals under noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3796-3805 [Journal]
  9. Clayton Scott, Robert D. Nowak
    A Neyman-Pearson approach to statistical learning. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3806-3819 [Journal]
  10. Uri Erez, Shlomo Shamai, Ram Zamir
    Capacity and lattice strategies for canceling known interference. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3820-3833 [Journal]
  11. Michael Lentmaier, Dmitri V. Truhachev, Kamil Sh. Zigangirov, Daniel J. Costello Jr.
    An analysis of the block error probability performance of iterative decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3834-3855 [Journal]
  12. Hajime Matsui, S. Sakata, M. Kurihara, Seiichi Mita
    Systolic array architecture implementing Berlekamp-Massey-Sakata algorithm for decoding codes on a class of algebraic curves. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3856-3871 [Journal]
  13. Andrew W. Eckford, Frank R. Kschischang, Subbarayan Pasupathy
    Analysis of low-density parity-check codes for the Gilbert-Elliott channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3872-3889 [Journal]
  14. Zhenyu Liu, Dimitrios A. Pados
    LDPC codes from generalized polygons. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3890-3898 [Journal]
  15. Niranjan Ratnakar, Ralf Koetter
    Exponential error bounds for algebraic soft-decision decoding of Reed-Solomon codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3899-3917 [Journal]
  16. Amir J. Salomon, Ofer Amrani
    Augmented product codes and lattices: Reed-Muller codes and Barnes-Wall lattices. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3918-3930 [Journal]
  17. Kevin T. Phelps, Josep Rifà, Mercè Villanueva
    Rank and kernel of binary Hadamard codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3931-3937 [Journal]
  18. Tuvi Etzion, Beniamin Mounits
    Quasi-perfect codes with small distance. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3938-3946 [Journal]
  19. Suhas N. Diggavi, Matthias Grossglauser, David N. C. Tse
    Even One-Dimensional Mobility Increases the Capacity of Wireless Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3947-3954 [Journal]
  20. Syed Ali Jafar
    Too much mobility limits the capacity of wireless ad hoc networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3954-3965 [Journal]
  21. Gérard Biau, László Györfi
    On the asymptotic properties of a nonparametric L/sub 1/-test statistic of homogeneity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3965-3973 [Journal]
  22. Saravanan Vijayakumaran, Tan F. Wong, Sndeep R. Aedudodla
    On the asymptotic performance of threshold-based acquisition systems in multipath fading channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3973-3986 [Journal]
  23. Olivier Lévêque, E. Preissmann
    Scaling laws for one-dimensional ad Hoc Wireless networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3987-3991 [Journal]
  24. Y. Cemal, Yossef Steinberg
    The multiple-access channel with partial state information at the encoders. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3992-4003 [Journal]
  25. Tsachy Weissman, Neri Merhav
    On causal source codes with side information. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:4003-4013 [Journal]
  26. András Antos, László Györfi, A. Gyorgy
    Individual convergence rates in empirical vector quantizer design. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:4013-4022 [Journal]
  27. András Antos
    Improved minimax bounds on the test and training distortion of empirically designed vector quantizers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:4022-4032 [Journal]
  28. Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
    Testing Reed-Muller codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:4032-4039 [Journal]
  29. Tali Kaufman, Dana Ron
    A characterization of low-weight words that span generalized reed-muller codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:4039-4043 [Journal]
  30. Henning Stichtenoth, Chaoping Xing
    Excellent nonlinear codes from algebraic function fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:4044-4046 [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