GF(2^m) Low-Density Parity-Check Codes Derived from Cyclotomic Cosets

Simple item page
dc.creatorTjhai, C.
dc.creatorTomlinson, M.
dc.creatorHoran, R.
dc.creatorAmbroze, M.
dc.creatorAhmed, M.
dc.date2005-02-07
dc.date2005-07-23
dc.date.accessioned2026-07-07T08:15:21Z
dc.date.available2026-07-07T08:15:21Z
dc.descriptionBased on the ideas of cyclotomic cosets, idempotents and Mattson-Solomon polynomials, we present a new method to construct GF(2^m), where m>0 cyclic low-density parity-check codes. The construction method produces the dual code idempotent which is used to define the parity-check matrix of the low-density parity-check code. An interesting feature of this construction method is the ability to increment the code dimension by adding more idempotents and so steadily decrease the sparseness of the parity-check matrix. We show that the constructed codes can achieve performance very close to the sphere-packing-bound constrained for binary transmission.
dc.descriptionCoding
dc.identifierhttps://arxiv.org/abs/cs/0502037
dc.identifierhttp://arxiv.org/abs/cs/0502037
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133420
dc.subjectInformation Theory
dc.titleGF(2^m) Low-Density Parity-Check Codes Derived from Cyclotomic Cosets
dc.typetext

Files

Collections

arXiv