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
1991, volume: 37, number: 3

  1. Roger S. Cheng, Sergio Verdú
    Capacity of root-mean-square bandlimited Gaussian multiuser channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:453-465 [Journal]
  2. Raymond W. Yeung
    A new outlook of Shannon's information measures. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:466-474 [Journal]
  3. Douglas J. Warren, John B. Thomas
    Asymptotically robust detection and estimation for very heavy-tailed noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:475-481 [Journal]
  4. G. R. Dattatreya, Laveen N. Kanal
    Asymptotically efficient estimation of prior probabilities in multiclass finite mixtures. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:482-489 [Journal]
  5. Adam Krzyzak
    On exponential bounds on the Bayes risk of the kernel classification rule. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:490-499 [Journal]
  6. Wu Chou, Robert M. Gray
    Dithering and its effects on sigma-delta and multistage sigma-delta modulation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:500-513 [Journal]
  7. John S. Sadowsky, Randall K. Bahr
    Direct-sequence spread-spectrum multiple-access communications with random signature sequences: A large deviations analysis. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:514-527 [Journal]
  8. Yoram Baram
    On the capacity of ternary Hebbian networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:528-534 [Journal]
  9. Venkat Anantharam
    The stability region of the finite-user slotted ALOHA protocol. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:535-540 [Journal]
  10. José L. Marroquín, Arturo Ramírez
    Stochastic cellular automata with Gibbsian invariant measures. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:541-551 [Journal]
  11. T. Aaron Gulliver, Vijay K. Bhargava
    Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:552-555 [Journal]
  12. Neri Merhav
    Universal coding with minimum probability of codeword length overflow. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:556-563 [Journal]
  13. Raymond W. Yeung
    Alphabetic codes revisited. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:564-572 [Journal]
  14. Zhen Zhang
    Linear inequalities for covering codes: Part I: Pair covering inequalities. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:573-582 [Journal]
  15. Ruud Pellikaan, Ba-Zhong Shen, Gerhard J. M. van Wee
    Which linear codes are algebraic-geometric? [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:583-602 [Journal]
  16. P. Vijay Kumar, Oscar Moreno
    Prime-phase sequences with periodic correlation properties better than binary sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:603-616 [Journal]
  17. Jørn M. Jensen, Helge Elbrønd Jensen, Tom Høholdt
    The merit factor of binary sequences related to difference sets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:617-626 [Journal]
  18. Christian Schlegel
    Evaluating distance spectra and performance bounds of trellis codes on channels with intersymbol interference. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:627-0 [Journal]
  19. Hirosuke Yamamoto
    A coding theorem for secret sharing communication systems with two Gaussian wiretap channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:634-0 [Journal]
  20. Shirish A. Altekar, Norman C. Beaulieu
    On the tightness of two error bounds for decision feedback equalizers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:638-0 [Journal]
  21. Nicholas Pippenger, George D. Stamoulis, John N. Tsitsiklis
    On a lower bound for the redundancy of reliable networks with noisy gates. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:639-0 [Journal]
  22. Tony G. Thomas, Brian L. Hughes
    Exponential error bounds for random codes on Gaussian arbitrarily varying channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:643-0 [Journal]
  23. Hendrik C. Ferreira, D. A. Wright, Albertus S. J. Helberg, I. S. Shaw, C. R. Wyman
    Some new rate R = k/n (2 leq k leq n-2) systematic convolutional codes with good distance profiles. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:649-0 [Journal]
  24. Kjell Jørgen Hole
    Rate k/(k + 1) punctured convolutional encoders. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:653-0 [Journal]
  25. Te Sun Han, Hajime Sato
    Feedback codes with uniformly bounded codeword lengths and zero-error capacities. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:655-0 [Journal]
  26. Patric R. J. Östergård
    Upper bounds for q-ary covering codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:660-0 [Journal]
  27. Warwick de Launey
    A note on N -dimensional Hadamard matrices of order 2t and Reed-Muller codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:664-0 [Journal]
  28. Alexander Vardy, Yair Be'ery
    More efficient soft decoding of the Golay codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:667-0 [Journal]
  29. Cheng Hua, Guo-Zhen Xiao
    The linear complexity of binary sequences with period (2n-1)k. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:672-0 [Journal]
  30. Chong T. Ong, Cyril S. K. Leung
    On the undetected error probability of triple-error-correcting BCH codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:673-0 [Journal]
  31. Gerhard J. M. van Wee, Gérard D. Cohen, Simon Litsyn
    A note on perfect multiple covetings of the Hamming space. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:678-0 [Journal]
  32. Kenneth J. Kerpez
    Runlength codes from source codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:682-0 [Journal]
  33. Raymond W. Yeung
    Local redundancy and progressive bounds on the redundancy of a Huffman code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:687-0 [Journal]
  34. Eric B. Hall, Gary L. Wise
    On optimal estimation with respect to a large family of cost functions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:691-0 [Journal]
  35. Craig Gotsman
    A note on functions governed by Walsh expressions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:694-0 [Journal]
  36. Jelena Kovacevic, Martin Vetterli
    The commutativity of up/downsampling in two dimensions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:695-0 [Journal]
  37. Thomas J. Flynn, Robert M. Gray
    Correction to 'Encoding of correlated observations' (Nov 87 773-787). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:699-0 [Journal]
  38. A. Robert Calderbank, Paul H. Siegel, Jack K. Wolf
    Introduction to special issue on coding for storage devices. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:709-711 [Journal]
  39. Chris Heegard, Alexandra Duel-Hallen, Rajeev Krishnamoorthy
    On the capacity of the noisy runlength channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:712-720 [Journal]
  40. Paul E. Bender, Jack K. Wolf
    New asymptotic bounds and improvements on the Lempel-Ziv data compression algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:721-729 [Journal]
  41. Gilles Zémor, Gérard D. Cohen
    Error-correcting WOM-codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:730-734 [Journal]
  42. Khaled A. S. Abdel-Ghaffar, Martin Hassner
    Multilevel error-control codes for data storage channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:735-741 [Journal]
  43. Brian H. Marcus, Ron M. Roth
    Bounds on the number of states in encoder graphs for input-constrained channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:742-758 [Journal]
  44. Chris Heegard, Brian H. Marcus, Paul H. Siegel
    Variable-length state splitting with applications to average runlength-constrained (ARC) codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:759-777 [Journal]
  45. Victor D. Kolesnik, Victor Yu. Krachkovsky
    Generating functions and lower bounds on rates for limited error-correcting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:778-788 [Journal]
  46. Khaled A. S. Abdel-Ghaffar, Jacobus H. Weber
    Bounds and constructions for runlength-limited error-control block codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:789-800 [Journal]
  47. Alexander Barg, Simon Litsyn
    DC-constrained codes from Hadamard matrices. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:801-807 [Journal]
  48. Kjell Jørgen Hole
    Punctured convolutional codes for the 1-D partial-response channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:808-817 [Journal]
  49. Razmik Karabed, Paul H. Siegel
    Matched spectral-null codes for partial-response channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:818-855 [Journal]
  50. Henk D. L. Hollmann
    The general solution of write equalization for RLL (d, k) codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:856-862 [Journal]
  51. Shlomo Shamai, Ephraim Zehavi
    Bounds on the capacity of the bit-shift magnetic recording channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:863-0 [Journal]
  52. W. M. C. J. van Overveld
    The four cases of write unidirectional memory codes over arbitrary alphabets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:872-0 [Journal]
  53. Aaron D. Wyner, Jacob Ziv
    Fixed data base version of the Lempel-Ziv data compression algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:878-0 [Journal]
  54. Leonid A. Bassalygo, S. I. Gelfand, Mark S. Pinsker
    Coding for partially localized errors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:880-0 [Journal]
  55. Rodney M. Goodman, Masahiro Sayano
    The reliability of semiconductor RAM memories with on-chip error-correction coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:884-0 [Journal]
  56. Alexander A. Davydov, Leonid M. Tombak
    An alternative to the Hamming code in the class of SEC-DED codes in semiconductor memory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:897-0 [Journal]
  57. Yuichi Saitoh, Hideki Imai
    Multiple unidirectional byte error-correcting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:903-0 [Journal]
  58. Anthony D. Weathers, Jack K. Wolf
    A new rate 2/3 sliding block code for the (1, 7) runlength constraint with the minimal number of encoder states. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:908-0 [Journal]
  59. Henk D. L. Hollmann, Kees A. Schouhamer Immink
    Schouhamer Immink. Performance of efficient balanced codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:913-0 [Journal]
  60. Lyle J. Frederickson
    On the Shannon capacity of DC- and Nyquist-free codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:918-0 [Journal]
  61. Augustus J. E. M. Janssen, Kees A. Schouhamer Immink
    Entropy and power spectrum of asymmetrically DC-constrained binary sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:923-0 [Journal]
  62. Hiroshi Kamabe
    Spectral lines of codes given as functions of finite Markov chains. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:927-0 [Journal]
  63. Øyvind Ytrehus
    Upper bounds on error-correcting runlength-limited block codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:941-0 [Journal]
  64. Mario Blaum
    Combining ECC with modulation: Performance comparisons. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:945-0 [Journal]
  65. Gérard D. Cohen, Simon Litsyn
    DC-constrained error-correcting codes with small running digital sum. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:949-0 [Journal]
  66. Giovanni Vannucci, Gerard J. Foschini
    The minimum distance for digital magnetic recording partial responses. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:955-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