New Construction of Low-Density Parity-Check Codes Based on Vector Space Over Finite Fields

Abstract

Low-Density Parity-Check (LDPC) codes have low linear decoding complexity, which is a kind of good codes with excellent performance. Therefore, LDPC codes have great research value. Two kinds of LDPC codes are constructed based on vector space over finite field. The code length, code rate and minimum distance are given. Moreover, the two kinds of codes are compared with the existing codes, and the constructed codes are better than some existing ones in terms of code rate or minimum distance.

Keywords

• Low-density parity-check codes
• finite fields
• code rate
• minimum distance