| 2008 |
|---|
| 37 | EE | Gil 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) |
| 36 | EE | Igal 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 |
|---|
| 35 | EE | Igal Sason:
On Universal Properties of Capacity-Approaching LDPC Ensembles
CoRR abs/0709.0599: (2007) |
| 34 | EE | Igal Sason,
Gil Wiechman:
Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe
CoRR abs/0711.1056: (2007) |
| 33 | EE | Gil 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) |
| 32 | EE | Igal 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) |
| 31 | EE | Moshe Twitto,
Igal Sason:
On the Error Exponents of Improved Tangential Sphere Bounds.
IEEE Transactions on Information Theory 53(3): 1196-1210 (2007) |
| 30 | EE | Moshe 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) |
| 29 | EE | Henry 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) |
| 28 | EE | Igal 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 |
|---|
| 27 | EE | Igal 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) |
| 26 | EE | Moshe Twitto,
Igal Sason,
Shlomo Shamai:
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
CoRR abs/cs/0607003: (2006) |
| 25 | EE | Moshe Twitto,
Igal Sason:
On the Error Exponents of Some Improved Tangential-Sphere Bounds
CoRR abs/cs/0607004: (2006) |
| 24 | EE | Gil Wiechman,
Igal Sason:
An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels
CoRR abs/cs/0608042: (2006) |
| 23 | EE | Gil Wiechman,
Igal Sason:
An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications
CoRR abs/cs/0609094: (2006) |
| 22 | EE | Igal Sason,
Idan Goldenberg:
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
CoRR abs/cs/0609099: (2006) |
| 21 | EE | Igal 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 |
|---|
| 20 | EE | Gil 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) |
| 19 | EE | Gil Wiechman,
Igal Sason:
On the Parity-Check Density and Achievable Rates of LDPC Codes
CoRR abs/cs/0505078: (2005) |
| 18 | EE | Igal Sason,
Gil Wiechman:
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing
CoRR abs/cs/0508072: (2005) |
| 17 | EE | Henry D. Pfister,
Igal Sason:
Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure Channel Capacity with Bounded Complexity
CoRR abs/cs/0509044: (2005) |
| 16 | EE | Henry D. Pfister,
Igal Sason:
Capacity-Achieving Ensembles of Accumulate-Repeat-Accumulate Codes for the Erasure Channel with Bounded Complexity
CoRR abs/cs/0512006: (2005) |
| 15 | EE | Igal Sason,
Shlomo Shamai:
Analytical Bounds on Maximum-Likelihood Decoded Linear Codes with Applications to Turbo-Like Codes: An Overview
CoRR abs/cs/0512074: (2005) |
| 14 | EE | Igal Sason,
Gil Wiechman:
Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach
CoRR abs/cs/0512075: (2005) |
| 13 | EE | Igal Sason,
Gil Wiechman:
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications
CoRR abs/cs/0512076: (2005) |
| 12 | EE | Henry 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 |
|---|
| 11 | EE | Henry D. Pfister,
Igal Sason,
Rüdiger L. Urbanke:
Capacity-achieving ensembles for the binary erasure channel with bounded complexity
CoRR cs.IT/0409026: (2004) |
| 10 | EE | Henry 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) |
