RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

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

Author Index, 1983, Volume 19

A B C D E G I K L M N P R S T V Y Z Full List
V. G. Alekseev
Capabilities of Automata upon Traversing a Plane
Probl. Peredachi Inf., 1983, Volume 19:3,  38–51
A. V. Andzhan
Capabilities of Automata upon Traversing a Plane
Probl. Peredachi Inf., 1983, Volume 19:3,  78–89
L. A. Bassalygo, M. S. Pinsker
Restricted Asynchronous Multiple Access
Probl. Peredachi Inf., 1983, Volume 19:4,  92–96
S. D. Berman, I. I. Grushko
To the Theory of Discrete Signal Processing
Probl. Peredachi Inf., 1983, Volume 19:4,  43–49
B. V. Biryukov, see V. I. Siforov
Probl. Peredachi Inf., 1983, Volume 19:4,  106–109
I. M. Boyarinov
Combined Decoding Methods for Linear Codes with Unequal Protection of Information Symbols
Probl. Peredachi Inf., 1983, Volume 19:1,  21–29
I. M. Boyarinov
Arithmetic $(n,A)$-Codes Dual to Iterative Codes
Probl. Peredachi Inf., 1983, Volume 19:3,  102–106
N. G. Cherkashin
Upper Bounds for the Risk in the Problem of Recognition of Two Classes
Probl. Peredachi Inf., 1983, Volume 19:2,  93–100
S. M. Dodunekov, N. L. Manev
Characterization of Two Classes of Codes that Attain the Griesmer Bound
Probl. Peredachi Inf., 1983, Volume 19:4,  3–10
A. G. D'yachkov, V. V. Rykov
Improvement of the Code-Length Lower Bound for a Multiple-Access Adder Channel
Probl. Peredachi Inf., 1983, Volume 19:4,  103–105
G. S. Evseev
On Decoding Complexity for Linear Codes
Probl. Peredachi Inf., 1983, Volume 19:1,  3–8
N. N. Evtikhiev, E. A. Sandler
Constructive Models of Random Sequences with Specified Statistical Properties and Their Application
Probl. Peredachi Inf., 1983, Volume 19:3,  22–28
S. I. Gel'fand, M. Sh. Pinsker
Converse Coding Theorem for a Gaussian Source with Side Information
Probl. Peredachi Inf., 1983, Volume 19:2,  101–106
G. K. Golubev, M. S. Pinsker
Minimax Extrapolation of Sequences
Probl. Peredachi Inf., 1983, Volume 19:4,  31–42
A. Ya. Gorodetskii
Quantum Estimation Theory for a Markov Message
Probl. Peredachi Inf., 1983, Volume 19:2,  30–37
I. I. Grushko, see S. D. Berman
Probl. Peredachi Inf., 1983, Volume 19:4,  43–49
O. Gulyás, G. Légrády
On Estimation of Information-Type Measures
Probl. Peredachi Inf., 1983, Volume 19:2,  106–109
N. A. Ivanchuk
Analysis of the Efficiency of Some Controlled Search Procedures
Probl. Peredachi Inf., 1983, Volume 19:1,  30–39
N. A. Ivanchuk, see G. P. Tartakovskii
Probl. Peredachi Inf., 1983, Volume 19:3,  68–77
V. A. Kalmyikov
On Derivation of Bispectra for Stationary Stochastic Process
Probl. Peredachi Inf., 1983, Volume 19:4,  100–103
M. Ya. Kelbert, Yu. M. Sukhov
Existence and Uniqueness Conditions for a Random Field Describing the State of a Switching Network
Probl. Peredachi Inf., 1983, Volume 19:4,  50–71
G. G. Khachatryan
Decoding for a Noiseless Channel with Two Users
Probl. Peredachi Inf., 1983, Volume 19:2,  8–13
V. M. Khametov, A. I. Yashin
On Efficient Solution of the Interpolation Problem on the Basis of Observations of Jump Processes
Probl. Peredachi Inf., 1983, Volume 19:2,  38–51
V. I. Korzhik, N. A. Savel'ev
Performance of $q$-ary Coding in Channels with Fading When Multiple-Frequency Signals Are Used
Probl. Peredachi Inf., 1983, Volume 19:3,  3–11
V. Yu. Krachkovskii
Two Decyclical Lengthening Methods for Block Codes
Probl. Peredachi Inf., 1983, Volume 19:2,  14–22
L. A. Kun, L. N. Lupichev
Stable Single-Locus Polyallele Populations
Probl. Peredachi Inf., 1983, Volume 19:1,  91–99
A. V. Kuznetsov
Universal Decoding for a Class of Deterministic Channels
Probl. Peredachi Inf., 1983, Volume 19:4,  97–100
G. Légrády, see O. Gulyás
Probl. Peredachi Inf., 1983, Volume 19:2,  106–109
N. B. Likhanov, see B. S. Tsybakov
Probl. Peredachi Inf., 1983, Volume 19:1,  61–81
N. B. Likhanov, see B. S. Tsybakov
Probl. Peredachi Inf., 1983, Volume 19:2,  69–84
S. N. Litsyn, O. I. Shekhovtsov
Fast Decoding Algorithms for First-Order Reed–Muller codes
Probl. Peredachi Inf., 1983, Volume 19:2,  3–7
L. N. Lupichev, see L. A. Kun
Probl. Peredachi Inf., 1983, Volume 19:1,  91–99
L. G. Malinovskii
Investigation of Monotonicity of Various Criteria of Informativeness
Probl. Peredachi Inf., 1983, Volume 19:1,  40–48
N. L. Manev, see S. M. Dodunekov
Probl. Peredachi Inf., 1983, Volume 19:4,  3–10
A. N. Maslov
Equivalence of Hierarchies of Index Grammars and Macrogrammars
Probl. Peredachi Inf., 1983, Volume 19:1,  106–111
V. A. Mikhailov, see B. S. Tsybakov
Probl. Peredachi Inf., 1983, Volume 19:1,  61–81
G. L. Movsisyan
Perfect Constant-Weight Codes and Steiner Systems
Probl. Peredachi Inf., 1983, Volume 19:2,  109–112
N. E. Nagulin, see G. V. Zaitsev
Probl. Peredachi Inf., 1983, Volume 19:1,  49–60
M. Nussbaum
On Optimal Filtering of a Function of Many Variables in White Gaussian Noise
Probl. Peredachi Inf., 1983, Volume 19:2,  23–29
M. S. Pinsker, L. B. Sofman
Entropy Characteristics and Linear Approximations for a Homogeneous Gaussian Field
Probl. Peredachi Inf., 1983, Volume 19:3,  52–67
M. S. Pinsker, see G. K. Golubev
Probl. Peredachi Inf., 1983, Volume 19:4,  31–42
M. S. Pinsker, see L. A. Bassalygo
Probl. Peredachi Inf., 1983, Volume 19:4,  92–96
M. Sh. Pinsker, see S. I. Gel'fand
Probl. Peredachi Inf., 1983, Volume 19:2,  101–106
G. Sh. Poltyrev
Random-Coding Bounds for Some Broadcast Channels
Probl. Peredachi Inf., 1983, Volume 19:1,  9–20
G. Sh. Poltyrev
Coding in an Asynchronous Multiple-Access Channel
Probl. Peredachi Inf., 1983, Volume 19:3,  12–21
M. Ya. Postan
On Some Markov Queuing Networks with Absolute Priorities
Probl. Peredachi Inf., 1983, Volume 19:3,  90–100
A. M. Romanov
New Binary Codes with Minimum Distance 3
Probl. Peredachi Inf., 1983, Volume 19:3,  101–102
V. V. Rykov, see A. G. D'yachkov
Probl. Peredachi Inf., 1983, Volume 19:4,  103–105
E. A. Sandler, see N. N. Evtikhiev
Probl. Peredachi Inf., 1983, Volume 19:3,  22–28
N. A. Savel'ev, see V. I. Korzhik
Probl. Peredachi Inf., 1983, Volume 19:3,  3–11
N. V. Semakov, see G. V. Zaitsev
Probl. Peredachi Inf., 1983, Volume 19:3,  29–37
O. I. Shekhovtsov, see S. N. Litsyn
Probl. Peredachi Inf., 1983, Volume 19:2,  3–7
I. E. Shparlinskii
On Some Features of Linear Cyclic Codes
Probl. Peredachi Inf., 1983, Volume 19:3,  106–110
V. I. Siforov, B. V. Biryukov
Akademician Aksel Ivanovich Berg (On the 90th Birthday)
Probl. Peredachi Inf., 1983, Volume 19:4,  106–109
L. B. Sofman, see M. S. Pinsker
Probl. Peredachi Inf., 1983, Volume 19:3,  52–67
S. N. Stepanov
Properties of Probability Characteristics of a Communications Network with Repeat Calls
Probl. Peredachi Inf., 1983, Volume 19:1,  82–90
Yu. M. Sukhov, see M. Ya. Kelbert
Probl. Peredachi Inf., 1983, Volume 19:4,  50–71
M. L. Tai
Processes of Self-Assembly of Trees with Dependent Connections
Probl. Peredachi Inf., 1983, Volume 19:4,  84–92
G. P. Tartakovskii, N. A. Ivanchuk
On Selection of Features in Pattern Recognition
Probl. Peredachi Inf., 1983, Volume 19:3,  68–77
V. D. Tonchev
Hadamard-Type Block Designs and Self-Dual Codes
Probl. Peredachi Inf., 1983, Volume 19:4,  25–30
B. S. Tsybakov, V. A. Mikhailov, N. B. Likhanov
Bounds for Packet Transmission Rate in a Random-Multiple-Access System
Probl. Peredachi Inf., 1983, Volume 19:1,  61–81
B. S. Tsybakov, see N. D. Vvedenskaya
Probl. Peredachi Inf., 1983, Volume 19:2,  52–68
B. S. Tsybakov, N. B. Likhanov
Packet Switching in a Channel without Feedback
Probl. Peredachi Inf., 1983, Volume 19:2,  69–84
B. S. Tsybakov, N. D. Vvedenskaya
Random Multiple Access of “Impatient” Packets to a Broadcast Channel
Probl. Peredachi Inf., 1983, Volume 19:4,  72–83
N. D. Vvedenskaya, B. S. Tsybakov
Random Multiple Access of Packets to a Channel with Errors
Probl. Peredachi Inf., 1983, Volume 19:2,  52–68
N. D. Vvedenskaya, see B. S. Tsybakov
Probl. Peredachi Inf., 1983, Volume 19:4,  72–83
V. V. V'yugin
On Computability of the Parameter in a Bernoulli Scheme
Probl. Peredachi Inf., 1983, Volume 19:1,  100–105
A. I. Yashin, see V. M. Khametov
Probl. Peredachi Inf., 1983, Volume 19:2,  38–51
V. I. Yorgov
Binary Self-Dual Codes with Automorphisms of Odd Order
Probl. Peredachi Inf., 1983, Volume 19:4,  11–24
E. F. Yurkov
Estimation of A Posteriori Probability in Problems of Pattern Recognition and Prediction
Probl. Peredachi Inf., 1983, Volume 19:2,  85–92
G. V. Zaitsev, N. E. Nagulin
Class of Fast Fourier Transform Algorithms for a Real Sequence
Probl. Peredachi Inf., 1983, Volume 19:1,  49–60
G. V. Zaitsev, V. A. Zinov'ev, N. V. Semakov
Minimum-Check-Density Codes for Correcting Bytes of Errors, Erasures, or Defects
Probl. Peredachi Inf., 1983, Volume 19:3,  29–37
V. A. Zinov'ev, see G. V. Zaitsev
Probl. Peredachi Inf., 1983, Volume 19:3,  29–37
Проблемы передачи информации Problems of Information Transmission
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019