Jin, Lei2013-11-072013-11-0720062006Source: Masters Abstracts International, Volume: 45-05, page: 2603.http://hdl.handle.net/10393/27378http://dx.doi.org/10.20381/ruor-18677It is often necessary to apply codes with short block lengths in many delay-sensitive applications. In this thesis, primarily driven by their complexity advantages, we investigate and explore the performance of low-density generator rnatrix (LDGM) codes [1] at short block lengths. We show that with proper constructions LDGM (codes may perform no worse than the state-of-the-art, low-density parity-check codes (LDPC) [2] but with lower complexity. Our construction of LDGM codes uses the Progressive Edge-Growth (PEG) algorithm [3], originally proposed for LDPC codes.64 p.enEngineering, Electronics and Electrical.Thesis