The SCEAS System
Navigation Menu

Journals in DBLP

IEEE Transactions on Information Theory
1996, volume: 42, number: 5

  1. Noga Alon, Alon Orlitsky
    Source coding and graph entropies. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1329-1339 [Journal]
  2. Ram Zamir, Meir Feder
    Information rates of pre/post-filtered dithered quantizers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1340-1353 [Journal]
  3. Meir Feder, Neri Merhav
    Hierarchical universal coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1354-1364 [Journal]
  4. Gary J. Sullivan
    Efficient scalar quantization of exponential and Laplacian random variables. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1365-1374 [Journal]
  5. Amnon Gavish, Abraham Lempel
    Match-length functions for data compression. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1375-1380 [Journal]
  6. Marc P. C. Fossorier, Shu Lin
    First-order approximation of the ordered binary-symmetric channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1381-1387 [Journal]
  7. Shlomo Shamai, Rajiv Laroia
    The intersymbol interference channel: lower bounds on capacity and channel precoding loss. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1388-1404 [Journal]
  8. Khaled A. S. Abdel-Ghaffar, Jacobus H. Weber
    Constrained block codes for class-IV partial-response channels with maximum-likelihood sequence estimation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1405-1424 [Journal]
  9. Miroslaw Pawlak, U. Stadtmuller
    Recovering band-limited signals under noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1425-1438 [Journal]
  10. Amos Lapidoth
    Mismatched decoding and the multiple-access channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1439-1452 [Journal]
  11. Yoichiro Watanabe
    The total capacity of two-user multiple-access channel with binary output. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1453-1465 [Journal]
  12. A. Yavuz Oruç, H. M. Huang
    Crosspoint complexity of sparse crossbar concentrators. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1466-1471 [Journal]
  13. Chris J. Mitchell, Tuvi Etzion, Kenneth G. Paterson
    A method for constructing decodable de Bruijn sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1472-1478 [Journal]
  14. Bhaskar DasGupta, Eduardo D. Sontag
    Sample complexity for learning recurrent perceptron mappings. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1479-1487 [Journal]
  15. L. Finesso, Chuang-Chun Liu, Prakash Narayan
    The optimal error exponent for Markov order estimation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1488-1497 [Journal]
  16. Y. Levy, Daniel J. Costello Jr.
    A geometric construction procedure for geometrically uniform trellis codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1498-1513 [Journal]
  17. Frans M. J. Willems, Yuri M. Shtarkov, Tjalling J. Tjalkens
    Context weighting for general finite-context sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1514-1520 [Journal]
  18. Amos Lapidoth
    Nearest neighbor decoding for additive non-Gaussian noise channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1520-1529 [Journal]
  19. A. Beghi
    On the relative entropy of discrete-time Markov processes with given end-point densities. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1529-1535 [Journal]
  20. Shunsuke Ihara
    Some inequalities for channel capacities, mutual informations and mean-squared errors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1536-1540 [Journal]
  21. Julia Abrahams
    Generation of discrete distributions from biased coins. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1541-1546 [Journal]
  22. Bane V. Vasic
    Capacity of channels with redundant multitrack (d, k) constraints: the k<d case. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1546-1548 [Journal]
  23. H. Schwarte
    On weak convergence of probability measures, channel capacity and code error probabilities. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1549-1551 [Journal]
  24. Kees A. Schouhamer Immink
    A rate 4/6 (d=1, k=11) block-decodable runlength-limited code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1551-1553 [Journal]
  25. L. Patrovics, Kees A. Schouhamer Immink
    Encoding of dklr-sequences using one weight set. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1553-1554 [Journal]
  26. Alain P. Hiltgen, Kenneth G. Paterson, M. Brandestini
    Single-track Gray codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1555-1561 [Journal]
  27. Steven S. Pietrobon
    On the probability of error of convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1562-1568 [Journal]
  28. Andreas Weber, Tom Head
    The finest homophonic partition and related code concepts. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1569-1575 [Journal]
  29. Peter Boyvalenkov, Danyo Danev, Silvia P. Boumova
    Upper bounds on the minimum distance of spherical codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1576-1581 [Journal]
  30. Abhijit G. Shanbhag, P. Vijay Kumar, Tor Helleseth
    Improved binary codes and sequence families from Z4-linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1582-1587 [Journal]
  31. Kyeongcheol Yang, Tor Helleseth, P. Vijay Kumar, Abhijit G. Shanbhag
    On the weight hierarchy of Kerdock codes over Z4. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1587-1593 [Journal]
  32. Vera Pless, Zhongqiang Qian
    Cyclic codes and quadratic residue codes over Z4. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1594-1600 [Journal]
  33. Mario A. de Boer
    Codes spanned by quadratic and Hermitian forms. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1600-1604 [Journal]
  34. J. Ruprecht, M. Rupf
    On the search for good aperiodic binary invertible sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1604-1612 [Journal]
  35. Marcel van der Vlugt
    Non-BCH triple-error-correcting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1612-1614 [Journal]
  36. Torleiv Kløve
    Reed-Muller codes for error detection: the good, the bad, and the ugly. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1615-1622 [Journal]
  37. Tsukasa Sugita, Tadao Kasami, Toru Fujiwara
    The weight distribution of the third-order Reed-Muller code of length 512. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1622-1625 [Journal]
  38. Amir Said, Reginaldo Palazzo Jr.
    New ternary and quaternary linear block codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1625-1628 [Journal]
  39. Vladimir D. Tonchev, Vassil Y. Yorgov
    The existence of certain extremal [54, 27, 10] self-dual codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1628-1631 [Journal]
  40. K. Sakakibara, M. Kasahara
    On the minimum distance of a q-ary image of a qm-ary cyclic code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1631-1635 [Journal]
  41. P. Agabio, Ezio Biglieri
    Bounds on the weight hierarchy of generalized concatenated codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1635-1640 [Journal]
  42. Mahesh C. Bhandari, C. Durairajan
    A note on bounds for q-ary covering codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1640-1642 [Journal]
  43. Alfred M. Bruckstein
    Review of 'Two-Dimensional Imaging' (Bracewell, R.N.; 1994). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1643- [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