On the Expanding Properties of Gallager's LDPC Matrices
This paper investigates expanding properties of ensembles of random bipartite graphs whose adjacency matrices are Gallager's low-density parity-check matrices. Two methods for calculating the expansion coefficient are demonstrated. It is shown that in the ensemble of the considered bipartite graphs, there exist graphs which have better expanding properties than the previously known expanders.
- Electrical Engineering, Electronic Engineering, Information Engineering
Workshop "Coding Theory Days in St. Petersburg"
- Information Theory-lup-obsolete