The SCEAS System
Navigation Menu

Journals in DBLP

IEEE Transactions on Information Theory
1993, volume: 39, number: 2

  1. Steven S. Pietrobon, Daniel J. Costello Jr.
    Trellis coding with multidimensional QAM signal sets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:325-336 [Journal]
  2. Magnus Isaksson, Lars-Henning Zetterberg
    Block-coded M-PSK modulation over GF(M). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:337-346 [Journal]
  3. Martin Alles, Subbarayan Pasupathy
    Coding for the discretely phase ambiguous additive white Gaussian channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:347-357 [Journal]
  4. Ulrich K. Sorger
    A new Reed-Solomon code decoding algorithm based on Newton's interpolation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:358-365 [Journal]
  5. Xiang-dong Hou
    Some results on the covering radii of Reed-Muller codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:366-378 [Journal]
  6. Mario Blaum, Jehoshua Bruck
    Coding for skew-tolerant parallel asynchronous communications. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:379-388 [Journal]
  7. Boris Y. Kavalerchik
    A new model of numerical computer data and its application for construction of minimum-redundancy codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:389-397 [Journal]
  8. Dafna Sheinwald, Richard C. Pasco
    Deterministic prediction in progressive coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:398-408 [Journal]
  9. Marijn van Eupen, Jacobus H. van Lint
    On the minimum distance of ternary cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:409-422 [Journal]
  10. Takeshi Hashimoto
    A coded ARQ scheme with the generalized Viterbi algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:423-432 [Journal]
  11. Venugopal V. Veeravalli, Tamer Basar, H. Vincent Poor
    Decentralized sequential detection with a fusion center performing the sequential test. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:433-442 [Journal]
  12. Richard G. Ogier, Vladislav Rutenburg, Nacham Shacham
    Distributed algorithms for computing shortest pairs of disjoint paths. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:443-455 [Journal]
  13. Israel Cidon, Roch Guérin, Asad Khamisy, Moshe Sidi
    Analysis of a correlated queue in a communication system. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:456-465 [Journal]
  14. Leandros Tassiulas, Anthony Ephremides
    Dynamic server allocation to parallel queues with randomly varying connectivity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:466-478 [Journal]
  15. Tsutomu Kawabata
    Uniform switching system by families of switching sets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:479-490 [Journal]
  16. Amos Lapidoth
    On the reliability function of the ideal Poisson channel with noiseless feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:491-503 [Journal]
  17. Ofir Shalvi, Ehud Weinstein
    Super-exponential methods for blind deconvolution. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:504-519 [Journal]
  18. Paul C. Shields
    Universal redundancy rates do not exist. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:520-524 [Journal]
  19. Alf J. Isaksson
    Analysis of identified 2-D noncausal models. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:525-534 [Journal]
  20. William A. Gardner, Teri L. Archer
    Exploitation of cyclostationarity for identifying the Volterra kernels of nonlinear systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:535-542 [Journal]
  21. Venkat Anantharam
    The input-output map of a monotone discrete-time quasireversible node. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:543-552 [Journal]
  22. G. Robert Redinbo, Bernhard Zagar
    Modifying real convolutional codes for protecting digital filtering systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:553-564 [Journal]
  23. Christopher F. Barnes, Richard L. Frost
    Vector quantizers with direct sum codebooks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:565-580 [Journal]
  24. Inchi Hu, Santosh S. Venkatesh
    On the minimum expected duration of a coin tossing game. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:581-593 [Journal]
  25. Ola Hössjer, Moncef Mettiji
    Robust multiple classification of known signals in additive noise - An asymptotic weak signal approach. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:594-608 [Journal]
  26. Roger S. Cheng, Sergio Verdú
    On limiting characterizations of memoryless multiuser capacity regions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:609-0 [Journal]
  27. K. Leeuwin-Boullé, Jean-Claude Belfiore
    The cutoff rate of time correlated fading channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:612-0 [Journal]
  28. M. W. Thompson, Don R. Halverson, C. Tsai
    Robust estimation of signal parameters with nonstationary and/or dependent data. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:617-0 [Journal]
  29. Kenji Nakagawa, Fumio Kanaya
    On the converse theorem in statistical hypothesis testing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:623-0 [Journal]
  30. Kenji Nakagawa, Fumio Kanaya
    On the converse theorem in statistical hypothesis testing for Markov chains. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:629-0 [Journal]
  31. Hossam M. H. Shalaby, Adrian Papamarcou
    A note on the asymptotics of distributed detection with feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:633-0 [Journal]
  32. Arne Dür
    Avoiding decoder malfunction in the Peterson-Gorenstein-Zierler decoder. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:640-0 [Journal]
  33. John J. Komo, Maurice S. Lam
    Primitive polynomials and M-sequences over GF(qm). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:643-0 [Journal]
  34. Torleiv Kløve
    Minimum support weights of binary codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:648-0 [Journal]
  35. Oscar S. Rothaus
    Modified Gold codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:654-0 [Journal]
  36. Vladimir I. Levenshtein, A. J. Han Vinck
    Perfect (d, k)-codes capable of correcting single peak-shifts. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:656-0 [Journal]
  37. Andries E. Brouwer, Tom Verhoeff
    An updated table of minimum-distance bounds for binary linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:662-0 [Journal]
  38. Andries E. Brouwer
    The linear programming bound for binary linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:677-0 [Journal]
  39. Helge Elbrønd Jensen, Tom Høholdt, Jørn Justesen
    On the number of correctable errors for some AG-codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:681-0 [Journal]
  40. Rodney M. Goodman, Robert J. McEliece, Masahiro Sayano
    Phased burst error-correcting array codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:684-0 [Journal]
  41. Iwan M. Duursma
    Algebraic decoding using special divisors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:694-0 [Journal]
  42. Tsutomu Kawabata
    Exact analysis of the Lempel-Ziv algorithm for i.i.d. sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:698-0 [Journal]
  43. Sridhar Lakshmanan, Haluk Derin
    Valid parameter space for 2-D Gaussian Markov random fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:703-0 [Journal]
  44. Heinz-Josef Schlebusch
    On the asymptotic efficiency of importance sampling techniques. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:710-0 [Journal]
  45. Darel A. Linebarger, Ivan Hal Sudborough, Ioannis G. Tollis
    Difference bases and sparse sensor arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:716-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