Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes

We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of vertices). Both the degree and the number of right-hand vertices are polynomially close to optimal, whereas the previous...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of the ACM 2009-06, Vol.56 (4), p.1-34
Hauptverfasser:	GURUSWAMI, Venkatesan, UMANS, Christopher, VADHAN, Salil
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Codes Coding, codes Computer science control theory systems Constants Construction Exact sciences and technology Expanders Extractors Graph theory Graphs Information, signal and communications theory Optimization Polynomials Randomness Signal and communications theory Studies Tasks Telecommunications and information theory Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!