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
2001, Volume 37, Issue 3
Information Theory and Coding Theory
Uniform Estimate for a Spectrum of a Linear Code
V. M. Blinovskii
3–5
Some Results Concerning the Design and Decoding of Turbo-Codes
D. V. Trukhachev, M. Lentmaier, K. Sh. Zigangirov
6–23
New Minimum Distance Bounds for Linear Codes over Small Fields
R. N. Daskalov, T. A. Gulliver
24–33
Source Coding
Coding of Run-Length-Limited Sequences
O. F. Kurmaev
34–43
Improving the Efficiency of the PPM Algorithm
D. A. Shkarin
44–54
Communication Network Theory
Queueing Networks with Dynamic Routing and Dynamic Stochastic Bypass of Nodes
E. V. Evdokimovich, Yu. V. Malinkovskii
55–66
On a Retrial Single-Server Queueing System with Finite Buffer and Poisson Flow
P. P. Bocharov, C. D'Apice, N. H. Phong
67–81
Methods for Reducing the Amount of Computation in Modeling Lossy Communication Systems Based on Ignoring Low-Probability States
S. N. Stepanov, V. B. Iversen
82–95
Contact us:
email
Terms of Use
Registration to the website
Logotypes
©
Steklov Mathematical Institute RAS
, 2026