Construction of low-density parity-check codes using cyclic difference sets
Ming Jiang
Abstract
Ming Jiang
Abstract
A new method to construct LDPC codes based on cyclic difference sets of combinatorics was proposed. A large number of regular LDPC codes could be generated, with the same column weight and the same row weight. And this method could eliminate the cycles with length equal to four and decrease the ones with length equal to six. Sum-product decoding algorithm was used to decode the new constructed LDPC codes and simulation results showed that they exhibit good performance.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A new method to construct LDPC codes based on cyclic difference sets of combinatorics was proposed. A large number of regular LDPC codes could be generated, with the same column weight and the same row weight. And this method could eliminate the cycles with length equal to four and decrease the ones with length equal to six. Sum-product decoding algorithm was used to decode the new constructed LDPC codes and simulation results showed that they exhibit good performance.
Key concepts: Low-density parity-check code, Mathematics, Decoding methods, Construct (python library), Discrete mathematics, Combinatorics, Algorithm, Computer science