Explicit Constructions of Concentrators

In the solution of certain problems of switching and coding theory it is required to synthesize structures similar to what in the present article are called concentrators. While the existence of concentrators is easily proved on probabilistic grounds, their explicit construction proves difficult. The theory of group representations is used to solve the problems of the explicit construction of concentrators.