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
1981, Volume 17, Issue 3
Information Theory and Coding Theory
On Code Distances for a Class of Group Codes
K. Buzási, A. Pethö, P. Lakotos
3–12
On Optimal Bit Allocation Algorithm for Quantizing a Random Vector
A. V. Trushkin
13–19
Estimation of Mean Error for a Discrete Successive-Approximation Scheme
V. N. Koshelev
20–33
On Properties of the Statistical Estimate of the Entropy of a Random Vector with a Probability Density
A. V. Ivanov, M. N. Rozhkova
34–43
Methods of Signal Processing
Optimum Compensation for Structurally Deterministic Noise
A. S. Kotousov
44–49
Estimation of Square-Integrable Density on the Basis of a Sequence of Observations
S. Yu. Efroimovich, M. S. Pinsker
50–68
Asymptotic Power of Statistical Criteria for Counting Processes
Yu. N. Lin'kov
69–80
Communication Network Theory
Asymptotically Optimal Switching Circuits
L. A. Bassalygo
81–88
Asymptotic Analysis of a Complete Communication Network with a Large Number of Points and Bypass Routes
V. V. Marbukh
89–95
Contact us:
email
Terms of Use
Registration to the website
Logotypes
©
Steklov Mathematical Institute RAS
, 2026