Abstract
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.
| Original language | English |
|---|---|
| Publication status | Published - 2008 |
| Event | Workshop "Coding Theory Days in St. Petersburg" - St. Petersburg, Russian Federation Duration: 2008 Oct 6 → … |
Conference
| Conference | Workshop "Coding Theory Days in St. Petersburg" |
|---|---|
| Country/Territory | Russian Federation |
| City | St. Petersburg |
| Period | 2008/10/06 → … |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering