Decoding of Low-Density Codes

We consider decoding of low-density parity-check codes by the Zyablov–Pinsker algorithm. We show that the transition from majority logic decoding to threshold decoding increases the distance realized by the algorithm without affecting the order of complexity. We analyze a version of the algorithm designed for machine implementation which requires $n$ votings, where $n$ is the code length.