Concatenated finite geometry and finite field LDPC codes

Abstract

This paper presents two types of concatenated finite-geometry and finite-field LDPC codes which have the distinct features of both finite geometry and finite field LDPC codes, such as large minimum distances, no small trapping sets, fast decoding convergence, capable of correcting both random errors and bursts of erasures, flexibility in code construction, cyclic and quasi-cyclic structures. It is shown that these concatenated codes are globally coupled LDPC codes and they perform well over the AWGN and binary erasure channels with a two-phase iterative decoding scheme.