Research articles

search articles

My Pages

Stat

Members: 3645
Articles: 2'501'711
Articles rated: 2609

19 April 2024

» arxiv » cs.IT/0502024

Article overview

Idempotents, Mattson-Solomon Polynomials and Binary LDPC codes
R.Horan ; C.Tjhai ; M.Tomlinson ; M.Ambroze ; M.Ahmed ;
Date:	4 Feb 2005
Subject:	Information Theory ACM-class: H.1.1 \| cs.IT
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.
Source:	arXiv, cs.IT/0502024
Services:	Forum \| Review \| PDF \| Favorites

No review found.

Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)

ScienXe.org
» my Online CV
» Free

News, job offers and information for researchers and scientists:

home

contact

sitemap