The Guesswork of Ordered Statistics Decoding: Guesswork Complexity and Decoder Design

This paper investigates guesswork over ordered statistics and formulates the achievable guesswork complexity of ordered statistics decoding (OSD) in binary additive white Gaussian noise (AWGN) channels.

The achievable guesswork complexity is defined as the number of test error patterns (TEPs) processed by OSD immediately upon finding the correct codeword estimate.

The paper first develops a new upper bound for guesswork over independent sequences by partitioning them into Hamming shells and applying H\"older's inequality.

This upper bound is then extended to ordered statistics, by constructing the conditionally independent sequences within the ordered statistics sequences.

Next, we apply these bounds to characterize the statistical moments of the OSD guesswork complexity.

We show that the achievable guesswork complexity of OSD at maximum decoding order can be accurately approximated by the modified Bessel function, which increases exponentially with code dimension.

We also identify a guesswork complexity saturation threshold, where increasing the OSD decoding order beyond this threshold improves error performance without further raising the achievable guesswork complexity.

Finally, the paper presents insights on applying these findings to enhance the design of OSD decoders.

;Comment: Submitted for peer review.

26pages.

25 figures