| A Construction of Low Density Parity Check Codes Based on Finite Geometries |
| Matt Koetz |
| Department of Mathematics and Statistics |
| University of Nebraska - Lincoln |
| Linear codes are used to introduce redundancies into information so that transmission errors can be corrected. Low density parity check (LDPC) codes are useful because encoding and decoding can be done quickly. In this talk we will demonstrate a specific construction for a family of LDPC codes based on the points and lines of Euclidean geometries over finite fields (essentially finite vector spaces). |