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

  1. Vladimir I. Levenshtein
    Efficient reconstruction of sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:2-22 [Journal]
  2. Howard M. Heys
    Information leakage of Feistel ciphers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:23-35 [Journal]
  3. Iwan M. Duursma
    Preparata codes through lattices. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:36-44 [Journal]
  4. Norifumi Kamiya
    On algebraic soft-decision decoding algorithms for BCH codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:45-58 [Journal]
  5. Ilya Dumer
    Soft-decision decoding using punctured codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:59-71 [Journal]
  6. Chunxuan Ye, Raymond W. Yeung
    Some basic properties of fix-free codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:72-87 [Journal]
  7. Andrew Turpin, Alistair Moffat
    On-line adaptive canonical prefix coding with bounded compression loss. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:88-98 [Journal]
  8. Ram Zamir, Kenneth Rose
    Natural type selection in adaptive lossy compression. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:99-111 [Journal]
  9. Takeshi Hashimoto
    Block-definition approaches to source coding with a fidelity citerion. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:112-125 [Journal]
  10. En-Hui Yang, Zhen Zhang
    The redundancy of source coding with a fidelity criterion - Part II: Coding at a fixed rate level with unknown statistics. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:126-145 [Journal]
  11. Zoran Cvetkovic, Martin Vetterli
    On simple oversampled A/D conversion in L2(IR). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:146-154 [Journal]
  12. Helmut Bölcskei, Franz Hlawatsch
    Noise reduction in oversampled filter banks using predictive quantization. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:155-172 [Journal]
  13. Muhammad K. Habib
    Digital representations of operators on band-limited random signals. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:173-177 [Journal]
  14. Ioannis Ch. Paschalidis, Spyridon Vassilaras
    On the estimation of buffer overflow probabilities from measurements. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:178-191 [Journal]
  15. Christopher King, Mary Beth Ruskai
    Minimal entropy of states emerging from noisy quantum channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:192-209 [Journal]
  16. Uri Erez, Ram Zamir
    Error exponents of modulo-additive noise channels with side information at the transmitter. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:210-218 [Journal]
  17. Andrea J. Goldsmith, Michelle Effros
    The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:219-240 [Journal]
  18. Pramod Viswanath, David N. C. Tse, Venkat Anantharam
    Asymptotically optimal water-filling in vector multiple-access channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:241-267 [Journal]
  19. Ralf R. Müller
    Multiuser receivers for randomly spread signals: Fundamental limits with and without decision-feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:268-283 [Journal]
  20. Wei Luo, Anthony Ephremides
    Indecomposable error sequences in multiuser detection. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:284-294 [Journal]
  21. Artur Russ, Mahesh K. Varanasi
    Noncoherent multiuser detection for nonlinear modulation over the Rayleigh-fading channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:295-307 [Journal]
  22. Suhas N. Diggavi
    On achievable performance of spatial diversity fading channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:308-325 [Journal]
  23. Alexey Fedotov, Boris Ryabko
    The estimated cost of a search tree on binary words. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:326-329 [Journal]
  24. Po-Ning Chen, Fady Alajaji
    Csiszár's cutoff rates for arbitrary discrete sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:330-338 [Journal]
  25. Zhiyi Chi
    The first-order asymptotic of waiting times with distortion between stationary processes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:338-347 [Journal]
  26. Chaoping Xing
    Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:347-352 [Journal]
  27. Warwick de Launey, Daniel M. Gordon
    A remark on Plotkin's bound. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:352-355 [Journal]
  28. Tim Blackmore, Graham H. Norton
    On a family of Abelian codes and their state complexities. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:355-361 [Journal]
  29. Alexander Barg, Jørn Justesen, Christian Thommesen
    Concatenated codes with fixed inner code and random outer code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:361-365 [Journal]
  30. Christian Weiß, Christian Bettstetter, Sven Riedel
    Code construction and decoding of parallel concatenated tail-biting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:366-386 [Journal]
  31. Jon-Lark Kim
    New extremal self-dual codes of lengths 36, 38, and 58. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:386-393 [Journal]
  32. Vwani P. Roychowdhury, Farrokh Vatan
    Bounds for the weight distribution of weakly self-dual codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:393-396 [Journal]
  33. YoungJu Choie, Namshik Kim
    The complete weight enumerator of type II codes over Z2m and Jacobi forms. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:396-399 [Journal]
  34. Steven T. Dougherty, Keisuke Shiromoto
    Maximum distance codes over rings of order 4. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:400-404 [Journal]
  35. Mitsuru Hamada
    The burst weight distributions of maximum-hamming-distance-separable codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:404-406 [Journal]
  36. Anne Canteaut
    On the weight distributions of optimal cosets of the first-order Reed-Muller codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:407-413 [Journal]
  37. Tsonka Stefanova Baicheva
    On the covering radius of ternary negacyclic codes with length up to 26. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:413-416 [Journal]
  38. Alexander A. Davydov, Patric R. J. Östergård
    Linear codes with covering radius R = 2, 3 and codimension tR. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:416-421 [Journal]
  39. Pascale Charpin, Aimo Tietäväinen, Victor Zinoviev
    On binary cyclic codes with codewords of weight three and binary sequences with the trinomial property. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:421-425 [Journal]
  40. Thomas W. Cusick, Guang Gong
    A conjecture on binary sequences with the "Trinomial property". [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:426-427 [Journal]
  41. Cunsheng Ding, Tor Helleseth, Halvard Martinsen
    New families of binary sequences with optimal three-level autocorrelation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:428-433 [Journal]
  42. Bruce E. Moision, Alon Orlitsky, Paul H. Siegel
    On codes that avoid specified differences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:433-442 [Journal]
  43. Kenji Nakagawa
    On the optimal Markov chain of IS simulation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:442-446 [Journal]
  44. Wei Shi, Thomas W. Sun, Richard D. Wesel
    Quasi-convexity and optimal binary fusion for distributed detection with identical sensors in generalized Gaussian noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:446-450 [Journal]
  45. George V. Moustakides, H. Vincent Poor
    On the relative error probabilities of linear multiuser detectors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:450-456 [Journal]
  46. Sundeep Rangan, Vivek K. Goyal
    Recursive consistent estimation with bounded noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:457-464 [Journal]
  47. Yann Meurisse, Jean Pierre Delmas
    Bounds for sparse planar and volume arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:464-468 [Journal]
  48. Alfredo De Santis, Antonio Giorgio Gaggia, Ugo Vaccaro
    Bounds on entropy in a guessing game. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:468-473 [Journal]
  49. Rudolf Ahlswede, Peter Löber
    Quantum data processing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:474-478 [Journal]
  50. Christoph Haslach, A. J. Han Vinck
    Correction to "A decoding algorithm with restrictions for array codes". [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:479- [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