Idempotents, Mattson-Solomon polynomials and binary LDPC codes

DOI10.1049/IP-COM:20050415MaRDI QIDQ2854435zbMATHOpenAlexFDO

Authors R. Horan, C. Tjhai, M. Tomlinson, M. Ambroze, M. Ahmed

Publication date 18 October 2013

Published in IEE Proceedings. Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0502024

Mathematics Subject Classification ID

Combinatorial codes (94B25) Other types of codes (94B60)

Abstract: We show how to construct an algorithm to search for binary idempotents which may be used to construct binary LDPC codes. The algorithm, which allows control of the key properties of sparseness, code rate and minimum distance, is constructed in the Mattson-Solomon domain. Some of the new codes, found by using this technique, are displayed.

Cited in

(3)

• On self-dual double circulant codes
• Self-dual 2-quasi-cyclic codes and dihedral codes
• The weight distribution of quasi-quadratic residue codes

This page was built for publication: Idempotents, Mattson-Solomon polynomials and binary LDPC codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2854435)