The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Igal Sason: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Igal Sason, Shlomo Shamai
    Improved Upper Bounds on the ML Performance of Turbo Codes for Interleaved Rician Fading Channels with Comparison to Iterative Decoding. [Citation Graph (0, 0)][DBLP]
    ICC (2), 2000, pp:591-596 [Conf]
  2. Henry D. Pfister, Igal Sason, Rüdiger L. Urbanke
    Capacity-achieving ensembles for the binary erasure channel with bounded complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  3. Henry D. Pfister, Igal Sason, Rüdiger L. Urbanke
    Bounds on the decoding complexity of punctured codes on graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  4. Henry D. Pfister, Igal Sason, Rüdiger L. Urbanke
    Capacity-achieving ensembles for the binary erasure channel with bounded complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:7, pp:2352-2379 [Journal]
  5. Michael Peleg, Igal Sason, Shlomo Shamai, Avner Elia
    On interleaved, differentially encoded convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2572-2582 [Journal]
  6. Igal Sason
    On Achievable Rate Regions for the Gaussian Interference Channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:6, pp:1345-1356 [Journal]
  7. Igal Sason, Shlomo Shamai
    Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:1, pp:24-47 [Journal]
  8. Igal Sason, Shlomo Shamai
    On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2275-2299 [Journal]
  9. Igal Sason, Ì. Emre Telatar, Rüdiger L. Urbanke
    On the asymptotic input-output weight distributions and thresholds of convolutionaland turbo-like encoders. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:12, pp:3052-3061 [Journal]
  10. Igal Sason, Rüdiger L. Urbanke
    Parity-check density versus performance of binary linear block codes over memorylesssymmetric channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:7, pp:1611-1635 [Journal]
  11. Igal Sason, Rüdiger L. Urbanke
    Complexity Versus Performance of Capacity-Achieving Irregular Repeat-Accumulate Codes on the Binary Erasure Channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:6, pp:1247-1256 [Journal]
  12. Shlomo Shamai, Igal Sason
    Variations on the Gallager bounds, connections, and applications. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:12, pp:3029-3051 [Journal]
  13. Henry D. Pfister, Igal Sason
    Accumulate-Repeat-Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:6, pp:2088-2115 [Journal]
  14. Moshe Twitto, Igal Sason
    On the Error Exponents of Improved Tangential Sphere Bounds. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:3, pp:1196-1210 [Journal]
  15. Gil Wiechman, Igal Sason
    Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:2, pp:550-579 [Journal]
  16. Igal Sason, Gil Wiechman
    On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:2, pp:580-598 [Journal]
  17. Moshe Twitto, Igal Sason, Shlomo Shamai
    Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:4, pp:1495-1510 [Journal]
  18. Gil Wiechman, Igal Sason
    An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  19. Igal Sason, Idan Goldenberg
    Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  20. Igal Sason, Idan Goldenberg
    Coding for Parallel Channels: Gallager Bounds for Binary Linear Codes with Applications to Repeat-Accumulate Codes and Variations [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  21. Moshe Twitto, Igal Sason, Shlomo Shamai
    Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  22. Moshe Twitto, Igal Sason
    On the Error Exponents of Some Improved Tangential-Sphere Bounds [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  23. Gil Wiechman, Igal Sason
    An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  24. Igal Sason
    On Universal Properties of Capacity-Approaching LDPC Ensembles [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  25. Improved Bounds on the Parity-Check Density and Achievable Rates of Binary Linear Block Codes with Applications to LDPC Codes [Citation Graph (, )][DBLP]


  26. On the Parity-Check Density and Achievable Rates of LDPC Codes [Citation Graph (, )][DBLP]


  27. On Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing [Citation Graph (, )][DBLP]


  28. Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure Channel Capacity with Bounded Complexity [Citation Graph (, )][DBLP]


  29. Capacity-Achieving Ensembles of Accumulate-Repeat-Accumulate Codes for the Erasure Channel with Bounded Complexity [Citation Graph (, )][DBLP]


  30. Analytical Bounds on Maximum-Likelihood Decoded Linear Codes with Applications to Turbo-Like Codes: An Overview [Citation Graph (, )][DBLP]


  31. Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach [Citation Graph (, )][DBLP]


  32. On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications [Citation Graph (, )][DBLP]


  33. Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe [Citation Graph (, )][DBLP]


  34. Polar Coding for Reliable Communications over Parallel Channels [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.304secs
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