67 citations · 195 across the 36 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
cs.IT2010
Characterization of Graph-cover Pseudocodewords of Codes over
Vitaly Skachek
Linear-programming pseudocodewords play a pivotal role in our understanding of the linear-programming decoding algorithms. These pseudocodewords are known to be equivalent to the g…
cs.IT2010
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…
cs.IT2010
On the Pseudocodeword Redundancy
Jens Zumbragel, Mark F. Flanagan, Vitaly Skachek
We define the AWGNC, BSC, and max-fractional pseudocodeword redundancy of a code as the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudow…