RUS  ENG
Full version
PEOPLE

Pinsker Marks Shlemovich

Publications in Math-Net.Ru

  1. Some Mathematical Questions of Theory of Information Transmission

    Probl. Peredachi Inf., 43:4 (2007),  124–138
  2. On Estimation of Information via Variation

    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

    Probl. Peredachi Inf., 38:2 (2002),  3–18
  4. Epsilon-entropy of an Ellipsoid in a Hamming Space

    Probl. Peredachi Inf., 38:1 (2002),  3–18
  5. Correction of Ordinary and Localized Errors

    Probl. Peredachi Inf., 37:4 (2001),  56–59
  6. On Error-Free Filtering of Singular Processes under Nonstationary Distortions

    Probl. Peredachi Inf., 36:4 (2000),  89–97
  7. Entropy of an Ellipsoid in a Hamming Space

    Probl. Peredachi Inf., 36:4 (2000),  47–52
  8. Information Rate in Memoryless Channels for a Slowly Varying Markov Signal

    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

    Probl. Peredachi Inf., 36:2 (2000),  3–9
  10. On the Hamming Bound for Nonbinary Localized-Error-Correcting Codes

    Probl. Peredachi Inf., 35:2 (1999),  29–37
  11. Centered Error-Correcting Codes

    Probl. Peredachi Inf., 35:1 (1999),  30–37
  12. Stationary Channels with a Random Parameter Which Is a Completely Singular Process

    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

    Probl. Peredachi Inf., 34:4 (1998),  23–38
  14. Error-Free Filtering of an Entropy-Singular Signal under Independent Distortions

    Probl. Peredachi Inf., 34:3 (1998),  3–6
  15. Information Rates in Certain Stationary Non-Gaussian Channels in Weak-Signal Transmission

    Probl. Peredachi Inf., 34:1 (1998),  3–17
  16. Sensitivity of the $\varepsilon$-Entropy of Stationary Continuous-Time Gaussian Processes

    Probl. Peredachi Inf., 33:2 (1997),  3–25
  17. On error-free filtering of some stationary processes

    Uspekhi Mat. Nauk, 52:2(314) (1997),  109–118
  18. Codes Detecting Localized Errors

    Probl. Peredachi Inf., 32:2 (1996),  36–38
  19. Optimal Filtering of a Gaussian Signal Against a Background of Almost Gaussian Noise

    Probl. Peredachi Inf., 31:4 (1995),  3–21
  20. Asymptotically Optimal Binary Codes of Polynomial Complexity Correcting Localized Errors

    Probl. Peredachi Inf., 31:2 (1995),  76–83
  21. Capacity of the Arbitrarily Varying Channel under List Decoding

    Probl. Peredachi Inf., 31:2 (1995),  3–19
  22. Information Rates in Stationary Gaussian Channels in Weak Signal Transmission

    Probl. Peredachi Inf., 30:4 (1994),  3–11
  23. Binary Constant-Weight Codes Correcting Localized Errors and Defects

    Probl. Peredachi Inf., 30:2 (1994),  10–13
  24. Binary Constant-Weight Codes Correcting Localized Errors

    Probl. Peredachi Inf., 28:4 (1992),  103–105
  25. Bounds for Codes with Separately Localized Errors

    Probl. Peredachi Inf., 28:1 (1992),  14–21
  26. Asymptotic Behavior of Nonanticipative Epsilon-Entropy for Gaussian Processes

    Probl. Peredachi Inf., 27:4 (1991),  100–104
  27. Simple Methods for Deriving Lower Bounds in Coding Theory

    Probl. Peredachi Inf., 27:4 (1991),  3–8
  28. Controllable Connector

    Probl. Peredachi Inf., 26:2 (1990),  98–101
  29. Bounds on the Capacity of FCFS Multiple-Access Algorithms

    Probl. Peredachi Inf., 26:1 (1990),  58–67
  30. Signal identification with specified risk

    Avtomat. i Telemekh., 1989, no. 10,  96–104
  31. Delayed Epsilon-Entropy of a Noisy Gaussian Message with Small Reproduction Error

    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”

    Probl. Peredachi Inf., 24:3 (1988),  102–106
  33. Delayed Epsilon-Entropy for a Gaussian Message Corrupted by Noise

    Probl. Peredachi Inf., 24:3 (1988),  18–23
  34. Delayed Epsilon-Entropy for Small Mean-square Reproduction Error

    Probl. Peredachi Inf., 23:2 (1987),  3–8
  35. $(\varepsilon,\delta)$-Entropy of Completely Ergodic Stochastic Processes

    Probl. Peredachi Inf., 22:4 (1986),  3–8
  36. Self-Tuning Algorithm for Minimax Nonparametric Estimation of Spectral Density

    Probl. Peredachi Inf., 22:3 (1986),  62–76
  37. Extremal Problems in Minimax Estimation of Sequences

    Probl. Peredachi Inf., 21:3 (1985),  36–52
  38. A learning algorithm of non-parametric filtering

    Avtomat. i Telemekh., 1984, no. 11,  58–65
  39. Minimax Extrapolation of Functions

    Probl. Peredachi Inf., 20:2 (1984),  27–43
  40. Restricted Asynchronous Multiple Access

    Probl. Peredachi Inf., 19:4 (1983),  92–96
  41. Minimax Extrapolation of Sequences

    Probl. Peredachi Inf., 19:4 (1983),  31–42
  42. Entropy Characteristics and Linear Approximations for a Homogeneous Gaussian Field

    Probl. Peredachi Inf., 19:3 (1983),  52–67
  43. Converse Coding Theorem for a Gaussian Source with Side Information

    Probl. Peredachi Inf., 19:2 (1983),  101–106
  44. Estimation of Square-Integrable Probability Density of a Random Variable

    Probl. Peredachi Inf., 18:3 (1982),  19–38
  45. Zero-Error Capacity for Deterministic Multiple-Access Channels with Common Information

    Probl. Peredachi Inf., 18:1 (1982),  3–11
  46. List Concatenated Decoding

    Probl. Peredachi Inf., 17:4 (1981),  29–33
  47. Estimation of Square-Integrable Density on the Basis of a Sequence of Observations

    Probl. Peredachi Inf., 17:3 (1981),  50–68
  48. Asymptotically Optimal Batch Rearrangeable and Nonrearrangeable Switching Circuits

    Probl. Peredachi Inf., 16:4 (1980),  94–98
  49. Bounds on Volume of Error-Correcting Codes in a Broadcast Channel (Generalized Blackwell Channel)

    Probl. Peredachi Inf., 16:3 (1980),  3–16
  50. Capacity of an Arbitrary Channel with Defects

    Probl. Peredachi Inf., 16:2 (1980),  108–109
  51. Optimal Filtering of Square-Integrable Signals in Gaussian Noise

    Probl. Peredachi Inf., 16:2 (1980),  52–68
  52. Capacity of a Broadcast Channel with One Deterministic Component

    Probl. Peredachi Inf., 16:1 (1980),  24–34
  53. Bounds for Codes with Unequal Protection of Two Sets of Messag

    Probl. Peredachi Inf., 15:3 (1979),  40–49
  54. Coding of Sources on the Basis of Observations with Incomplete Information

    Probl. Peredachi Inf., 15:2 (1979),  45–57
  55. Linear Transmission of Gaussian Messages over a Nonstationary Gaussian Channel with Feedback

    Probl. Peredachi Inf., 15:2 (1979),  3–22
  56. Error correction in channels with defects

    Dokl. Akad. Nauk SSSR, 243:6 (1978),  1361–1364
  57. Capacity of Noiseless Broadcast Channel

    Probl. Peredachi Inf., 14:2 (1978),  28–34
  58. Problems of Complexity in the Theory of Correcting Codes

    Probl. Peredachi Inf., 13:3 (1977),  5–17
  59. Estimation of the error-correction complexity for Gallager low-density codes

    Probl. Peredachi Inf., 11:1 (1975),  23–36
  60. Prognostic Epsilon Entropy of a Gaussian Message and a Gaussian Source

    Probl. Peredachi Inf., 10:2 (1974),  5–25
  61. Decoding Complexity of Low-Density Codes For Transmission in a Channel with Erasures

    Probl. Peredachi Inf., 10:1 (1974),  15–28
  62. Linear Transmission of Nonstationary Gaussian Messages in a Gaussian Channel with Feedback

    Probl. Peredachi Inf., 10:1 (1974),  3–8
  63. Nonanticipatory and Prognostic Epsilon Entropies and Message Generation Rates

    Probl. Peredachi Inf., 9:3 (1973),  12–21
  64. Complexity of an Optimum Nonblocking Switching Network without Reconnections

    Probl. Peredachi Inf., 9:1 (1973),  84–87
  65. Lower Bound for the Power of an Automaton State Code

    Probl. Peredachi Inf., 8:3 (1972),  58–66
  66. The Information Content of Observations, and Asymptotically Sufficient Statistics

    Probl. Peredachi Inf., 8:1 (1972),  45–61
  67. Optimum Linear Transmission through a Memoryless Gaussian Channel with Full Feedback

    Probl. Peredachi Inf., 7:2 (1971),  38–46
  68. Transmission Capacity with Zero Error and Erasure

    Probl. Peredachi Inf., 6:1 (1970),  20–24
  69. Memory Increases Transmission Capacity

    Probl. Peredachi Inf., 5:1 (1969),  94–95
  70. The Probability of Error in Block Transmission in a Memoryless Gaussian Channel with Feedback

    Probl. Peredachi Inf., 4:4 (1968),  3–19
  71. Bounds of the Probability and of the Number of Correctable Errors for Nonblock Codes

    Probl. Peredachi Inf., 3:4 (1967),  58–71
  72. Sequential Decoding in a Continuous Channel

    Probl. Peredachi Inf., 3:4 (1967),  5–17
  73. On the complexity of decoding

    Probl. Peredachi Inf., 1:1 (1965),  113–116
  74. Mathematical foundations of the theory of optimum coding of information

    Itogi Nauki. Ser. Mat. Anal. Teor. Ver. Regulir. 1962, 1964,  197–210
  75. Dynamical systems with completely positive or zero entropy

    Dokl. Akad. Nauk SSSR, 133:5 (1960),  1025–1026
  76. The entropy, rate of establishment of entropy and entropic stability of Gaussian random quantities and processes

    Dokl. Akad. Nauk SSSR, 133:3 (1960),  531–534
  77. The information stability of Gaussian random variables and processes

    Dokl. Akad. Nauk SSSR, 133:1 (1960),  28–30
  78. 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

    Dokl. Akad. Nauk SSSR, 121:1 (1958),  49–51
  79. Extrapolation of homogeneous random fields and the quantity of information on a gaussian random field contained in another gaussian random field

    Dokl. Akad. Nauk SSSR, 112:5 (1957),  815–818
  80. The theory of curves in Hilbert space with stationary $n$th increments

    Izv. Akad. Nauk SSSR Ser. Mat., 19:5 (1955),  319–344

  81. In Memory of Roland L'vovich Dobrushin

    Probl. Peredachi Inf., 32:3 (1996),  3–24
  82. Roland L'vovich Dobrushin (20 July 1919 – 12 November 1995)

    Teor. Veroyatnost. i Primenen., 41:1 (1996),  164–169
  83. Roland L'vovich Dobrushin (on his sixtieth birthday)

    Uspekhi Mat. Nauk, 44:6(270) (1989),  161–162
  84. Symposium on Information Theory

    Probl. Peredachi Inf., 6:2 (1970),  125–127

© Steklov Math. Inst. of RAS, 2024