Constrained coding and soft iterative decoding for storage
Constrained coding and soft iterative decoding for storage
Construction of non-binary quasi-cyclic LDPC codes by arrays and array dispersions
IEEE Transactions on Communications
A differential binary message-passing LDPC decoder
IEEE Transactions on Communications
Stochastic decoding of LDPC codes over GF(q)
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Low-density parity-check codes based on finite geometries: a rediscovery and new results
IEEE Transactions on Information Theory
A low complexity decoding algorithm for majority-logic decodable nonbinary LDPC codes
IEEE Communications Letters
Hi-index | 0.00 |
In this letter, we propose a construction of nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes based on a cyclic maximum distance separable (MDS) code. The parity-check matrices are significantly rank deficient square matrices and their Tanner graphs have a girth of at least 6. The minimum distances of the codes are very respectable as far as LDPC codes are concerned. Based on plurality voting and iterative mechanism, a low-complexity nonbinary massage-passing decoding algorithm is proposed. It only requires finite field operations, integer additions and integer comparisons. Simulation results show that the decoding algorithm is fit for the proposed codes, providing efficient trade-offs between performance and decoding complexity, which suggests that the coding scheme may find some applications in communication or storage systems with high-speed and low-power consumption requirements.