Array Codes as LDPC Codes

An area of great interest for LDPC codes is the use of structured constructions rather than random constructions. These include graph theoretic approaches, such as the constructions by Margulis [Mar82] and Tanner [Tan00]. Ramanujan graphs are considered by Rosenthal and Vontobel [RV00] and finite geometries are used by Kou, Lin and Fos-sorier [KLF00]. The regular structure can be used to guarantee distance properties, improve cycle characteristics or simplify the implementation.