The SCEAS System
Navigation Menu

Journals in DBLP

IEEE Transactions on Information Theory
1983, volume: 29, number: 6

  1. Takeshi Hashimoto
    Source coding for average rate and average distortion: New variable-length coding theorems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:785-792 [Journal]
  2. John C. Kieffer, James George Dunham
    On a type of stochastic stability for a class of encoding schemes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:793-797 [Journal]
  3. Jan-Erik Stjernvall
    Dominance - A relation between distortion measures. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:798-806 [Journal]
  4. Toby Berger, Zhen Zhang
    Minimum breakdown degradation in binary source encoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:807-813 [Journal]
  5. Jean C. Walrand, Pravin Varaiya
    Optimal causal coding - decoding problems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:814-819 [Journal]
  6. John H. Conway, Neil J. A. Sloane
    A fast encoding method for lattice codes and quantizers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:820-824 [Journal]
  7. Jean C. Walrand
    A probabilistic look at networks of quasi-reversible queues. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:825-830 [Journal]
  8. Chris Heegard
    Partitioned linear block codes for computer memory with 'stuck-at' defects. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:831-842 [Journal]
  9. Richard A. Games
    A generalized recursive construction for de Bruijn sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:843-849 [Journal]
  10. Christian Thommesen
    The existence of binary linear concatenated codes with Reed - Solomon outer codes which asymptotically meet the Gilbert- Varshamov bound. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:850-853 [Journal]
  11. P. Vijay Kumar, Robert A. Scholtz
    Bounds on the linear span of bent sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:854-862 [Journal]
  12. Shimon Even, Oded Goldreich
    DES-like functions can generate the alternating group. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:863-865 [Journal]
  13. Wil J. van Gils
    Two topics on linear unequal error protection codes: Bounds on their length and cyclic code classes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:866-876 [Journal]
  14. Gilles Brassard
    Relativized cryptography. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:877-893 [Journal]
  15. J. Silverman, V. E. Vickers, J. L. Sampson
    Statistical estimates of the n-bit Gray codes by restricted random generation of permutations of 1 to 2n. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:894-901 [Journal]
  16. Kiran M. Rege
    Min-max linear estimation of band-limited sequences from noisy observations - A deterministic approach. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:902-909 [Journal]
  17. Jian-Cheng Huang, Bing-Zheng Xu
    Pretested Random Tree Protocol for Packet Conflict Resolution. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:910-913 [Journal]
  18. Aurel A. Lazar
    The throughput time delay function of an M/M/1 queue. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:914-0 [Journal]
  19. Hirosuke Yamamoto
    A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:918-0 [Journal]
  20. Baruch Mazor, William A. Pearlman
    A trellis code construction and coding theorem for stationary Gaussian sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:924-0 [Journal]
  21. Thomas M. Cover, Abbas A. El Gamal
    An information - theoretic proof of Hadamard's inequality. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:930-0 [Journal]
  22. Abbas A. El Gamal
    A simple proof of the Ahlswede - Csiszár one-bit theorem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:931-0 [Journal]
  23. Michele Elia
    Some results on the existence of binary linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:933-0 [Journal]
  24. Marcel J. E. Golay
    The merit factor of Legendre sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:934-0 [Journal]
  25. James A. Wiseman
    New binary codes constructed by an old technique. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:936-0 [Journal]
  26. V. Z. Marmarelis
    Practical estimation of correlation functions of nonstationary Gaussian processes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:937-0 [Journal]
  27. Bahaa E. A. Saleh, Malvin Carl Teich
    Statistical properties of a nonstationary Neyman - Scott cluster process. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:939-0 [Journal]
  28. Rodney W. Johnson, John E. Shore
    Comments on and correction to 'Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy' (Jan 80 26-37). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:942-0 [Journal]
  29. Sabah A. Al-Quaddoomi
    Two-Dimensional Binary Codes with Good Autocorrelation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:943- [Journal]
  30. Alex Netch
    Pairwise phase-locked loop coupling for tracking improvement in nonrigid retrodirective arrays (Ph.D. Thesis abstr.). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:943- [Journal]
  31. Baruch Mazor
    Optimal tree and trellis codes for stationary Gaussian sources (Ph.D. Thesis abstr.). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:944- [Journal]
  32. Priyadarshan Jakatdar
    Optimal encoding of stationary Gaussian sources with applications in image coding (Ph.D. Thesis abstr.). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:944- [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