1 citations · 1 across the 4 of their papers we have counts for
4 papers
Pseudoredundancy for the Bit-Flipping Algorithm
Jens Zumbrägel
The analysis of the decoding failure rate of the bit-flipping algorithm has received increasing attention. For a binary linear code we consider the minimum number of rows in a pari…
Congruence-simplicity of Steinberg algebras of non-Hausdorff ample groupoids over semifields
Tran Giang Nam, Jens Zumbrägel
We investigate the algebra of an ample groupoid, introduced by Steinberg, over a semifield S. In particular, we obtain a complete characterization of congruence-simpleness for Stei…
New Results on the Pseudoredundancy
Zihui Liu, Jens Zumbrägel, Marcus Greferath +1
The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the…
Exploration of AWGNC and BSC Pseudocodeword Redundancy
Jens Zumbragel, Mark F. Flanagan, Vitaly Skachek
The AWGNC, BSC, and max-fractional pseudocodeword redundancy of a code is defined as the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudo…