Algebraic constructions of LDPC codes with no short cycles

Details Algebraic constructions of LDPC codes with no short cycles Algebraic constructions of LDPC codes with no short cycles

2008-07-21

arxiv.org/abs/0807.3337v1

Mathematics

Rings and Algebras

13 pages, 8 figures in pdf format

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Algebraic constructions of LDPC codes with no short cycles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algebraic constructions of LDPC codes with no short cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algebraic constructions of LDPC codes with no short cycles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-435217