Algebraic constructions of LDPC codes with no short cycles (Q622790)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algebraic constructions of LDPC codes with no short cycles |
scientific article |
Statements
Algebraic constructions of LDPC codes with no short cycles (English)
0 references
4 February 2011
0 references
Summary: 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 the method is 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.
0 references
LDPC codes
0 references
short cycles
0 references
group rings
0 references
low density parity check codes
0 references
wireless standards
0 references
simulation
0 references