The SCEAS System
Navigation Menu

Journals in DBLP

IEEE Transactions on Information Theory
1996, volume: 42, number: 3

  1. A. Lafourcade, Alexander Vardy
    Optimal sectionalization of a trellis. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:689-703 [Journal]
  2. Elwyn R. Berlekamp
    Bounded distance+1 soft-decision Reed-Solomon decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:704-720 [Journal]
  3. Ralf Kotter
    Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:721-737 [Journal]
  4. Marc P. C. Fossorier, Shu Lin
    Computationally efficient soft-decision decoding of linear block codes based on ordered statistics. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:738-750 [Journal]
  5. Mitchell D. Trott, Sergio Benedetto, Roberto Garello, Marina Mondin
    Rotational invariance of trellis codes. Part I. Encoders and precoders. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:751-765 [Journal]
  6. Sergio Benedetto, Roberto Garello, Marina Mondin, Mitchell D. Trott
    Rotational invariance of trellis codes - Part II. Group codes and decoders. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:766-778 [Journal]
  7. Tuvi Etzion, Kenneth G. Paterson
    Near optimal single-track Gray codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:779-789 [Journal]
  8. Luca G. Tallini, Renato M. Capocelli, Bella Bose
    Design of some new efficient balanced codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:790-802 [Journal]
  9. Zhen Zhang, Victor K.-W. Wei
    An on-line universal lossy data compression algorithm via continuous codebook refinement - Part I: Basic results. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:803-821 [Journal]
  10. Zhen Zhang, En-Hui Yang
    An on-line universal lossy data compression algorithm via continuous codebook refinement - Part II. Optimality for phi-mixing source models. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:822-836 [Journal]
  11. Yasutada Oohama
    Universal coding for correlated sources with linked encoders. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:837-847 [Journal]
  12. Hirosuke Yamamoto
    Source coding theory for a triangular communication system. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:848-853 [Journal]
  13. A. S. Khayrallah, David L. Neuhoff
    Coding for channels with cost constraints. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:854-867 [Journal]
  14. Andrea J. Goldsmith, P. P. Varaiya
    Capacity, mutual information, and coding for finite-state Markov channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:868-886 [Journal]
  15. Toby Berger, Zhen Zhang, Harish Viswanathan
    The CEO problem [multiterminal source coding]. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:887-902 [Journal]
  16. Naofal Al-Dhahir, John M. Cioffi
    Efficiently computed reduced-parameter input-aided MMSE equalizers for ML detection: a unified approach. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:903-915 [Journal]
  17. Joseph M. Francos, Anand Narasimhan, John W. Woods
    Maximum-likelihood parameter estimation of the harmonic, evanescent, and purely indeterministic components of discrete homogeneous random fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:916-930 [Journal]
  18. Rick S. Blum
    Locally optimum distributed detection of correlated random signals based on ranks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:931-942 [Journal]
  19. Guotong Zhou, Georgios B. Giannakis
    Polyspectral analysis of mixed processes and coupled harmonics. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:943-958 [Journal]
  20. I. Vaughan L. Clarkson, Jane E. Perkins, Iven M. Y. Mareels
    Number/theoretic solutions to intercept time problems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:959-971 [Journal]
  21. D. W. Gillman, M. Mohtashemi, Ronald L. Rivest
    On breaking a Huffman code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:972-976 [Journal]
  22. A. Kato, Te Sun Han, H. Nagaoka
    Huffman coding with an infinite alphabet. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:977-0 [Journal]
  23. Wai-Man Lam, S. R. Kulkarni
    Extended synchronizing codewords for binary prefix codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:984-987 [Journal]
  24. A. Robert Calderbank, Gary McGuire, Bjorn Poonen, Michael Rubinstein
    On a conjecture of Helleseth regarding pairs of binary m-sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:988-990 [Journal]
  25. Rick S. Blum
    Necessary conditions for optimum distributed sensor detectors under the Neyman-Pearson criterion. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:990-994 [Journal]
  26. Boaz Porat, Benjamin Friedlander
    Asymptotic statistical analysis of the high-order ambiguity function for parameter estimation of polynomial-phase signals. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:995-1001 [Journal]
  27. Jai Krishna Gautam, A. Kumar, R. Saxena
    Corrections to and comments on 'Minimum-bias windows for high-resolution spectral estimates' by Athanasios Papoulis. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:1001- [Journal]
  28. Dan Raphaeli
    Distribution of noncentral indefinite quadratic forms in complex normal variables. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:1002-1007 [Journal]
  29. Nelson M. Blachman
    The shape of low minima of the envelope of narrowband Gaussian noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:1007-1009 [Journal]
  30. Feng-Wen Sun, A. J. Han Vinck
    An algorithm for identifying rate (n-1)/n catastrophic punctured convolutional encoders. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:1010-1013 [Journal]
  31. Vladimir B. Balakirsky
    Estimations of the transfer functions of noncatastrophic convolutional encoders. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:1014-1021 [Journal]
  32. Martin Bossert, Vladimir Sidorenko
    Singleton-type bounds for blot-correcting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:1021-1023 [Journal]
  33. Françoise Levy-dit-Vehel, Simon Litsyn
    More on the covering radius of BCH codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:1023-1028 [Journal]
  34. Tor Helleseth, Torleiv Kløve
    The weight hierarchies of some product codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:1029-1034 [Journal]
  35. Xiang-dong Hou
    On the covering radius of R(1, m) in R(3, m). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:1035-1037 [Journal]
  36. Sylvia B. Encheva
    On binary linear codes which satisfy the two-way chain condition. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:1038-1047 [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