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
2016, Volume 52, Issue 1
Information Theory
Remark on “On the capacity of a multiple-access vector adder channel” by A. A. Frolov and V. V. Zyablov
E. A. Bakin, G. S. Evseev
3–7
Coding Theory
Upper bound on the minimum distance of LDPC codes over
$GF(q)$
based on counting the number of syndromes
A. A. Frolov
8–15
Large Systems
Analysis of queues with hyperexponential arrival distributions
V. N. Tarasov
16–26
Communication Network Theory
Lattice flows in networks
V. D. Shmatkov
27–42
Source Coding
Simple one-shot bounds for various source coding problems using smooth Rényi quantities
N. A. Warsi
43–71
Interactive function computation via polar coding
T. C. Gülcü, A. M. Barg
72–100
Time series prediction based on data compression methods
A. S. Lysyak, B. Ya. Ryabko
101–109
Letter to the Editor
E. A. Karatsuba
110–111
Contact us:
email
Terms of Use
Registration to the website
Logotypes
©
Steklov Mathematical Institute RAS
, 2025