RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
 
Pinsker Marks Shlemovich
(1925–2003)

Statistics Math-Net.Ru
Total publications: 83
Scientific articles: 79

Number of views:
This page:1549
Abstract pages:22071
Full texts:7230
References:410

http://www.mathnet.ru/eng/person17334
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/139800

Publications in Math-Net.Ru
1. Some Mathematical Questions of Theory of Information Transmission
M. S. Pinsker
Probl. Peredachi Inf., 43:4 (2007),  124–138
2. On Estimation of Information via Variation
M. S. Pinsker
Probl. Peredachi Inf., 41:2 (2005),  3–8
3. An Optimization Problem Related to the Computation of the Epsilon-entropy of an Ellipsoid in a Hamming Space
I. I. Dumer, M. S. Pinsker, V. V. Prelov
Probl. Peredachi Inf., 38:2 (2002),  3–18
4. Epsilon-entropy of an Ellipsoid in a Hamming Space
I. I. Dumer, M. S. Pinsker, V. V. Prelov
Probl. Peredachi Inf., 38:1 (2002),  3–18
5. Correction of Ordinary and Localized Errors
L. A. Bassalygo, M. S. Pinsker
Probl. Peredachi Inf., 37:4 (2001),  56–59
6. On Error-Free Filtering of Singular Processes under Nonstationary Distortions
M. S. Pinsker, V. V. Prelov
Probl. Peredachi Inf., 36:4 (2000),  89–97
7. Entropy of an Ellipsoid in a Hamming Space
M. S. Pinsker
Probl. Peredachi Inf., 36:4 (2000),  47–52
8. Information Rate in Memoryless Channels for a Slowly Varying Markov Signal
M. S. Pinsker, V. V. Prelov, E. C. van der Meulen
Probl. Peredachi Inf., 36:3 (2000),  29–38
9. Evaluation of the Asymptotics of the Summarized Capacity of an $M$-Frequency $T$-User Noiseless Multiple-Access Channel
L. A. Bassalygo, M. S. Pinsker
Probl. Peredachi Inf., 36:2 (2000),  3–9
10. On the Hamming Bound for Nonbinary Localized-Error-Correcting Codes
R. Ahlswede, L. A. Bassalygo, M. S. Pinsker
Probl. Peredachi Inf., 35:2 (1999),  29–37
11. Centered Error-Correcting Codes
L. A. Bassalygo, M. S. Pinsker
Probl. Peredachi Inf., 35:1 (1999),  30–37
12. Stationary Channels with a Random Parameter Which Is a Completely Singular Process
M. S. Pinsker, V. V. Prelov, E. C. van der Meulen
Probl. Peredachi Inf., 35:1 (1999),  3–12
13. Upper and Lower Bounds and Asymptotics of Optimal Filtering Error of a Stationary Process with a Small Information Rate
M. S. Pinsker, V. V. Prelov
Probl. Peredachi Inf., 34:4 (1998),  23–38
14. Error-Free Filtering of an Entropy-Singular Signal under Independent Distortions
M. S. Pinsker, V. V. Prelov
Probl. Peredachi Inf., 34:3 (1998),  3–6
15. Information Rates in Certain Stationary Non-Gaussian Channels in Weak-Signal Transmission
M. S. Pinsker, V. V. Prelov, E. C. van der Meulen
Probl. Peredachi Inf., 34:1 (1998),  3–17
16. Sensitivity of the $\varepsilon$-Entropy of Stationary Continuous-Time Gaussian Processes
M. S. Pinsker, V. V. Prelov, S. Verdú
Probl. Peredachi Inf., 33:2 (1997),  3–25
17. On error-free filtering of some stationary processes
M. Sh. Pinsker, V. V. Prelov
Uspekhi Mat. Nauk, 52:2(314) (1997),  109–118
18. Codes Detecting Localized Errors
L. A. Bassalygo, M. S. Pinsker
Probl. Peredachi Inf., 32:2 (1996),  36–38
19. Optimal Filtering of a Gaussian Signal Against a Background of Almost Gaussian Noise
M. S. Pinsker, V. V. Prelov
Probl. Peredachi Inf., 31:4 (1995),  3–21
20. Asymptotically Optimal Binary Codes of Polynomial Complexity Correcting Localized Errors
R. Ahlswede, L. A. Bassalygo, M. S. Pinsker
Probl. Peredachi Inf., 31:2 (1995),  76–83
21. Capacity of the Arbitrarily Varying Channel under List Decoding
V. M. Blinovskii, P. Narajan, M. S. Pinsker
Probl. Peredachi Inf., 31:2 (1995),  3–19
22. Information Rates in Stationary Gaussian Channels in Weak Signal Transmission
M. S. Pinsker, V. V. Prelov
Probl. Peredachi Inf., 30:4 (1994),  3–11
23. Binary Constant-Weight Codes Correcting Localized Errors and Defects
R. Ahlswede, L. A. Bassalygo, M. S. Pinsker
Probl. Peredachi Inf., 30:2 (1994),  10–13
24. Binary Constant-Weight Codes Correcting Localized Errors
L. A. Bassalygo, M. S. Pinsker
Probl. Peredachi Inf., 28:4 (1992),  103–105
25. Bounds for Codes with Separately Localized Errors
L. A. Bassalygo, S. I. Gel'fand, M. S. Pinsker
Probl. Peredachi Inf., 28:1 (1992),  14–21
26. Asymptotic Behavior of Nonanticipative Epsilon-Entropy for Gaussian Processes
A. K. Gorbunov, M. S. Pinsker
Probl. Peredachi Inf., 27:4 (1991),  100–104
27. Simple Methods for Deriving Lower Bounds in Coding Theory
L. A. Bassalygo, S. I. Gel'fand, M. S. Pinsker
Probl. Peredachi Inf., 27:4 (1991),  3–8
28. Controllable Connector
L. A. Bassalygo, M. S. Pinsker
Probl. Peredachi Inf., 26:2 (1990),  98–101
29. Bounds on the Capacity of FCFS Multiple-Access Algorithms
N. D. Vvedenskaya, M. S. Pinsker
Probl. Peredachi Inf., 26:1 (1990),  58–67
30. Signal identification with specified risk
S. Yu. Efroimovich, M. S. Pinsker
Avtomat. i Telemekh., 1989, no. 10,  96–104
31. Delayed Epsilon-Entropy of a Noisy Gaussian Message with Small Reproduction Error
A. K. Gorbunov, M. S. Pinsker
Probl. Peredachi Inf., 25:3 (1989),  53–61
32. A Comment on the Paper of Kasami, Lin, Wei, and Yamamura, “Coding for the Binary Symmetric Broadcast Channel with Two Receivers”
L. A. Bassalygo, M. S. Pinsker
Probl. Peredachi Inf., 24:3 (1988),  102–106
33. Delayed Epsilon-Entropy for a Gaussian Message Corrupted by Noise
A. K. Gorbunov, M. S. Pinsker
Probl. Peredachi Inf., 24:3 (1988),  18–23
34. Delayed Epsilon-Entropy for Small Mean-square Reproduction Error
M. S. Pinsker, A. K. Gorbunov
Probl. Peredachi Inf., 23:2 (1987),  3–8
35. $(\varepsilon,\delta)$-Entropy of Completely Ergodic Stochastic Processes
M. S. Pinsker, L. B. Sofman
Probl. Peredachi Inf., 22:4 (1986),  3–8
36. Self-Tuning Algorithm for Minimax Nonparametric Estimation of Spectral Density
S. Yu. Efroimovich, M. S. Pinsker
Probl. Peredachi Inf., 22:3 (1986),  62–76
37. Extremal Problems in Minimax Estimation of Sequences
G. K. Golubev, M. S. Pinsker
Probl. Peredachi Inf., 21:3 (1985),  36–52
38. A learning algorithm of non-parametric filtering
S. Yu. Efroimovich, M. S. Pinsker
Avtomat. i Telemekh., 1984, no. 11,  58–65
39. Minimax Extrapolation of Functions
G. K. Golubev, M. S. Pinsker
Probl. Peredachi Inf., 20:2 (1984),  27–43
40. Restricted Asynchronous Multiple Access
L. A. Bassalygo, M. S. Pinsker
Probl. Peredachi Inf., 19:4 (1983),  92–96
41. Minimax Extrapolation of Sequences
G. K. Golubev, M. S. Pinsker
Probl. Peredachi Inf., 19:4 (1983),  31–42
42. Entropy Characteristics and Linear Approximations for a Homogeneous Gaussian Field
M. S. Pinsker, L. B. Sofman
Probl. Peredachi Inf., 19:3 (1983),  52–67
43. Converse Coding Theorem for a Gaussian Source with Side Information
S. I. Gel'fand, M. Sh. Pinsker
Probl. Peredachi Inf., 19:2 (1983),  101–106
44. Estimation of Square-Integrable Probability Density of a Random Variable
S. Yu. Efroimovich, M. S. Pinsker
Probl. Peredachi Inf., 18:3 (1982),  19–38
45. Zero-Error Capacity for Deterministic Multiple-Access Channels with Common Information
L. A. Bassalygo, M. S. Pinsker, V. V. Prelov
Probl. Peredachi Inf., 18:1 (1982),  3–11
46. List Concatenated Decoding
V. V. Zyablov, M. S. Pinsker
Probl. Peredachi Inf., 17:4 (1981),  29–33
47. Estimation of Square-Integrable Density on the Basis of a Sequence of Observations
S. Yu. Efroimovich, M. S. Pinsker
Probl. Peredachi Inf., 17:3 (1981),  50–68
48. Asymptotically Optimal Batch Rearrangeable and Nonrearrangeable Switching Circuits
L. A. Bassalygo, M. S. Pinsker
Probl. Peredachi Inf., 16:4 (1980),  94–98
49. Bounds on Volume of Error-Correcting Codes in a Broadcast Channel (Generalized Blackwell Channel)
L. A. Bassalygo, M. S. Pinsker
Probl. Peredachi Inf., 16:3 (1980),  3–16
50. Capacity of an Arbitrary Channel with Defects
S. I. Gel'fand, M. S. Pinsker
Probl. Peredachi Inf., 16:2 (1980),  108–109
51. Optimal Filtering of Square-Integrable Signals in Gaussian Noise
M. S. Pinsker
Probl. Peredachi Inf., 16:2 (1980),  52–68
52. Capacity of a Broadcast Channel with One Deterministic Component
S. I. Gel'fand, M. S. Pinsker
Probl. Peredachi Inf., 16:1 (1980),  24–34
53. Bounds for Codes with Unequal Protection of Two Sets of Messag
L. A. Bassalygo, V. A. Zinov'ev, V. V. Zyablov, M. S. Pinsker, G. Sh. Poltyrev
Probl. Peredachi Inf., 15:3 (1979),  40–49
54. Coding of Sources on the Basis of Observations with Incomplete Information
S. I. Gel'fand, M. S. Pinsker
Probl. Peredachi Inf., 15:2 (1979),  45–57
55. Linear Transmission of Gaussian Messages over a Nonstationary Gaussian Channel with Feedback
I. A. Ovseevich, M. S. Pinsker
Probl. Peredachi Inf., 15:2 (1979),  3–22
56. Capacity of Noiseless Broadcast Channel
M. S. Pinsker
Probl. Peredachi Inf., 14:2 (1978),  28–34
57. Problems of Complexity in the Theory of Correcting Codes
L. A. Bassalygo, V. V. Zyablov, M. S. Pinsker
Probl. Peredachi Inf., 13:3 (1977),  5–17
58. Estimation of the error-correction complexity for Gallager low-density codes
V. V. Zyablov, M. S. Pinsker
Probl. Peredachi Inf., 11:1 (1975),  23–36
59. Prognostic Epsilon Entropy of a Gaussian Message and a Gaussian Source
A. K. Gorbunov, M. S. Pinsker
Probl. Peredachi Inf., 10:2 (1974),  5–25
60. Decoding Complexity of Low-Density Codes For Transmission in a Channel with Erasures
V. V. Zyablov, M. S. Pinsker
Probl. Peredachi Inf., 10:1 (1974),  15–28
61. Linear Transmission of Nonstationary Gaussian Messages in a Gaussian Channel with Feedback
I. A. Ovseevich, M. S. Pinsker
Probl. Peredachi Inf., 10:1 (1974),  3–8
62. Nonanticipatory and Prognostic Epsilon Entropies and Message Generation Rates
A. K. Gorbunov, M. Sh. Pinsker
Probl. Peredachi Inf., 9:3 (1973),  12–21
63. Complexity of an Optimum Nonblocking Switching Network without Reconnections
L. A. Bassalygo, M. S. Pinsker
Probl. Peredachi Inf., 9:1 (1973),  84–87
64. Lower Bound for the Power of an Automaton State Code
M. S. Pinsker, Yu. L. Sagalovich
Probl. Peredachi Inf., 8:3 (1972),  58–66
65. The Information Content of Observations, and Asymptotically Sufficient Statistics
M. S. Pinsker
Probl. Peredachi Inf., 8:1 (1972),  45–61
66. Optimum Linear Transmission through a Memoryless Gaussian Channel with Full Feedback
A. G. D'yachkov, M. S. Pinsker
Probl. Peredachi Inf., 7:2 (1971),  38–46
67. Transmission Capacity with Zero Error and Erasure
M. S. Pinsker, A. Yu. Sheverdyaev
Probl. Peredachi Inf., 6:1 (1970),  20–24
68. Memory Increases Transmission Capacity
R. L. Dobrushin, M. S. Pinsker
Probl. Peredachi Inf., 5:1 (1969),  94–95
69. The Probability of Error in Block Transmission in a Memoryless Gaussian Channel with Feedback
M. S. Pinsker
Probl. Peredachi Inf., 4:4 (1968),  3–19
70. Bounds of the Probability and of the Number of Correctable Errors for Nonblock Codes
M. S. Pinsker
Probl. Peredachi Inf., 3:4 (1967),  58–71
71. Sequential Decoding in a Continuous Channel
K. Sh. Zigangirov, M. S. Pinsker, B. S. Tsybakov
Probl. Peredachi Inf., 3:4 (1967),  5–17
72. On the complexity of decoding
M. S. Pinsker
Probl. Peredachi Inf., 1:1 (1965),  113–116
73. Mathematical foundations of the theory of optimum coding of information
M. S. Pinsker
Itogi Nauki. Ser. Mat. Anal. Teor. Ver. Regulir. 1962, 1964,  197–210
74. Dynamical systems with completely positive or zero entropy
M. S. Pinsker
Dokl. Akad. Nauk SSSR, 133:5 (1960),  1025–1026
75. The entropy, rate of establishment of entropy and entropic stability of Gaussian random quantities and processes
M. S. Pinsker
Dokl. Akad. Nauk SSSR, 133:3 (1960),  531–534
76. The information stability of Gaussian random variables and processes
M. S. Pinsker
Dokl. Akad. Nauk SSSR, 133:1 (1960),  28–30
77. The extrapolation of random vector processes and the quantity of information contained in a stationary random vector process relative to another one stationarily connected with it
M. S. Pinsker
Dokl. Akad. Nauk SSSR, 121:1 (1958),  49–51
78. Extrapolation of homogeneous random fields and the quantity of information on a gaussian random field contained in another gaussian random field
M. S. Pinsker
Dokl. Akad. Nauk SSSR, 112:5 (1957),  815–818
79. The theory of curves in Hilbert space with stationary $n$th increments
M. S. Pinsker
Izv. Akad. Nauk SSSR Ser. Mat., 19:5 (1955),  319–344

