Showing 2007Show all
2 papers · 1 filter
cs.DS2007
Sorting and Selection with Random Costs
Stanislav Angelov, Keshav Kunal, Andrew McGregor
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work is the first treatment of a natural stochastic variant of th…
cs.IT2007
On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes
Andrew McGregor, Olgica Milenkovic
We prove that approximating the size of stopping and trapping sets in Tanner graphs of linear block codes, and more restrictively, the class of low-density parity-check (LDPC) code…