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
1996, volume: 42, number: 6

  1. Joan Feigenbaum, G. David Forney Jr., Brian H. Marcus, Robert J. McEliece, Alexander Vardy
    Introduction to the special issue on codes and complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1649-1659 [Journal]
  2. Hans-Andrea Loeliger, Thomas Mittelholzer
    Convolutional codes over groups. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1660-1686 [Journal]
  3. Aaron B. Kiely, Sam Dolinar, Robert J. McEliece, Laura Ekroot, Wei Lin
    Trellis decoding complexity of linear block codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1687-1697 [Journal]
  4. L. C. Perez, J. Seghers, Daniel J. Costello Jr.
    A distance spectrum interpretation of turbo codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1698-1709 [Journal]
  5. Michael Sipser, Daniel A. Spielman
    Expander codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1710-1722 [Journal]
  6. Daniel A. Spielman
    Linear-time encodable and decodable error-correcting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1723-1731 [Journal]
  7. Noga Alon, Michael Luby
    A linear time erasure-resilient code with nearly optimal recovery. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1732-1736 [Journal]
  8. Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan
    Priority encoding transmission. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1737-1744 [Journal]
  9. Leonard J. Schulman
    Coding for interactive communication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1745-1756 [Journal]
  10. J. Stern
    A new paradigm for public key identification. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1757-1768 [Journal]
  11. Gilles Brassard, Claude Crépeau, Miklos Santha
    Oblivious transfers and intersecting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1769-1780 [Journal]
  12. Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan
    Linearity testing in characteristic two. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1781-1795 [Journal]
  13. Vahid Tarokh, Ian F. Blake
    Trellis complexity versus the coding gain of lattices I. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1796-1807 [Journal]
  14. Vahid Tarokh, Ian F. Blake
    Trellis complexity versus the coding gain of lattices II. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1808-1816 [Journal]
  15. Yuval Berger, Yair Be'ery
    The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1817-1827 [Journal]
  16. Frank R. Kschischang
    The trellis structure of maximal fixed-cost codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1828-1838 [Journal]
  17. Vijay V. Vazirani, Huzur Saran, B. Sundar Rajan
    An efficient algorithm for constructing minimal trellises for codes over finite abelian groups. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1839-1854 [Journal]
  18. Robert J. McEliece, Wei Lin
    The trellis complexity of convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1855-1864 [Journal]
  19. G. David Forney Jr., Rolf Johannesson, Zhe-xian Wan
    Minimal and canonical rational generator matrices for convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1865-1880 [Journal]
  20. Joachim Rosenthal, J. M. Schumacher, Eric V. York
    On behaviors and convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1881-1891 [Journal]
  21. Fabio Fagnani, Sandro Zampieri
    Dynamical systems and convolutional codes over finite Abelian groups. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1892-1912 [Journal]
  22. Jonathan J. Ashley
    A linear bound for sliding-block decoder window size, II. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1913-1924 [Journal]
  23. Jonathan J. Ashley, Razmik Karabed, Paul H. Siegel
    Complexity and sliding-block decodability. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1925-1947 [Journal]
  24. Jonathan J. Ashley, Brian H. Marcus, Ron M. Roth
    On the decoding delay of encoders for input-constrained channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1948-1956 [Journal]
  25. Henk D. L. Hollmann
    Bounded-delay-encodable, block-decodable codes for constrained systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1957-1970 [Journal]
  26. Ilya Dumer
    Suboptimal decoding of linear codes: partition technique. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1971-1986 [Journal]
  27. Ba-Zhong Shen, Kenneth K. Tzeng, Chun Wang
    A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1987-1991 [Journal]
  28. G. David Forney Jr., Alexander Vardy
    Generalized minimum-distance decoding of Euclidean-space codes and lattices. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1992-2026 [Journal]
  29. Alexander Vardy, Frank R. Kschischang
    Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2027-2033 [Journal]
  30. P. Schuurman
    A table of state complexity bounds for binary linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2034-2042 [Journal]
  31. G. B. Horn, Frank R. Kschischang
    On the intractability of permuting a block code to minimize trellis complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2042-2048 [Journal]
  32. Vladimir Sidorenko, Garik Markarian, Bahram Honary
    Minimal trellis design for linear codes based on the Shannon product. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2048-2053 [Journal]
  33. Gérard D. Cohen, Simon Litsyn, Gilles Zémor
    On greedy algorithms in coding theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2053-2057 [Journal]
  34. Imre Csiszár, Paul C. Shields
    Redundancy rates for renewal and other processes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2065-2072 [Journal]
  35. Ram Zamir
    The rate loss in the Wyner-Ziv problem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2073-2084 [Journal]
  36. J. Stein, Jacob Ziv, Neri Merhav
    Universal delay estimation for discrete channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2085-2093 [Journal]
  37. Evgueni A. Haroutunian
    Multiterminal source coding achievable rates and reliability. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2094-2101 [Journal]
  38. Vittorio Castelli, Thomas M. Cover
    The relative value of labeled and unlabeled samples in pattern recognition with an unknown mixing parameter. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2102-2117 [Journal]
  39. Wee Sun Lee, Peter L. Bartlett, Robert C. Williamson
    Efficient agnostic learning of neural networks with bounded fan-in. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2118-2132 [Journal]
  40. Dharmendra S. Modha, Elias Masry
    Minimum complexity regression estimation with weakly dependent observations. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2133-2145 [Journal]
  41. Ron M. Roth
    Tensor codes for the rank metric. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2146-2157 [Journal]
  42. Hiroyoshi Morita, Adriaan J. de Lind van Wijngaarden, A. J. Han Vinck
    On the construction of maximal prefix-synchronized codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2158-2166 [Journal]
  43. Francesco Fabris, Andrea Sgarro, R. Pauletti
    Tunstall adaptive coding and miscoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2167-2180 [Journal]
  44. P. CharnKeitKong, Hideki Imai, Kazuhiko Yamaguchi
    On classes of rate k/(k+1) convolutional codes and their decoding techniques. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2181-2193 [Journal]
  45. Thierry P. Berger, Pascale Charpin
    The permutation group of affine-invariant extended cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2194-2209 [Journal]
  46. Frans M. J. Willems
    Coding for a binary independent piecewise-identically-distributed source. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2210-2217 [Journal]
  47. Jehoshua Bruck, Ching-Tien Ho
    Fault-tolerant cube graphs and coding theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2217-2221 [Journal]
  48. T. Veugen
    A simple class of capacity-achieving strategies for discrete memoryless channels with feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2221-2228 [Journal]
  49. Andrew L. Rukhin, I. Vajda
    The error probability, entropy, and equivocation when the number of input messages increases. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2228-2231 [Journal]
  50. Erik Ordentlich
    On the factor-of-two bound for Gaussian multiple-access channels with feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2231-2235 [Journal]
  51. A. J. Han Vinck, K. J. Keuning
    On the capacity of the asynchronous T-user M-frequency noiseless multiple-access channel without intensity information. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2235-2238 [Journal]
  52. Yoram Bresler
    Bounds on the aliasing error in multidimensional Shannon sampling. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2238-2241 [Journal]
  53. D. A. Abraham
    A Page test with nuisance parameter estimation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2242-2252 [Journal]
  54. Solomon W. Golomb, Oscar Moreno
    On periodicity properties of Costas arrays and a conjecture on permutation polynomials. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2252-2253 [Journal]
  55. Jong-Seon No, Hwan-Keun Lee, Habong Chung, Hong-Yeop Song, Kyeongcheol Yang
    Trace representation of Legendre sequences of Mersenne prime period. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2254-2255 [Journal]
  56. Andreas Faldum, Wolfgang Willems
    A characterization of codes with extreme parameters. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2255-2257 [Journal]
  57. Torleiv Kløve
    Bounds on the weight distribution of cosets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2257-2260 [Journal]
  58. T. Aaron Gulliver
    New optimal quaternary linear codes of dimension 5. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2260-2265 [Journal]
  59. Wende Chen, Torleiv Kløve
    The weight hierarchies of q -ary codes of dimension 4. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2265-2272 [Journal]
  60. Bruce Hajek
    Review of 'Discrete Stochastic Processes' (Gallager, R.G.; 1996). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2273- [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