V Yegnanarayanan is a Professor of Mathematics at MNM Jain Engineering College, Chennai. His research interests include graph theory and its applications to both pure maths and theoretical computer science.

Expander graphs are graphs in which every set of vertices has an unusually large number of neighbours. It is a remarkable fact that graphs of this kind exist. Even more remarkable is the spectrum of applications of these graphs, ranging from providing new insights in the field of computational complexity theory to the solution of problems in communication. In this article we show how expander graphs can be used for designing efficient error correcting codes which have fast decoding algorithms.

Read full article (105 Kb)

(Better PDF will be available soon. Please visit again. - webeditor.)

Address for Correspondence
V Yegnanarayanan
3/1145, Plot No.17
Mangaiarkarasi Street
Santhosh Nagar Extension
Porur, Chennai 600 116, India.