The SCEAS System
Navigation Menu

Journals in DBLP

IEEE Transactions on Information Theory
2001, volume: 47, number: 2

  1. Brendan J. Frey, Ralf Koetter, G. David Forney Jr., Frank R. Kschischang, Robert J. McEliece, Daniel A. Spielman
    Introduction to the special issue on codes on graphs and iterative algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:493-497 [Journal]
  2. Frank R. Kschischang, Brendan J. Frey, Hans-Andrea Loeliger
    Factor graphs and the sum-product algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:498-519 [Journal]
  3. G. David Forney Jr.
    Codes on graphs: Normal realizations. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:520-548 [Journal]
  4. Stuart Geman, Kevin Kochanek
    Dynamic programming and the graphical representation of error-correcting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:549-568 [Journal]
  5. Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman
    Efficient erasure correcting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:569-584 [Journal]
  6. Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman
    Improved low-density parity-check codes using irregular graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:585-598 [Journal]
  7. Thomas J. Richardson, Rüdiger L. Urbanke
    The capacity of low-density parity-check codes under message-passing decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:599-618 [Journal]
  8. Thomas J. Richardson, Mohammad Amin Shokrollahi, Rüdiger L. Urbanke
    Design of capacity-approaching irregular low-density parity-check codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:619-637 [Journal]
  9. Thomas J. Richardson, Rüdiger L. Urbanke
    Efficient encoding of low-density parity-check codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:638-656 [Journal]
  10. Sae-Young Chung, Thomas J. Richardson, Rüdiger L. Urbanke
    Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:657-670 [Journal]
  11. Hesham El Gamal, A. Roger Hammons Jr.
    Analyzing the turbo decoder using the Gaussian approximation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:671-686 [Journal]
  12. Matthew C. Davey, David J. C. MacKay
    Reliable communication over channels with insertions, deletions, and substitutions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:687-698 [Journal]
  13. Dakshi Agrawal, Alexander Vardy
    The turbo decoding algorithm and its phase trajectories. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:699-722 [Journal]
  14. Assaf Sella, Yair Be'ery
    Convergence analysis of turbo decoding of product codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:723-735 [Journal]
  15. Yair Weiss, William T. Freeman
    On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:736-744 [Journal]
  16. Paat Rusmevichientong, Benjamin Van Roy
    An analysis of belief propagation on the turbo decoding graph with Gaussian densities. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:745-765 [Journal]
  17. Brendan J. Frey, Ralf Koetter, Alexander Vardy
    Signal-space characterization of iterative decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:766-781 [Journal]
  18. David Burshtein, Gadi Miller
    Expander graph arguments for message-passing algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:782-790 [Journal]
  19. Li Ping, Keying Y. Wu
    Concatenated tree codes: A low-complexity, high-performance approach. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:791-799 [Journal]
  20. Li Ping, Xiaoling Huang, Nam Phamdo
    Zigzag codes and concatenated zigzag codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:800-807 [Journal]
  21. Robert Michael Tanner
    Minimum-distance bounds by graph analysis. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:808-821 [Journal]
  22. Amir H. Banihashemi, Frank R. Kschischang
    Tanner graphs for group block codes and lattices: Construction and complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:822-834 [Journal]
  23. Gilles Zémor
    On expander codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:835-837 [Journal]
  24. Hans-Andrea Loeliger, Felix Lustenberger, Markus Helfenstein, Felix Tarköy
    Probability propagation and decoding in analog VLSI. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:837-843 [Journal]
  25. Andrew P. Worthen, Wayne E. Stark
    Unified design of iterative receivers using factor graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:843-849 [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