Coding for Parallel Channels: Gallager Bounds for Binary Linear Codes with Applications to Repeat-Accumulate Codes and Variations - Igal Sason; Idan Goldenberg (CoRR, 2006)

Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes - Igal Sason; Idan Goldenberg (CoRR, 2006)

Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes. - Igal Sason; Idan Goldenberg (IEEE Trans. Inf. Theory, 2007)

Upper bound on error exponent of regular LDPC codes transmitted over the BEC. - Idan Goldenberg; David Burshtein (IEEE Trans. Inf. Theory, 2009)

Improved linear programming decoding and bounds on the minimum distance of LDPC codes. - David Burshtein; Idan Goldenberg (ITW, 2010)

Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes. - David Burshtein; Idan Goldenberg (ISIT, 2011)

Error bounds for repeat-accumulate codes decoded via linear programming. - Idan Goldenberg; David Burshtein (Adv. Math. Commun., 2011)

Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance. - David Burshtein; Idan Goldenberg (IEEE Trans. Inf. Theory, 2011)

The Approximate Maximum-Likelihood Certificate. - Idan Goldenberg; David Burshtein (IEEE Trans. Inf. Theory, 2013)