For many codes the decoding complexity is lower than previous methods, such as the algorithm by Bahl et al. (1974), and the decrease is shown at its most when decoding Hamming codes.

Abstract: In this paper, we derive the distribution of the Hamming distance at 0-reprocessing of the ordered statistics decoding (OSD). With the assumption of decoding a random linear block code, we ...