Answers are grounded in this paper and cite their sources.
Based on arrays, excellent low-density parity-check (LDPC) codes with high rates have been constructed. In this letter, we propose to construct high-performance nonbinary LDPC (NBLDPC) codes with moderate rates based on arrays. The proposed construction combines masking and column selection. First, we construct a masking matrix M based on asymptotic thresholds and certain error-prone substructures. Second, we generate a number of column selection sets (CSS) based on Golomb rulers. Based on M, we construct a parity-check matrix for each CSS. Third, we compute the cycle distribution of each parity-check matrix and select the one with the best cycle distribution as output. To assess the effectiveness of the proposed construction, error performances of several NBLDPC codes are presented. Comparisons with other codes are also carried out to show the advantages of our construction.
No takes yet. Share an insight, caveat, or question.
Zhao et al. (2015) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: