The SCEAS System
Navigation Menu

Journals in DBLP

IEEE Transactions on Information Theory
2000, volume: 46, number: 7

  1. John T. Coffey, Matthew Klimesh
    Fundamental limits for information retrieval. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2281-2298 [Journal]
  2. Fang-Wei Fu, Raymond W. Yeung
    On the capacity and error-correcting codes of write-efficient memories. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2299-2314 [Journal]
  3. Anand Ganti, Amos Lapidoth, Ì. Emre Telatar
    Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2315-2328 [Journal]
  4. Mario Blaum, Jehoshua Bruck
    Coding for tolerance and detection of skew in parallel asynchronous communications. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2329-2335 [Journal]
  5. Fred Daneshgaran, Marina Mondin
    Permutation fixed points with application to estimation of minimum distance of turbo codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2336-2349 [Journal]
  6. Jason Thomas Blackford, Dwijendra K. Ray-Chaudhuri
    A transform approach to permutation groups of cyclic codes over Galois rings. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2350-2358 [Journal]
  7. Michio Ozeki
    On covering radii and coset weight distributions of extremal binary self-dual codes of length 56. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2359-2372 [Journal]
  8. Erik Agrell, Alexander Vardy, Kenneth Zeger
    Upper bounds for constant-weight codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2373-2395 [Journal]
  9. Ryoh Fuji-Hara, Ying Miao
    Optical orthogonal codes: Their bounds and new optimal constructions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2396-2406 [Journal]
  10. Marat V. Burnashev
    On identification capacity of infinite alphabets or continuous-time channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2407-2414 [Journal]
  11. Te Sun Han
    Hypothesis testing with the general source. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2415-2427 [Journal]
  12. Tomohiro Ogawa, Hiroshi Nagaoka
    Strong converse and Stein's lemma in quantum hypothesis testing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2428-2433 [Journal]
  13. Wojciech Szpankowski
    Asymptotic average redundancy of Huffman (and other) block codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2434-2443 [Journal]
  14. Gil I. Shamir, Daniel J. Costello Jr.
    Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources - Part 1: The regular case. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2444-2467 [Journal]
  15. András Méhes, Kenneth Zeger
    Performance of quantizers on noisy channels using structured families of codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2468-2476 [Journal]
  16. Xuguang Yang, Kannan Ramchandran
    Optimal subband filter banks for multiple description coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2477-2490 [Journal]
  17. Radu Balan, Ingrid Daubechies, Vinay A. Vaishampayan
    The analysis and design of windowed Fourier frame based multiple description source coding schemes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2491-2536 [Journal]
  18. Jorma Rissanen
    MDL Denoising. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2537-2543 [Journal]
  19. Philip Schniter, C. Richard Johnson Jr.
    Bounds for the MSE performance of constant modulus estimators. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2544-2560 [Journal]
  20. Teng Joon Lim, Yao Ma
    The Kalman Filter as the optimal linear minimum mean-squared error multiuser CDMA detector. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2561-2566 [Journal]
  21. Brian L. Hughes
    Differential Space-Time modulation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2567-2578 [Journal]
  22. Mathias Friese
    On the achievable information rate with peak-power-limited orthogonal frequency-division multiplexing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2579-2587 [Journal]
  23. Omer Gurewitz, Moshe Sidi, Israel Cidon
    The ballot theorem strikes again: Packet loss process distribution. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2588-2595 [Journal]
  24. Carles Padró, Germán Sáez
    Secret sharing schemes with bipartite access structure. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2596-2604 [Journal]
  25. Daniel Augot, Lancelot Pecquet
    A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2605-2614 [Journal]
  26. Agnes E. Heydtmann, Jørn M. Jensen
    On the equivalence of the Berlekamp-Massey and the euclidean algorithms for decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2614-2624 [Journal]
  27. Dian-Wu Yue, Guang-Zeng Feng
    Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2625-2628 [Journal]
  28. Thierry P. Berger
    Goppa and related codes invariant under a prescribed permutation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2628-2633 [Journal]
  29. Antonio Campillo, José Ignacio Farrán, Carlos Munuera
    On the parameters of algebraic-geometry codes related to Arf semigroups. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2634-2638 [Journal]
  30. Cunsheng Ding, Harald Niederreiter, Chaoping Xing
    Some new codes from algebraic curves. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2638-2642 [Journal]
  31. Rumen N. Daskalov, T. Aaron Gulliver
    New quasi-twisted quaternary linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2642-2643 [Journal]
  32. Mattias Svanström
    Constructions of ternary constant-composition codes with weight three. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2644-2647 [Journal]
  33. Hans Georg Schaathun
    The weight hierarchy of product codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2648-2651 [Journal]
  34. Zihuai Lin, Arne Svensson
    New rate-compatible repetition convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2651-2659 [Journal]
  35. Søren Forchhammer, Jørn Justesen
    Bounds on the capacity of constrained two-dimensional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2659-2666 [Journal]
  36. Akiko Kato, Kenneth Zeger
    Partial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2666-2670 [Journal]
  37. Olgica Milenkovic, Bane V. Vasic
    Permutation (d, k) codes: Efficient enumerative coding and phrase length distribution shaping. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2671-2675 [Journal]
  38. Garud Iyengar, Thomas M. Cover
    Growth optimal investment in horse race markets with costs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2675-2683 [Journal]
  39. Lei Li, Bin Yu
    Iterated logarithmic expansions of the pathwise code lengths for exponential families. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2683-2689 [Journal]
  40. Evgueni A. Haroutunian, Ashot N. Harutyunyan, Anahit R. Ghazaryan
    On rate-reliability-distortion function for a robust descriptions system. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2690-2697 [Journal]
  41. Tamás Linder, Ram Zamir, Kenneth Zeger
    On source coding with side-information-dependent distortion measures. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2697-2704 [Journal]
  42. András György, Tamás Linder
    Optimal entropy-constrained scalar quantization of a uniform source. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2704-2711 [Journal]
  43. Hongyan Kuai, Fady Alajaji, Glen Takahara
    Tight error bounds for nonuniform signaling over AWGN channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2712-2718 [Journal]
  44. David N. C. Tse, Sergio Verdú
    Optimum asymptotic multiuser efficiency of randomly spread CDMA. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2718-2722 [Journal]
  45. Qinghua Li, Costas N. Georghiades
    On a geometric view of multiuser detection for synchronous DS/CDMA channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2723-2731 [Journal]
  46. Mamadou Mboup, Phillip A. Regalia
    A gradient search interpretation of the super-exponential algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2731-2734 [Journal]
  47. Bernard C. Picinbono
    Moments and polyspectra of the discrete-time random telegraph signal. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2735-2739 [Journal]
  48. Igor V. Nikiforov
    A simple recursive algorithm for diagnosis of abrupt changes in random signals. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2740-2746 [Journal]
  49. Eric Bax
    Validation of nearest neighbor classifiers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2746-2752 [Journal]
  50. Po-Ning Chen
    Generalization of Gártner-Ellis Theorem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2752-2760 [Journal]
  51. Weiwei Sun
    Lower bounds of the minimal eigenvalue of a Hermitian positive-definite matrix. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2760-2762 [Journal]
  52. Xiao Ma, Xiao-Yi Zhang
    Correction to "Entropy bounds for constrained two-dimensional random fields". [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2763- [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