On the Expanding Properties of Gallager's LDPC Matrices
(2008) Workshop "Coding Theory Days in St. Petersburg"- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1176743
- author
- Zyablov, Victor ; Loncar, Maja LU and Johannesson, Rolf LU
- organization
- publishing date
- 2008
- type
- Contribution to conference
- publication status
- published
- subject
- conference name
- Workshop "Coding Theory Days in St. Petersburg"
- conference location
- St. Petersburg, Russian Federation
- conference dates
- 2008-10-06
- language
- English
- LU publication?
- yes
- id
- ae09924b-7013-4bc4-acc8-070428cc9a55 (old id 1176743)
- date added to LUP
- 2016-04-04 13:48:41
- date last changed
- 2021-04-14 14:51:38
@misc{ae09924b-7013-4bc4-acc8-070428cc9a55, 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.}}, author = {{Zyablov, Victor and Loncar, Maja and Johannesson, Rolf}}, language = {{eng}}, title = {{On the Expanding Properties of Gallager's LDPC Matrices}}, url = {{https://lup.lub.lu.se/search/files/6210584/1176773.pdf}}, year = {{2008}}, }