New Construction of Low-Density Parity-Check Codes Based on Vector Space Over Finite Fields
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 minimu...
Main Authors: | Xuemei Liu, Lihua Jia |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9256202/ |
Similar Items
-
Blind recognition of sparse parity‐check matrices of low‐density parity‐check codes in the presence of noise
by: Yong Ding, et al.
Published: (2023-03-01) -
An improved method for counting 6-cycles in low-density parity-check codes
by: Slimani Djamel, et al.
Published: (2023-01-01) -
Protograph Based Low-Density Parity-Check Codes Design With Mixed Integer Linear Programming
by: Wojciech Sulek
Published: (2019-01-01) -
Quasi Cyclic Low Density Parity Check Code for High SNR Data Transfer
by: M. R. Islam, et al.
Published: (2010-06-01) -
Cyclic Low Density Parity Check Codes With the Optimum Burst Error Correcting Capability
by: Sina Vafi
Published: (2020-01-01)