RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1973 Volume 9, Issue 4, Pages 71–80 (Mi ppi925)

This article is cited in 8 papers

Queueing theory

Explicit Constructions of Concentrators

G. A. Margulis


Abstract: 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.

UDC: 621.395.34, 513.83

Received: 02.06.1972


 English version:
Problems of Information Transmission, 1973, 9:4, 325–332

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024