Idempotents, Mattson-Solomon Polynomials and Binary LDPC codes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
9 pages, 3 figures

Keywords

Information Theory, H.1.1

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/134198

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0502024
 http://arxiv.org/abs/cs/0502024

Collections

arXiv