Problemy Peredachi Informatsii
RUS
ENG
JOURNALS
PEOPLE
ORGANISATIONS
CONFERENCES
SEMINARS
VIDEO LIBRARY
PACKAGE AMSBIB
JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website
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
2018, Volume 54, Issue 2
Coding Theory
On the smallest size of an almost complete subset of a conic in
$\mathrm{PG}(2,q)$
and extendability of Reed–Solomon codes
D. Bartoli, A. A. Davydov, S. Marcugini, F. Pambianco
3–19
Compositional restricted multiple access channel
E. E. Egorova, V. S. Potapova
20–28
Methods of Signal Processing
On discrimination between classes of distribution tails
I. V. Rodionov
29–44
Large Systems
Improved Frankl–Rödl theorem and some of its geometric consequences
A. A. Sagdeev
45–72
Clique numbers of random subgraphs of some distance graphs
A. S. Gusev
73–85
Communication Network Theory
Maximum remaining service time in infinite-server queues
A. V. Lebedev
86–102
Information-theoretic approach to estimating the capacity of distributed memory systems
B. Ya. Ryabko
103–111
Contact us:
email
Terms of Use
Registration to the website
Logotypes
©
Steklov Mathematical Institute RAS
, 2025