17 citations · 18 across the 5 of their papers we have counts for
5 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…
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…
Breaking `128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in and )
Robert Granger, Thorsten Kleinjung, Jens Zumbrägel
In late 2012 and early 2013 the discrete logarithm problem (DLP) in finite fields of small characteristic underwent a dramatic series of breakthroughs, culminating in a heuristic q…
On the Pseudocodeword Redundancy of Binary Linear Codes
Jens Zumbrägel, Vitaly Skachek, Mark F. Flanagan
The AWGNC, BSC, and max-fractional pseudocodeword redundancies of a binary linear code are defined to be the smallest number of rows in a parity-check matrix such that the correspo…
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…