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
1997, volume: 43, number: 1

  1. Guy Louchard, Wojciech Szpankowski
    On the average redundancy rate of the Lempel-Ziv code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:2-8 [Journal]
  2. Serap A. Savari
    Redundancy of the Lempel-Ziv incremental parsing rule. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:9-21 [Journal]
  3. Rudolf Ahlswede, Ning Cai, Zhen Zhang
    On interactive communication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:22-37 [Journal]
  4. Amos Lapidoth
    On the role of mismatch in rate distortion theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:38-47 [Journal]
  5. Rudolf Ahlswede, En-Hui Yang, Zhen Zhang
    Identification via compressed data. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:48-70 [Journal]
  6. Zhen Zhang, En-Hui Yang, Victor K. Wei
    The redundancy of source coding with a fidelity criterion: 1. Known statistics. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:71-91 [Journal]
  7. Feng Chen, Zheng Gao, John D. Villasenor
    Lattice vector quantization of generalized Gaussian sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:92-103 [Journal]
  8. T. Kohda, A. Tsuneda
    Statistics of chaotic binary sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:104-112 [Journal]
  9. John T. Coffey, Aaron B. Kiely
    The capacity of coded systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:113-127 [Journal]
  10. Conny Voss, Tom Høholdt
    An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound: The first steps. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:128-135 [Journal]
  11. Dieter Jungnickel, Scott A. Vanstone
    Graphical codes revisited. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:136-146 [Journal]
  12. Jürgen Ganz
    Factoring polynomials using binary representations of finite fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:147-153 [Journal]
  13. Sanjeev R. Kulkarni, M. Vidyasagar
    Learning decision rules for pattern classification under a family of probability measures. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:154-166 [Journal]
  14. L. K. Jones
    The computational intractability of training sigmoidal neural networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:167-173 [Journal]
  15. M. A. Akra, S. K. Mitter
    Waveform recognition in the presence of domain and amplitude noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:174-182 [Journal]
  16. Vladimir Katkovnik
    Nonparametric estimation of instantaneous frequency. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:183-189 [Journal]
  17. N. Parker Willis, Yoram Bresler
    Lattice-theoretic analysis of time-sequential sampling of spatiotemporal signals: I. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:190-207 [Journal]
  18. N. Parker Willis, Yoram Bresler
    Lattice-theoretic analysis of time-sequential sampling of spatiotemporal signals: II. Large space-bandwidth product asymptotics. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:208-220 [Journal]
  19. J. DeLucia, H. Vincent Poor
    Performance analysis of sequential tests between Poisson processes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:221-238 [Journal]
  20. D. Gazelle, Jakov Snyders
    Reliability-based code-search algorithms for maximum-likelihood decoding of block codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:239-249 [Journal]
  21. S. A. Al-Semari, Thomas E. Fuja
    I-Q TCM: reliable communication over the Rayleigh fading channel close to the cutoff rate. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:250-262 [Journal]
  22. Chun-Ye Susan Chang, Peter J. McLane
    Bit-error-probability for noncoherent orthogonal signals in fading with optimum combining for correlated branch diversity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:263-274 [Journal]
  23. Kumar Balachandran, John B. Anderson
    Reduced complexity sequence detection for nonminimum phase intersymbol interference channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:275-279 [Journal]
  24. C. C. Leang, D. H. Johnson
    On the asymptotics of M-hypothesis Bayesian detection. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:280-282 [Journal]
  25. Ewaryst Rafajlowicz
    Consistency of orthogonal series density estimators based on grouped observations. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:283-284 [Journal]
  26. Rossitza Dodunekova, Stefan M. Dodunekov, Torleiv Kløve
    Almost-MDS and near-MDS codes for error detection. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:285-289 [Journal]
  27. John P. Robinson
    Golomb rectangles as folded rulers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:290-293 [Journal]
  28. Jay Cheng, Chi-chao Chao
    On generalized Hamming weights of binary primitive BCH codes with minimum distance one less than a power of two. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:294-298 [Journal]
  29. Heeralal Janwa, Arbind K. Lal
    On the generalized Hamming weights of cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:299-307 [Journal]
  30. Iliya Boukliev, Stoyan N. Kapralov, Tatsuya Maruta, M. Fukui
    Optimal linear codes of dimension 4 over F5. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:308-313 [Journal]
  31. T. Aaron Gulliver, Vijay K. Bhargava
    New optimal binary linear codes of dimensions 9 and 10. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:314-318 [Journal]
  32. Han-Ping Tsai
    The covering radius of extremal self-dual code D11 and its application. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:316-318 [Journal]
  33. Tuvi Etzion
    Cascading methods for runlength-limited arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:319-323 [Journal]
  34. M. F. Hole, Øyvind Ytrehus
    Two-step trellis decoding of partial unit memory convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:324-329 [Journal]
  35. Joachim Rosenthal, Eric V. York
    On the generalized Hamming weights of convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:330-334 [Journal]
  36. E. A. Gelblum, A. Robert Calderbank
    A forbidden rate region for generalized cross constellations. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:335-341 [Journal]
  37. I. J. Fair, Qiang Wang, Vijay K. Bhargava
    Characteristics of guided scrambling encoders and their coded sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:342-346 [Journal]
  38. M. J. Durst
    The progressive transmission disadvantage. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:347-349 [Journal]
  39. J. Chow, T. Berger
    Failure of successive refinement for symmetric Gaussian mixtures. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:350-351 [Journal]
  40. Ping Wah Wong
    Rate distortion efficiency of subband coding with crossband prediction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:352-355 [Journal]
  41. John K. Karlof, Yaw O. Chang
    Optimal permutation codes for the Gaussian channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:356-358 [Journal]
  42. W. Wesley Peterson
    A note on permutation modulation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:359-360 [Journal]
  43. H. D. Luke
    Almost-perfect polyphase sequences with small phase alphabet. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:361-362 [Journal]
  44. Leonid A. Bassalygo, Mark S. Pinsker
    On codes correcting weakly localized errors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:363-364 [Journal]
  45. H. D. Luke
    Binary odd-periodic complementary sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:365-367 [Journal]
  46. M. Ruszinko, Peter Vanroose
    How an Erdöos-Rényi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:368-372 [Journal]
  47. Alister G. Burr, Timothy J. Lunn
    Block-coded modulation optimized for finite error rate on the white Gaussian noise channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:373-0 [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