Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Error Control Coding, Second Edition
Error Control Coding, Second Edition
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
IEEE Transactions on Information Theory
Low-density parity-check codes based on finite geometries: a rediscovery and new results
IEEE Transactions on Information Theory
Low-density parity-check codes over Gaussian channels with erasures
IEEE Transactions on Information Theory
Algebraic soft-decision decoding of Reed-Solomon codes
IEEE Transactions on Information Theory
Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
Iterative algebraic soft-decision list decoding of Reed-Solomon codes
IEEE Journal on Selected Areas in Communications
Quasi-cyclic LDPC codes: an algebraic construction
IEEE Transactions on Communications
Efficient decoder design for nonbinary quasicyclic LDPC codes
IEEE Transactions on Circuits and Systems Part I: Regular Papers - Special issue on ISCAS 2009
A low complexity decoding algorithm for majority-logic decodable nonbinary LDPC codes
IEEE Communications Letters
Quasi-cyclic LDPC codes: an algebraic construction, rank analysis, and codes on Latin squares
IEEE Transactions on Communications
Two low-complexity reliability-based message-passing algorithms for decoding non-binary LDPC codes
IEEE Transactions on Communications
Hi-index | 0.00 |
This paper presents two algebraic methods for constructing high performance and efficiently encodable non-binary quasi-cyclic LDPC codes based on arrays of special circulant permutation matrices and multi-fold array dispersions. Codes constructed based on these methods perform well over the AWGN and other types of channels with iterative decoding based on belief-propagation. Experimental results show that over the AWGN channel, these non-binary quasi-cyclic LDPC codes significantly outperform Reed-Solomon codes of the same lengths and rates decoded with either algebraic hard-decision Berlekamp-Massey algorithm or algebraic soft-decision Kötter-Vardy algorithm. Also presented in this paper is a class of asymptotically optimal LDPC codes for correcting bursts of erasures. Codes constructed also perform well over flat fading channels. Non-binary quasi-cyclic LDPC codes have a great potential to replace Reed-Solomon codes in some applications in communication environments and storage systems for combating mixed types of noises and interferences.