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
1988, volume: 34, number: 5

  1. Benny Chor, Ronald L. Rivest
    A knapsack-type public key cryptosystem based on arithmetic in finite fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:901-909 [Journal]
  2. Bruce E. Hajek, Galen H. Sasaki
    Link scheduling in polynomial time. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:910-917 [Journal]
  3. Ramesh R. Rao, Anthony Ephremides
    On the stability of interacting queues in a multiple-access system. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:918-930 [Journal]
  4. Lazaros F. Merakos, Chatschik Bisdikian
    Delay analysis of the n -ary stack random-access algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:931-942 [Journal]
  5. Richard J. Barton, H. Vincent Poor
    Signal detection in fractional Gaussian noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:943-959 [Journal]
  6. H. Vincent Poor
    Fine quantization in signal detection and estimation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:960-972 [Journal]
  7. Lee K. Jones
    A stochastic multisample extension of Morris's robust detector in bounded amplitude noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:973-978 [Journal]
  8. Rodney M. Goodman, Padhraic Smyth
    Decision tree design from a communication theory standpoint. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:979-994 [Journal]
  9. Brian L. Hughes, Prakash Narayan
    The capacity of a vector Gaussian arbitrarily varying channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:995-1003 [Journal]
  10. Chein-I Chang, Lee D. Davisson
    On calculating the capacity of an infinite-input finite (infinite)-output channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1004-1010 [Journal]
  11. Marc Rouanne, Daniel J. Costello Jr.
    A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1011-1020 [Journal]
  12. Paul K. M. Ho, Peter J. McLane
    Spectrum, distance, and receiver complexity of encoded continuous phase modulation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1021-1032 [Journal]
  13. Yariv Ephraim, Hanoch Lev-Ari, Robert M. Gray
    Asymptotic minimum discrimination information measure for asymptotically weakly stationary processes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1033-1040 [Journal]
  14. Ofer Zeitouni
    On the filtering of noise-contaminated signals observed via hard limiters. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1041-1048 [Journal]
  15. Douglas J. Muder
    Minimal trellises for block codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1049-0 [Journal]
  16. Martin C. Rost, Khalid Sayood
    The root lattices as low bit rate vector quantizers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1053-0 [Journal]
  17. V. Sidorenko, Rolf Johannesson, Kamil Sh. Zigangirov
    On sequential decoding for the Gilbert channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1058-0 [Journal]
  18. Mario Blaum, Patrick G. Farrell, Henk C. A. van Tilborg
    Multiple burst-correcting array codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1061-0 [Journal]
  19. C. Foias, Arthur E. Frazho, Peter J. Sherman
    A geometric approach to the maximum likelihood spectral estimator for sinusoids in noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1066-0 [Journal]
  20. Peter Elias
    Zero error capacity under list decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1070-0 [Journal]
  21. David C. Larson, Jonathan J. Ashley, Thomas D. Howell
    On the minimum length error event of minimum Euclidean weight. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1074-0 [Journal]
  22. Jovan Dj. Golic, Miodrag V. Zivkovic
    On the linear complexity of nonuniformly decimated PN-sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1077-0 [Journal]
  23. Kjell Jørgen Hole
    New short constraint length rate (n-1)/n punctured convolutional codes for soft-decision Viterbi decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1079-0 [Journal]
  24. James A. Bucklew
    A large deviation theory proof of the abstract alphabet source coding theorem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1081-0 [Journal]
  25. Fabrizio Pollara, Robert J. McEliece, Khaled A. S. Abdel-Ghaffar
    Finite-state codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1083-0 [Journal]
  26. Jehoshua Bruck, Joseph W. Goodman
    A generalized convergence theorem for neural networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1089-0 [Journal]
  27. Ahmed H. Tewfik, Bernard C. Levy, Alan S. Willsky
    Sampling theorems for two-dimensional isotropic random fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1092-0 [Journal]
  28. Andrew R. Barron, Thomas M. Cover
    A bound on the financial value of information. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1097-0 [Journal]
  29. Peter Vanroose
    Code construction for the noiseless binary switching multiple-access channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1100-0 [Journal]
  30. Zhen Zhang
    Partial converse for a relay channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1106-0 [Journal]
  31. Hanan Rosenthal, Jacob Binia
    On the epsilon entropy of mixed random variables. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1110-0 [Journal]
  32. Toby Berger
    Preface to special issue on coding techniques and coding theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1121- [Journal]
  33. Daniel J. Costello Jr.
    Introduction to special section on coding techniques. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1122- [Journal]
  34. G. David Forney Jr.
    Coset codes-I: Introduction and geometrical classification. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1123-1151 [Journal]
  35. G. David Forney Jr.
    Coset codes-II: Binary lattices and related codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1152-1187 [Journal]
  36. Jean-Pierre A. Adoul, Michel Barth
    Nearest neighbor algorithm for spherical codes from the Leech lattice. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1188-1202 [Journal]
  37. Nambirajan Seshadri, John B. Anderson
    Asymptotic error performance of modulation codes in the presence of severe intersymbol interference. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1203-1216 [Journal]
  38. Jørn Justesen, Christian Thommesen, Victor V. Zyablov
    Concatenated codes with convolutional inner codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1217-1225 [Journal]
  39. George H. Freeman, Ian F. Blake, Jon W. Mark
    Trellis source code design as an optimization problem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1226-1241 [Journal]
  40. Anselm Blumer, Robert J. McEliece
    The Rényi redundancy of generalized Huffman codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1242-1249 [Journal]
  41. John C. Kieffer, Teresa M. Jahns, Viktor A. Obuljen
    New results on optimal entropy-constrained quantization. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1250-1258 [Journal]
  42. Federico Kuhlmann, James A. Bucklew
    Piecewise uniform vector quantizers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1259-0 [Journal]
  43. Göran Lindell, Carl-Erik W. Sundberg
    An upper bound on the bit error probability of combined convolutional coding and continuous phase modulation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1263-0 [Journal]
  44. Daniel Zwillinger
    Differential PPM has a higher throughput than PPM for the band-limited and average-power-limited optical channel (corresp.). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1269-0 [Journal]
  45. Jacobus H. van Lint
    Introduction to special section on coding theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1274-0 [Journal]
  46. A. Robert Calderbank, Neil J. A. Sloane
    Inequalities for covering codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1276-1280 [Journal]
  47. János Pach, Joel Spencer
    Explicit codes with low covering radius. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1281-1285 [Journal]
  48. Jean-Paul Boly, Wil J. van Gils
    Codes for combined symbol and digit error control. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1286-1307 [Journal]
  49. Tuvi Etzion
    Constructions for perfect maps and pseudorandom arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1308-1316 [Journal]
  50. Heinz Georg Quebbemann
    Cyclotomic Goppa codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1317-1320 [Journal]
  51. Jacobus H. Weber, Cornelis de Vroedt, Dick E. Boekee
    Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1321-1331 [Journal]
  52. Patrick Stevens
    Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1332-1340 [Journal]
  53. Michael Wirtz
    On the parameters of Goppa codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1341-0 [Journal]
  54. Iiro S. Honkala, Heikki O. Hämäläinen
    A new construction for covering codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1343-0 [Journal]
  55. Juriaan Simonis
    The minimal covering radius t[15, 6] of a six-dimensional binary linear code of length 15 is equal to 4. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1344-0 [Journal]
  56. Henning Stichtenoth
    A note on Hermitian codes over GF(q2). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1345-0 [Journal]
  57. J. C. C. M. Remijn, H. J. Tiersma
    A duality theorem for the weight distribution of some cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1348-0 [Journal]
  58. Akira Shiozaki
    Decoding of redundant residue polynomial codes using Euclid's algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1351-0 [Journal]
  59. Jeffrey S. Leon
    A probabilistic algorithm for computing minimum weights of large error-correcting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1354-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