80. In Memory of Roland L'vovich Dobrushin
L. A. Bassalygo, V. A. Malyshev, R. A. Minlos, I. A. Ovseevich, E. A. Pechersky, M. S. Pinsker, V. V. Prelov, A. N. Rybko, Yu. M. Sukhov, S. B. Shlosman
Probl. Peredachi Inf., 32:3 (1996),  3–24
81. Roland L'vovich Dobrushin (20 July 1919 – 12 November 1995)
B. M. Gurevich, I. A. Ibragimov, R. A. Minlos, I. A. Ovseevich, V. I. Oseledets, M. S. Pinsker, V. V. Prelov, Yu. V. Prokhorov, Ya. G. Sinai, A. S. Holevo, A. N. Shiryaev
Teor. Veroyatnost. i Primenen., 41:1 (1996),  164–169
82. Roland L'vovich Dobrushin (on his sixtieth birthday)
A. A. Kirillov, V. A. Malyshev, R. A. Minlos, S. P. Novikov, M. Sh. Pinsker, Ya. G. Sinai, Yu. M. Sukhov, S. B. Shlosman
Uspekhi Mat. Nauk, 44:6(270) (1989),  161–162
83. Symposium on Information Theory
M. S. Pinsker
Probl. Peredachi Inf., 6:2 (1970),  125–127

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018