On Expanders Graphs: Parameters and Applications
H. L. Janwa A. K. Lal
Abstract
We give a new lower bound on the expansion coefficient of an edge-vertex graph of a d-regular graph. As a consequence, we obtain an improvement on the lower bound on relative minimum distance of the expander codes constructed by Sipser and Spielman. We also derive some improved results on the vertex expansion of graphs that help us in improving the parameters of the expander codes of Alon, Bruck, Naor, Naor, and Roth.
Create a lesson
Related papers
Optimal Support Size Testing
Qisheng Wang
Dynamic Attack Surfaces: A Queue of Branching Processes
Ismail Cosandal, Abdullah Y. Etcibasi, C. Emre Koksal et al.
On Han- and Shearer-Type Information Inequalities: Equality Conditions and Combinatorial Applications
Gunank Jakhar, Gowtham R. Kurri, Suryajith Chillara et al.
Solomonoff induction of selected bits and online classification
Bruno Bauwens, German Kuznetsov
Rate-Splitting Multiple Access for RIS-Enabled Full-Duplex Communications with User Relaying
Yuwen Cao, Hui Wang, Tomoaki Ohtsuki et al.
Full classification of Zps-linear generalized Hadamard codes
Dipak K. Bhunia