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
1997, Volume 33, Issue 1
Information Theory
Combinatorial Entropy of Images
J. Justesen, Yu. M. Shtar'kov
3–11
On the Asymptotic Capacity of a Multiple-Access Channel
L. Wilhelmsson, K. Sh. Zigangirov
12–20
Multialphabet Weighting Universal Coding of Context Tree Sources
Yu. M. Shtar'kov, Tj. J. Tjalkens, F. M. J. Willems
21–34
Coding Theory
On One Finite Matrix Group and Codes on Euclidean Spheres
V. M. Sidel'nikov
35–54
Codes for the
$m$
-Metric
M. Yu. Rosenbloom, M. A. Tsfasman
55–63
Code-Generating Factorizations of the
$n$
-Dimensional Unit Cube and of Perfect Binary Codes
Yu. L. Vasil'ev, F. I. Solov'eva
64–74
On the Propagation Criterion for Boolean Functions and on Bent Functions
V. V. Yashchenko
75–86
The Euler Characteristic of the Minimal Code Trellis is Maximum
V. R. Sidorenko
87–93
Methods of Signal Processing
Asymptotically Efficient Signal Estimation in
$L_2$
under General Loss Functions
A. B. Tsybakov
94–106
Automata Theory
On Realizability in the Algebra of Unreliable Generalized Contacts
V. V. Tarasov
107–111
Contact us:
email
Terms of Use
Registration to the website
Logotypes
©
Steklov Mathematical Institute RAS
, 2026