dblp.uni-trier.dewww.uni-trier.de

Igal Sason

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
38EEE. Hof, Igal Sason, Shlomo Shamai: Performance Bounds for Nonbinary Linear Block Codes Over Memoryless Symmetric Channels. IEEE Transactions on Information Theory 55(3): 977-996 (2009)
2008
37EEGil Wiechman, Igal Sason: An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels. IEEE Transactions on Information Theory 54(5): 1962-1990 (2008)
36EEIgal Sason, Gil Wiechman: Correction to "On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications" [Feb 07 580-598]. IEEE Transactions on Information Theory 54(7): 3368 (2008)
2007
35EEIgal Sason: On Universal Properties of Capacity-Approaching LDPC Ensembles CoRR abs/0709.0599: (2007)
34EEIgal Sason, Gil Wiechman: Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe CoRR abs/0711.1056: (2007)
33EEGil Wiechman, Igal Sason: Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications. IEEE Transactions on Information Theory 53(2): 550-579 (2007)
32EEIgal Sason, Gil Wiechman: On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications. IEEE Transactions on Information Theory 53(2): 580-598 (2007)
31EEMoshe Twitto, Igal Sason: On the Error Exponents of Improved Tangential Sphere Bounds. IEEE Transactions on Information Theory 53(3): 1196-1210 (2007)
30EEMoshe Twitto, Igal Sason, Shlomo Shamai: Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes. IEEE Transactions on Information Theory 53(4): 1495-1510 (2007)
29EEHenry D. Pfister, Igal Sason: Accumulate-Repeat-Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity. IEEE Transactions on Information Theory 53(6): 2088-2115 (2007)
28EEIgal Sason, Idan Goldenberg: Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes. IEEE Transactions on Information Theory 53(7): 2394-2428 (2007)
2006
27EEIgal Sason, Idan Goldenberg: Coding for Parallel Channels: Gallager Bounds for Binary Linear Codes with Applications to Repeat-Accumulate Codes and Variations CoRR abs/cs/0607002: (2006)
26EEMoshe Twitto, Igal Sason, Shlomo Shamai: Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes CoRR abs/cs/0607003: (2006)
25EEMoshe Twitto, Igal Sason: On the Error Exponents of Some Improved Tangential-Sphere Bounds CoRR abs/cs/0607004: (2006)
24EEGil Wiechman, Igal Sason: An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels CoRR abs/cs/0608042: (2006)
23EEGil Wiechman, Igal Sason: An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications CoRR abs/cs/0609094: (2006)
22EEIgal Sason, Idan Goldenberg: Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes CoRR abs/cs/0609099: (2006)
21EEIgal Sason, Shlomo Shamai: Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial. Foundations and Trends in Communications and Information Theory 3(1/2): (2006)
2005
20EEGil Wiechman, Igal Sason: Improved Bounds on the Parity-Check Density and Achievable Rates of Binary Linear Block Codes with Applications to LDPC Codes CoRR abs/cs/0505057: (2005)
19EEGil Wiechman, Igal Sason: On the Parity-Check Density and Achievable Rates of LDPC Codes CoRR abs/cs/0505078: (2005)
18EEIgal Sason, Gil Wiechman: On Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing CoRR abs/cs/0508072: (2005)
17EEHenry D. Pfister, Igal Sason: Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure Channel Capacity with Bounded Complexity CoRR abs/cs/0509044: (2005)
16EEHenry D. Pfister, Igal Sason: Capacity-Achieving Ensembles of Accumulate-Repeat-Accumulate Codes for the Erasure Channel with Bounded Complexity CoRR abs/cs/0512006: (2005)
15EEIgal Sason, Shlomo Shamai: Analytical Bounds on Maximum-Likelihood Decoded Linear Codes with Applications to Turbo-Like Codes: An Overview CoRR abs/cs/0512074: (2005)
14EEIgal Sason, Gil Wiechman: Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach CoRR abs/cs/0512075: (2005)
13EEIgal Sason, Gil Wiechman: On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications CoRR abs/cs/0512076: (2005)
12EEHenry D. Pfister, Igal Sason, Rüdiger L. Urbanke: Capacity-achieving ensembles for the binary erasure channel with bounded complexity. IEEE Transactions on Information Theory 51(7): 2352-2379 (2005)
2004
11EEHenry D. Pfister, Igal Sason, Rüdiger L. Urbanke: Capacity-achieving ensembles for the binary erasure channel with bounded complexity CoRR cs.IT/0409026: (2004)
10EEHenry D. Pfister, Igal Sason, Rüdiger L. Urbanke: Bounds on the decoding complexity of punctured codes on graphs CoRR cs.IT/0409027: (2004)
9 Igal Sason, Rüdiger L. Urbanke: Complexity Versus Performance of Capacity-Achieving Irregular Repeat-Accumulate Codes on the Binary Erasure Channel. IEEE Transactions on Information Theory 50(6): 1247-1256 (2004)
8 Igal Sason: On Achievable Rate Regions for the Gaussian Interference Channel. IEEE Transactions on Information Theory 50(6): 1345-1356 (2004)
2003
7 Igal Sason, Rüdiger L. Urbanke: Parity-check density versus performance of binary linear block codes over memorylesssymmetric channels. IEEE Transactions on Information Theory 49(7): 1611-1635 (2003)
2002
6 Shlomo Shamai, Igal Sason: Variations on the Gallager bounds, connections, and applications. IEEE Transactions on Information Theory 48(12): 3029-3051 (2002)
5 Igal Sason, Ì. Emre Telatar, Rüdiger L. Urbanke: On the asymptotic input-output weight distributions and thresholds of convolutionaland turbo-like encoders. IEEE Transactions on Information Theory 48(12): 3052-3061 (2002)
2001
4 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. IEEE Transactions on Information Theory 47(6): 2275-2299 (2001)
2000
3 Igal Sason, Shlomo Shamai: Improved Upper Bounds on the ML Performance of Turbo Codes for Interleaved Rician Fading Channels with Comparison to Iterative Decoding. ICC (2) 2000: 591-596
2 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. IEEE Transactions on Information Theory 46(1): 24-47 (2000)
1999
1 Michael Peleg, Igal Sason, Shlomo Shamai, Avner Elia: On interleaved, differentially encoded convolutional codes. IEEE Transactions on Information Theory 45(7): 2572-2582 (1999)

Coauthor Index

1Avner Elia [1]
2Idan Goldenberg [22] [27] [28]
3E. Hof [38]
4Michael Peleg [1]
5Henry D. Pfister [10] [11] [12] [16] [17] [29]
6Shlomo Shamai [1] [2] [3] [4] [6] [15] [21] [26] [30] [38]
7Ì. Emre Telatar [5]
8Moshe Twitto [25] [26] [30] [31]
9Rüdiger L. Urbanke [5] [7] [9] [10] [11] [12]
10Gil Wiechman [13] [14] [18] [19] [20] [23] [24] [32] [33] [34] [36] [37]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)