Low Complexity Decoding of Non-binary Low-density Parity-check Codes

Communication and storage of information requires error correction coding to recover from errors. Non-binary low-density parity-check (NB-LDPC) codes are a class of error correcting codes that, relative to other classes of codes, manages to correct a larger number of errors. But they are not widely used in practice due to the high computational complexity in decoding. The thesis presents some novel strategies to reduce the said decoding complexity of NB-LDPC codes so that more practical applications could benefit from their impressive error-correcting performance.