Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

1 2015

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Ramanujan graphs

Sortuj według:

Ogranicz wyniki do:

Algorithms for generation of Ramanujan graphs, other Expanders and related LDPC codes

Polak M., Ustimenko V.

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

2015

Vol. 15, no. 2

14--21

Expander graphs are highly connected sparse finite graphs. The property of being an expander seems significant in many of these mathematical, computational and physical contexts. For practical applications it is very important to construct expander and Ramanujan graphs with given regularity and order. In general, constructions of the best expander graphs with a given regularity and order is no easy task. In this paper we present algorithms for generation of Ramanujan graphs and other expanders. We describe properties of obtained graphs in comparison to previously known results. We present a method to obtain a new examples of irregular LDPC codes based on described graphs and we briefly describe properties of this codes.