17 citations · 22 across the 6 of their papers we have counts for
6 papers
The approximate maximum-likelihood certificate
Idan Goldenberg, David Burshtein
A new property which relies on the linear programming (LP) decoder, the approximate maximum-likelihood certificate (AMLC), is introduced. When using the belief propagation decoder,…
Improved linear programming decoding of LDPC codes and bounds on the minimum and fractional distance
David Burshtein, Idan Goldenberg
We examine LDPC codes decoded using linear programming (LP). Four contributions to the LP framework are presented. First, a new method of tightening the LP relaxation, and thus imp…
Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming
Idan Goldenberg, David Burshtein
We examine regular and irregular repeat-accumulate (RA) codes with repetition degrees which are all even. For these codes and with a particular choice of an interleaver, we give an…
Upper Bound on Error Exponent of Regular LDPC Codes Transmitted over the BEC
Idan Goldenberg, David Burshtein
The error performance of the ensemble of typical LDPC codes transmitted over the binary erasure channel (BEC) is analyzed. In the past, lower bounds on the error exponents were der…
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
Igal Sason, Idan Goldenberg
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New…
Coding for Parallel Channels: Gallager Bounds for Binary Linear Codes with Applications to Repeat-Accumulate Codes and Variations
I. Sason, I. Goldenberg
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New…