Modified OSD Algorithm with Reduced Gaussian Elimination

TL;DR

This paper introduces a modified OSD algorithm that reduces the complexity of Gaussian elimination, making decoding more efficient for linear block codes.

Contribution

The paper presents a novel modification to the OSD algorithm that limits Gaussian elimination to lower complexity, improving decoding efficiency for linear block codes.

Findings

Reduced Gaussian elimination complexity to O(N^3 min{R, 1-R}^3)

Maintains decoding performance with lower computational cost

Applicable to (N,K) linear block codes of rate R

Abstract

In this paper, the OSD algorithm is modified to perform a limited GE with $O(N^3 \min\{R, 1-R\}^3)$ complexity for an $(N,K)$ linear block code of rate $R=K/N$.