On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization

TL;DR

This paper introduces a new construction and generalization of FDPC codes, along with a low-complexity encoding algorithm, demonstrating their superior error-correction performance and fast decoding convergence for high-rate applications.

Contribution

It presents a novel construction method for FDPC codes, a generalization of these codes, and a low-complexity encoding algorithm, advancing high-rate error correction techniques.

Findings

FDPC codes outperform 5G LDPC codes at the same iteration count.

The proposed codes exhibit fast convergence in message-passing decoding.

The encoding algorithm reduces complexity significantly.

Abstract

Recently introduced Fair-Density Parity-Check (FDPC) codes, targeting high-rate applications, offer superior error-correction performance (ECP) compared to 5G Low-Density Parity-Check (LDPC) codes, given the same number of message-passing decoding iterations. In this paper, we present a novel construction method for FDPC codes, introduce a generalization of these codes, and propose a low-complexity encoding algorithm. Numerical results demonstrate the fast convergence of the message-passing decoder for FDPC codes.