Idan Goldenberg

14 papers B 3Journal 11
YearRankTypeTitle / Venue / Authors
2013 J jnl
The Approximate Maximum-Likelihood Certificate.
IEEE Trans. Inf. Theory
Idan Goldenberg, David Burshtein
2011 B conf
Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes.
ISIT
David Burshtein, Idan Goldenberg
2011 J jnl
Error bounds for repeat-accumulate codes decoded via linear programming.
Adv. Math. Commun.
Idan Goldenberg, David Burshtein
2011 J jnl
Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance.
IEEE Trans. Inf. Theory
David Burshtein, Idan Goldenberg
2011 J jnl
The approximate maximum-likelihood certificate
CoRR
Idan Goldenberg, David Burshtein
2011 B conf
The approximate maximum-likelihood certificate.
ISIT
Idan Goldenberg, David Burshtein
2010 B conf
Improved linear programming decoding and bounds on the minimum distance of LDPC codes.
ITW
David Burshtein, Idan Goldenberg
2010 J jnl
Improved linear programming decoding of LDPC codes and bounds on the minimum and fractional distance
CoRR
David Burshtein, Idan Goldenberg
2009 J jnl
Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming
CoRR
Idan Goldenberg, David Burshtein
2009 J jnl
Upper bound on error exponent of regular LDPC codes transmitted over the BEC.
IEEE Trans. Inf. Theory
Idan Goldenberg, David Burshtein
2008 J jnl
Upper Bound on Error Exponent of Regular LDPC Codes Transmitted over the BEC
CoRR
Idan Goldenberg, David Burshtein
2007 J jnl
Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes.
IEEE Trans. Inf. Theory
Igal Sason, Idan Goldenberg
2006 J jnl
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
CoRR
Igal Sason, Idan Goldenberg
2006 J jnl
Coding for Parallel Channels: Gallager Bounds for Binary Linear Codes with Applications to Repeat-Accumulate Codes and Variations
CoRR
Igal Sason, Idan Goldenberg