Algebraic constructions of LDPC codes with no short cycles

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

An algebraic group ring method for constructing codes with no short cycles in the check matrix is derived. It is shown that the matrix of a group ring element has no short cycles if and only if the collection of group differences of this element has no repeats. When applied to elements in the group ring with small support this gives a general method for constructing and analysing low density parity check (LDPC) codes with no short cycles from group rings. Examples of LDPC codes with no short cycles are constructed from group ring elements and these are simulated and compared with known LDPC codes, including those adopted for wireless standards.
13 pages, 8 figures in pdf format

Keywords

Rings and Algebras, Information Theory, 94B60, 16S34

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0807.3337
 http://arxiv.org/abs/0807.3337

Collections

arXiv