 | 2011 |
|---|
| 11 |       | David Burshtein,
Idan Goldenberg:
Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes.
ISIT 2011: 1263-1267 |
| 10 | | Idan Goldenberg,
David Burshtein:
The approximate maximum-likelihood certificate.
ISIT 2011: 1278-1282 |
| 9 | | Idan Goldenberg,
David Burshtein:
The approximate maximum-likelihood certificate
CoRR abs/1105.3006: (2011) |
| 8 | | David Burshtein,
Idan Goldenberg:
Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance.
IEEE Transactions on Information Theory 57(11): 7386-7402 (2011) |
| 2010 |
|---|
| 7 | | David Burshtein,
Idan Goldenberg:
Improved linear programming decoding of LDPC codes and bounds on the minimum and fractional distance
CoRR abs/1012.1425: (2010) |
| 2009 |
|---|
| 6 | | Idan Goldenberg,
David Burshtein:
Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming
CoRR abs/0904.1692: (2009) |
| 5 | | Idan Goldenberg,
David Burshtein:
Upper bound on error exponent of regular LDPC codes transmitted over the BEC.
IEEE Transactions on Information Theory 55(6): 2674-2681 (2009) |
| 2008 |
|---|
| 4 | | Idan Goldenberg,
David Burshtein:
Upper Bound on Error Exponent of Regular LDPC Codes Transmitted over the BEC
CoRR abs/0803.2460: (2008) |
| 2007 |
|---|
| 3 | | 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 |
|---|
| 2 | | 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) |
| 1 | | Igal Sason,
Idan Goldenberg:
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
CoRR abs/cs/0609099: (2006) |
Data released under the ODC-BY 1.0 license — See also our legal information page