 | 2008 |
|---|
| 12 |       | 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) |
| 11 | | 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 |
|---|
| 10 | | Igal Sason,
Gil Wiechman:
Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe
CoRR abs/0711.1056: (2007) |
| 9 | | 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) |
| 8 | | 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) |
| 2006 |
|---|
| 7 | | Gil Wiechman,
Igal Sason:
An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels
CoRR abs/cs/0608042: (2006) |
| 6 | | Gil Wiechman,
Igal Sason:
An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications
CoRR abs/cs/0609094: (2006) |
| 2005 |
|---|
| 5 | | 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) |
| 4 | | Gil Wiechman,
Igal Sason:
On the Parity-Check Density and Achievable Rates of LDPC Codes
CoRR abs/cs/0505078: (2005) |
| 3 | | Igal Sason,
Gil Wiechman:
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing
CoRR abs/cs/0508072: (2005) |
| 2 | | Igal Sason,
Gil Wiechman:
Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach
CoRR abs/cs/0512075: (2005) |
| 1 | | 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) |
