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
1999, volume: 45, number: 2

  1. Simon Litsyn
    New Upper Bounds on Error Exponents. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:385-398 [Journal]
  2. David J. C. MacKay
    Good Error-Correcting Codes Based on Very Sparse Matrices. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:399-431 [Journal]
  3. Mohammad Amin Shokrollahi, Hal Wasserman
    List Decoding of Algebraic-Geometric Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:432-437 [Journal]
  4. Alexei E. Ashikhmin, Alexander Barg
    Binomial Moments of the Distance Distribution: Bounds and Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:438-452 [Journal]
  5. Cunsheng Ding, Vera Pless
    Cyclotomy and Duadic Codes of Prime Lengths. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:453-466 [Journal]
  6. Cunsheng Ding, Tor Helleseth
    Generalized Cyclotomic Codes of Length p1e1 ... ptet. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:467-474 [Journal]
  7. Tor Helleseth, Chunming Rong, Daniel Sandberg
    New Families of Almost Perfect Nonlinear Power Mappings. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:475-485 [Journal]
  8. Renato Menicocci, Jovan Dj. Golic
    Correlation Attacks on Up/Down and Stop/Go Cascades. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:486-498 [Journal]
  9. Ueli M. Maurer, Stefan Wolf
    Unconditionally Secure Key Agreement and the Intrinsic Conditional Information. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:499-514 [Journal]
  10. Mikael Skoglund, Per Hedelin
    Hadamard-Based Soft Decoding for Vector Quantization Over Noisy Channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:515-532 [Journal]
  11. Tamás Linder, Ram Zamir
    High-Resolution Source Coding for Non-Difference Distortion Measures: The Rate-Distortion Function. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:533-547 [Journal]
  12. Tamás Linder, Ram Zamir, Kenneth Zeger
    High-Resolution Source Coding for Non-Difference Distortion Measures: Multidimensional Companding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:548-561 [Journal]
  13. A. Yuan, B. Clarke
    An Information Criterion for Likelihood Selection. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:562-571 [Journal]
  14. Jenn-Sen Leu, Adrian Papamarcou
    Asymptotic Optimality of Likelihood Ratio Threshold Tests in Decentralized Detection. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:572-585 [Journal]
  15. En-Hui Yang, Zhen Zhang
    Variable-Rate Trellis Source Encoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:586-608 [Journal]
  16. Raymond W. Yeung, Zhen Zhang
    On Symmetrical Multilevel Diversity Coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:609-621 [Journal]
  17. Sergio Verdú, Shlomo Shamai
    Spectral Efficiency of CDMA with Random Spreading. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:622-640 [Journal]
  18. David N. C. Tse, Stephen V. Hanly
    Linear Multiuser Receivers: Effective Interference, Effective Bandwidth and User Capacity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:641-657 [Journal]
  19. Stefan Höst, Rolf Johannesson, Kamil Sh. Zigangirov, Victor V. Zyablov
    Active Distances for Convolutional Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:658-669 [Journal]
  20. Vahid Tarokh, Alexander Vardy, Kenneth Zeger
    Universal Bound on the Performance of Lattice Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:670-681 [Journal]
  21. Xiaohong Chen, Halbert White
    Improved Rates and Asymptotic Normality for Nonparametric Neural Network Estimators. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:682-691 [Journal]
  22. Guang Gong, Solomon W. Golomb
    Binary Sequences with Two-Level Autocorrelation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:692-693 [Journal]
  23. Tuvi Etzion
    Linear Complexity of de Brujin Sequences - Old and New Results. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:693-698 [Journal]
  24. Tim Blackmore
    Every Binary (2m-2, 22m-2-m, 3) Code Can Be Lengthened to Form a Perfect Code of Length 2m-1. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:698-700 [Journal]
  25. Thomas Honold, Ivan N. Landjev
    All Reed-Muller Codes Are Linearly Representable over the Ring of Dual Numbers over Z2. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:700-701 [Journal]
  26. T. Aaron Gulliver, Nikolai Senkevitch
    On a Class of Self-Dual Codes Derived from Quadratic Residues. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:701-702 [Journal]
  27. T. Aaron Gulliver, Masaaki Harada
    Codes of Lengths 120 and 136 Meeting the Grey-Rankin Bound and Quasi-Symmetric Designs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:703-706 [Journal]
  28. Hao Chen
    Codes on Garcia-Stichtenoth Curves with True Distance Greater Than Feng-Rao Distance. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:706-709 [Journal]
  29. Carlos Munuera, Domingo Ramirez
    The Second and Third Generalized Hamming Weights of Hermitian Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:709-712 [Journal]
  30. Ilan Reuven, Yair Be'ery
    Generalized Hamming Weights of Nonlinear Codes and the Relation to the Z4-Linear Representation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:713-720 [Journal]
  31. Vladimir Sidorenko, Ian Martin, Bahram Honary
    On the Rectangularity of Nonlinear Block Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:720-725 [Journal]
  32. Robert Morelos-Zaragoza, Toru Fujiwara, Tadao Kasami, Shu Lin
    Constructions of Generalized Concatenated Codes and Their Trellis-Based Decoding Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:725-731 [Journal]
  33. Takuya Koumoto, Toyoo Takata, Tadao Kasami, Shu Lin
    A Low-Weight Trellis-Based Iterative Soft-Decision Decoding Algorithm for Binary Linear Block Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:731-741 [Journal]
  34. Rudolf Ahlswede, Ning Cai
    Arbitrarily Varying Multiple-Access Channels Part I - Ericson's Symmetrizability Is Adequate, Gubner's Conjecture Is True. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:742-749 [Journal]
  35. Rudolf Ahlswede, Ning Cai
    Arbitrarily Varying Multiple-Access Channels - Part II - Correlated Senders' Side Information, Correlated Messages, and Ambiguous Transmission. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:749-756 [Journal]
  36. Te Sun Han, Mitsuru Hamada
    Disjointness of Random Sequence Sets with Respect to Distinct Probability Measures. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:756-760 [Journal]
  37. Harish Viswanathan
    Capacity of Markov Channels with Receiver CSI and Delayed Feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:761-771 [Journal]
  38. Esa Malkamäki, Harry Leib
    Coded Diversity on Block-Fading Channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:771-781 [Journal]
  39. Liuyang Yang, Thomas R. Fischer
    Trellis-Coded Quantization for Binary Erasure Channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:781-787 [Journal]
  40. András Méhes, Kenneth Zeger
    Randomly Chosen Index Assignments Are Asymptotically Bad for Uniform Sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:788-794 [Journal]
  41. Roman Talyansky, Tuvi Etzion, Ron M. Roth
    Efficient Code Construction for Certain Two-Dimensional Constraints. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:794-799 [Journal]
  42. Zoltán Füredi, Miklós Ruszinkó
    An Improved Upper Bound of the Rate of Euclidean Superimposed Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:799-802 [Journal]
  43. Fang-Wei Fu, Torleiv Kløve, Shi-Yi Shen
    On the Hamming Distance Between Two i.i.d. Random n-Tuples over a Finite Set. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:803-807 [Journal]
  44. Eric Bach, Klaus Huber
    Note on Taking Square-Roots Modulo N. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:807-809 [Journal]
  45. Edwin K. P. Chong, I-Jeng Wang, Sanjeev R. Kulkarni
    Noise Conditions for Prespecified Convergence Rates of Stochastic Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:810-814 [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