Idempotents, Mattson-Solomon Polynomials and Binary LDPC codes

Simple item page
dc.creatorHoran, R.
dc.creatorTjhai, C.
dc.creatorTomlinson, M.
dc.creatorAmbroze, M.
dc.creatorAhmed, M.
dc.date2005-02-04
dc.date.accessioned2026-07-07T08:17:45Z
dc.date.available2026-07-07T08:17:45Z
dc.descriptionWe 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.
dc.description9 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/cs/0502024
dc.identifierhttp://arxiv.org/abs/cs/0502024
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134198
dc.subjectInformation Theory
dc.subjectH.1.1
dc.titleIdempotents, Mattson-Solomon Polynomials and Binary LDPC codes
dc.typetext

Files

Collections

arXiv