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
2000, volume: 46, number: 3

  1. John C. Kieffer, En-Hui Yang
    Grammar-based codes: A new class of universal lossless source codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:737-754 [Journal]
  2. En-Hui Yang, John C. Kieffer
    Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform - Part one: Without context models. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:755-777 [Journal]
  3. Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn
    Quantum error detection I: Statement of the problem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:778-788 [Journal]
  4. Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn
    Quantum error detection II: Bounds. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:789-800 [Journal]
  5. Christian Krattenthaler, Paul B. Slater
    Asymptotic redundancies for universal quantum coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:801-819 [Journal]
  6. G. David Forney Jr., Mitchell D. Trott, Sae-Young Chung
    Sphere-bound-achieving coset codes and multilevel coset codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:820-850 [Journal]
  7. Chia-Ning Peng, Houshou Chen, John T. Coffey, Richard G. C. Williams
    Rate gains in block-coded modulation systems with interblock memory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:851-868 [Journal]
  8. Po-Ning Chen, Tzong-Yow Lee, Yunghsiang S. Han
    Distance-spectrum formulas on the largest minimum distance of block codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:869-885 [Journal]
  9. Chaoping Xing, Huaxiong Wang, Kwok-Yan Lam
    Constructions of authentication codes from algebraic curves over finite fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:886-892 [Journal]
  10. Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas
    Tracing traitors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:893-910 [Journal]
  11. Ari Juels, Markus Jakobsson, Elizabeth A. M. Shriver, Bruce Hillyer
    How to turn loaded dice into fair coins. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:911-921 [Journal]
  12. A. Robert Calderbank, Gregory J. Pottie, Nambi Seshadri
    Cochannel interference suppression through time/space diversity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:922-932 [Journal]
  13. Muriel Médard
    The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:933-946 [Journal]
  14. Michael L. McCloud, Louis L. Scharf
    Interference estimation with applications to blind multiple-access communication over fading channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:947-961 [Journal]
  15. Junshan Zhang, Edwin K. P. Chong
    CDMA systems in fading channels: Admissibility, network capacity, and power control. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:962-981 [Journal]
  16. Kyeongcheol Yang, Young-Ky Kim, P. Vijay Kumar
    Quasi-orthogonal sequences for code-division multiple-access systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:982-993 [Journal]
  17. Christophe Andrieu, Arnaud Doucet
    Simulated annealing for maximum a Posteriori parameter estimation of hidden Markov models. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:994-1004 [Journal]
  18. Wenxin Jiang, Martin A. Tanner
    On the asymptotic normality of hierarchical mixtures-of-experts for generalized linear models. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1005-1013 [Journal]
  19. Sameh M. Sowelam, Ahmed H. Tewfik
    Waveform selection in radar target classification. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1014-1029 [Journal]
  20. Zsigmond Nagy, Kenneth Zeger
    Capacity bounds for the three-dimensional (0, 1) run length limited channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1030-1033 [Journal]
  21. Augustus J. E. M. Janssen, Kees A. Schouhamer Immink
    An entropy theorem for computing the capacity of weakly (d, k)-constrained sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1034-1038 [Journal]
  22. Jonathan J. Ashley, Brian H. Marcus
    Time-varying encoders for constrained systems: An approach to limiting error propagation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1038-1043 [Journal]
  23. Ludo M. G. M. Tolhuizen
    New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1043-1046 [Journal]
  24. Marc P. C. Fossorier, Shu Lin
    Differential trellis decoding of convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1046-1053 [Journal]
  25. Iliya Bouyukliev, Sugi Guritman, Vesselin Vavrek
    Some bounds for the minimum length of binary linear codes of dimension nine. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1053-1056 [Journal]
  26. Moshe Ran, Jakov Snyders
    On cyclic reversible self-dual additive codes with odd length over Z22. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1056-1059 [Journal]
  27. Graham H. Norton, Ana Salagean
    On the Hamming distance of linear codes over a finite chain ring. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1060-1067 [Journal]
  28. Mario Blaum, Jehoshua Bruck
    MDS array codes for correcting a single criss-cross error. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1068-1077 [Journal]
  29. Koji Okada, Kaoru Kurosawa
    MDS secret-sharing scheme secure against cheaters. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1078-1081 [Journal]
  30. Jovan Dj. Golic
    Cryptanalysis of three mutually clock-controlled stop/go shift registers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1081-1090 [Journal]
  31. Boris Ryabko, Elena Matchikina
    Fast and efficient construction of an unbiased random sequence. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1090-1093 [Journal]
  32. Mats Näslund, Alexander Russell
    Extraction of optimally unbiased bits from a biased source. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1093-1103 [Journal]
  33. Isaac L. Chuang, Dharmendra S. Modha
    Reversible arithmetic coding for quantum data compression. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1104-1116 [Journal]
  34. Mikihiko Nishiara, Hiroyoshi Morita
    On the AEP of word-valued sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1116-1120 [Journal]
  35. Hamid Jafarkhani, Nariman Farvardin
    Channel-matched hierarchical table-lookup vector quantization. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1121-1125 [Journal]
  36. Han Wu Chen, Kenjiro Yanagi
    Upper bounds on the capacity of discrete-time blockwise white Gaussian channels with feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1125-1131 [Journal]
  37. Fady Alajaji, Nicholas Whalen
    The capacity-cost function of discrete additive noise channels with and without feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1131-1140 [Journal]
  38. George Thomas
    Capacity of the wireless packet collision channel without feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1141-1144 [Journal]
  39. Samit Basu, Yoram Bresler
    A global lower bound on parameter estimation error with periodic distortion functions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1145-1150 [Journal]
  40. Kevin J. Quirk, Laurence B. Milstein, James R. Zeidler
    A performance bound for the LMS estimator. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1150-1158 [Journal]
  41. Lei Wei, Zheng Li, Matthew R. James, Ian R. Petersen
    A minimax robust decoding algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1158-1167 [Journal]
  42. Douglas E. Lake
    Minimum Chernoff entropy and exponential bounds for locating changes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1168-1170 [Journal]
  43. John P. Robinson
    Genetic search for Golomb arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1170-1173 [Journal]
  44. Shaoquan Jiang, Zongduo Dai, Kyoki Imamura
    Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting kappa; symbols within one period. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1174-1177 [Journal]
  45. Daniel J. Costello Jr.
    Fundamentals of convolutional coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1178-1179 [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