Good Codes Based on Very Sparse Matrices
Proceedings of the 5th IMA Conference on Cryptography and Coding
Non-Binary Error Control Coding for Wireless Communication and Data Storage
Non-Binary Error Control Coding for Wireless Communication and Data Storage
Structure, property, and design of nonbinary regular cycle codes
IEEE Transactions on Communications
IEEE Transactions on Information Theory
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Low Density Parity Check Codes (LDPC) are a group of channel codes which can be decoded using a graph. LDPC codes are known to give near Shannon limit performance in Additive White Gaussian Channel (AWGN), but for large block-lengths and irregular construction. To overcome this limitation, it has been proposed to define codes over a higher order Galois Field. In this paper,we construct a regular cycle non binary LDPC code over GF(q), where q=2p.We use a Fast Fourier Transform (FFT) based low complexity algorithm to decode the LDPC code defined over a large Galois Field. We evaluate the performance of these codes in AWGN channel using computer simulations and show that they are giving excellent BER performance.