Loading [MathJax]/jax/output/SVG/config.js
Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Problemy Peredachi Informatsii, 1973, Volume 9, Issue 4, Pages 71–80 (Mi ppi925)  
This article is cited in 8 scientific papers (total in 8 papers)

Queueing theory

Explicit Constructions of Concentrators

G. A. Margulis
Full-text PDF (1188 kB) Citations (8)
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.
Received: 02.06.1972
Bibliographic databases:
Document Type: Article
UDC: 621.395.34, 513.83
Language: Russian
Citation: G. A. Margulis, “Explicit Constructions of Concentrators”, Probl. Peredachi Inf., 9:4 (1973), 71–80; Problems Inform. Transmission, 9:4 (1973), 325–332
Citation in format AMSBIB
\Bibitem{Mar73}
\by G.~A.~Margulis
\paper Explicit Constructions of Concentrators
\jour Probl. Peredachi Inf.
\yr 1973
\vol 9
\issue 4
\pages 71--80
\mathnet{http://mi.mathnet.ru/ppi925}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=484767}
\zmath{https://zbmath.org/?q=an:0312.22011}
\transl
\jour Problems Inform. Transmission
\yr 1973
\vol 9
\issue 4
\pages 325--332
Linking options:
  • https://www.mathnet.ru/eng/ppi925
  • https://www.mathnet.ru/eng/ppi/v9/i4/p71
    • This publication is cited in the following 8 articles:
    1. Frolov A. Zyablov V., “On the Multiple Threshold Decoding of Ldpc Codes Over Gf(Q)”, Adv. Math. Commun., 11:1 (2017), 123–137  crossref  isi
    2. R. I. Grigorchuk, “Some topics in the dynamics of group actions on rooted trees”, Proc. Steklov Inst. Math., 273 (2011), 64–175  mathnet  crossref  mathscinet  zmath  isi  elib
    3. A. Frolov, V. V. Zyablov, “Bounds on the minimum code distance for nonbinary codes based on bipartite graphs”, Problems Inform. Transmission, 47:4 (2011), 327–341  mathnet  crossref  mathscinet  isi
    4. D. M. Itsykson, A. A. Kojevnikov, “Lower bounds of static Lovász–Schrijver calculus proofs for Tseitin tautologies”, J. Math. Sci. (N. Y.), 145:3 (2007), 4942–4952  mathnet  crossref  mathscinet  zmath
    5. D. V. Osin, “Kazhdan Constants of Hyperbolic Groups”, Funct. Anal. Appl., 36:4 (2002), 290–297  mathnet  crossref  crossref  mathscinet  zmath  isi
    6. K. Engdahl, K. Sh. Zigangirov, “To the Theory of Low-Density Convolutional Codes. I”, Problems Inform. Transmission, 35:4 (1999), 295–310  mathnet  mathscinet  zmath
    7. Ephremides, A, “Information theory and communication networks: An unconsummated union”, IEEE Transactions on Information Theory, 44:6 (1998), 2416  crossref  isi
    8. A. O. Slisenko, “Complexity problems in computational theory”, Russian Math. Surveys, 36:6 (1981), 23–125  mathnet  crossref  mathscinet  zmath  adsnasa  isi
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:1977
    Full-text PDF :1028
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025