The SCEAS System
Navigation Menu

Journals in DBLP

IEEE Transactions on Information Theory
1992, volume: 38, number: 6

  1. Yoram Baram, Dror Salée
    Lower bounds on the capacities of binary and ternary networks storing sparse random vectors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1633-1647 [Journal]
  2. Zhen Zhang, Chiaming Lo
    Linear inequalities for covering codes: Part II: Triple covering inequalities. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1648-1662 [Journal]
  3. S. C. Porter, Ba-Zhong Shen, Ruud Pellikaan
    Decoding geometric Goppa codes using an extra place. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1663-1676 [Journal]
  4. Chi-chao Chao, Robert J. McEliece, Laif Swanson, Eugene R. Rodemich
    Performance of binary block codes at low signal-to-noise ratios. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1677-1687 [Journal]
  5. Charles T. Retter
    Gaps in the binary weight distributions of Reed-Solomon codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1688-1697 [Journal]
  6. Miroslaw Pawlak
    On the reconstruction aspects of moment descriptors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1698-1708 [Journal]
  7. Yariv Ephraim, Neri Merhav
    Lower and upper bounds on the minimum mean-square error in composite source signal estimation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1709-1724 [Journal]
  8. Imre Csiszár
    Arbitrarily varying channels with general alphabets and states. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1725-1742 [Journal]
  9. Elvino S. Sousa
    Performance of a spread spectrum packet radio network link in a Poisson field of interferers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1743-1754 [Journal]
  10. Xiaolin Wu
    Image coding by adaptive tree-structured segmentation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1755-1767 [Journal]
  11. László Gerencsér
    AR(infty) estimation and nonparametric stochastic complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1768-1778 [Journal]
  12. Yossef Steinberg, Ofer Zeitouni
    On tests for normality. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1779-1787 [Journal]
  13. Kenjiro Yanagi
    Necessary and sufficient condition for capacity of the discrete time Gaussian channel to be increased by feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1788-0 [Journal]
  14. A. Robert Calderbank, Gregory J. Pottie
    Upper bounds for small trellis codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1791-0 [Journal]
  15. Rumen N. Daskalov, Stoyan N. Kapralov
    New minimum distance bounds for certain binary linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1795-0 [Journal]
  16. G. David Forney Jr.
    On the Hamming distance properties of group codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1797-0 [Journal]
  17. Masakatu Morii, Masao Kasahara
    Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1801-0 [Journal]
  18. J. Chen, P. Owsley
    A burst-error-correcting algorithm for Reed-Solomon codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1807-0 [Journal]
  19. Ming Jia, Anader Benyamin-Seeyar, Tho Le-Ngoc
    Exact lower bounds on the codelength of three-step permutation-decodable cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1812-0 [Journal]
  20. B. Sundar Rajan, M. U. Siddiqi
    Transform domain characterization of Abelian codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1817-0 [Journal]
  21. Anders Bjært Sørensen
    Weighted Reed-Muller codes and algebraic-geometric codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1821-0 [Journal]
  22. Hervé Chabanne
    Permutation decoding of Abelian codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1826-0 [Journal]
  23. Han-Ping Tsai
    Existence of some extremal self-dual codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1829-0 [Journal]
  24. Branko Radosavljevic, Erdal Arikan, Bruce E. Hajek
    Sequential decoding of low-density parity-check codes by adaptive reordering of parity checks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1833-0 [Journal]
  25. Edgar N. Gilbert, T. T. Kadota
    The Lempel-Ziv algorithm and message complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1839-0 [Journal]
  26. Wentian Li
    Random texts exhibit Zipf's-law-like word frequency distribution. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1842-0 [Journal]
  27. Marie-José Montpetit, David Haccoun, Gilles Deslauriers
    A branching process analysis of the stack algorithm for variable channel conditions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1845-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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002