Advertisement

Problems of Information Transmission

, Volume 40, Issue 1, pp 1–4 | Cite as

Mark Semenovich Pinsker. In Memoriam

Article
  • 74 Downloads

Keywords

System Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

List of Publications of M. S. Pinsker

  1. 90.
    1996 Codes Detecting Localized Errors, Probl. Peredachi Inf., vol. 32,no. 2, pp. 36-38 [Probl. Inf. Trans. (Engl. Transl.), vol. 32, no. 2, pp. 168-170] (jointly with L.A. Bassalygo).Google Scholar
  2. 91.
    1996 Sharp-Optimal and Adaptive Estimation for Heteroscedastic Nonparametric Regression, Stat. Sinica, vol. 6, pp. 925-942 (jointly with S.Yu. Efroimovich).Google Scholar
  3. 92.
    1996 Constant-Weight Codes Detecting Localized Errors, in Proc. 5th Int. Workshop on Algebraic and Combinatorial Coding Theory, Sozopol, Bulgaria, June 1-7, pp. 25-26 (jointly with L.A. Bassalygo).Google Scholar
  4. 93.
    1997 On Error-Free Filtering of Some Stationary Processes, Usp. Mat. Nauk, vol. 52,no. 2, pp. 109-118 [Russian Math. Surveys (Engl. Transl.), vol. 52, no. 2, pp. 349-358] (jointly with V.V. Prelov).Google Scholar
  5. 94.
    1997 Sensitivity of the ε-Entropy of Stationary Continuous-Time Gaussian Processes, Probl. Peredachi Inf., vol. 33,no. 2, pp. 3-25 [Probl. Inf. Trans. (Engl. Transl.), vol. 33, no. 2, pp. 95-113] (jointly with V.V. Prelov and S. Verdú).Google Scholar
  6. 95.
    1997 On Codes Correcting Weakly Localized Errors, IEEE Trans. Inf. Theory, vol. 43,no. 1, pp. 363-364 (jointly with L.A. Bassalygo).Google Scholar
  7. 96.
    1998 Information Rates in Certain Stationary Non-Gaussian Channels in Weak-Signal Transmission, Probl. Peredachi Inf., vol. 34,no. 1, pp. 3-17 [Probl. Inf. Trans. (Engl. Transl.), vol. 34, no. 1, pp. 1-13] (jointly with V.V. Prelov and E.C. van der Meulen).Google Scholar
  8. 97.
    1998 Error-Free Filtering of an Entropy-Singular Signal under Independent Distortions, Probl. Peredachi Inf., vol. 34,no. 3, pp. 3-6 [Probl. Inf. Trans. (Engl. Transl.), vol. 34, no. 3, pp. 1-3] (jointly with V.V. Prelov).Google Scholar
  9. 98.
    1998 Upper and Lower Bounds and Asymptotics of the Optimal Filtering Error of a Stationary Process with a Small Information Rate, Probl. Peredachi Inf., vol. 34,no. 4, pp. 23-38 [Probl. Inf. Trans. (Engl. Transl.), vol. 34, no. 4, pp. 309-321] (jointly with V.V. Prelov).Google Scholar
  10. 99.
    1998 Information-Theoretic Methods in Filtering Problems, in Trans. 13th Prague Conf. on Information Theory, Statistical Decision Functions, and Random Processes, Prague, pp. 465-468 (jointly with V.V. Prelov).Google Scholar
  11. 100.
    1999 Stationary Channels with a Random Parameter Which Is a Completely Singular Process, Probl. Peredachi Inf., vol. 35,no. 1, pp. 3-12 [Probl. Inf. Trans. (Engl. Transl.), vol. 35, no. 1, pp. 1-9] (jointly with V.V. Prelov and E.C. van der Meulen).Google Scholar
  12. 101.
    1999 Centered Error-Correcting Codes Probl. Peredachi Inf., vol. 35,no. 1, pp. 30-37 [Probl. Inf. Trans. (Engl. Transl.), vol. 35, no. 1, pp. 25-31] (jointly with L.A. Bassalygo).Google Scholar
  13. 102.
    1999 On the Hamming Bound for Nonbinary Localized-Error-Correcting Codes, Probl. Peredachi Inf., vol. 35,no. 2, pp. 29-37 [Probl. Inf. Trans. (Engl. Transl.), vol. 35, no. 2, pp. 117-124] (jointly with R. Ahlswede and L.A. Bassalygo).Google Scholar
  14. 103.
    2000 Evaluation of the Asymptotics of the Summarized Capacity of an M-Frequency T-User Noise-less Multiple-Access Channel, Probl. Peredachi Inf., vol. 36,no. 2, pp. 3-9 [Probl. Inf. Trans. (Engl. Transl.), vol. 36, no. 2, pp. 91-97] (jointly with L.A. Bassalygo).Google Scholar
  15. 104.
    2000 Information Rate in Memoryless Channels for a Slowly Varying Markov Signal, Probl. Peredachi Inf., vol. 36,no. 3, pp. 29-38 [Probl. Inf. Trans. (Engl. Transl.), vol. 36, no. 3, pp. 29-38] (jointly with V.V. Prelov and E.C. van der Meulen).Google Scholar
  16. 105.
    Pinsker, M.S., 2000 Entropy of an Ellipsoid in a Hamming Space, Probl. Peredachi Inf., vol. 36,no. 4, pp. 47-52 [Probl. Inf. Trans. (Engl. Transl.), vol. 36, no. 4, pp. 325-330].Google Scholar
  17. 106.
    2000 On Error-Free Filtering of Singular Processes under Nonstationary Distortions, Probl. Peredachi Inf., vol. 36,no. 4, pp. 89-97 [Probl. Inf. Trans. (Engl. Transl.), vol. 36, no. 4, pp. 362-369] (jointly with V.V. Prelov).Google Scholar
  18. 107.
    2001 Correction of Ordinary and Localized Errors, Probl. Peredachi Inf., vol. 37,no. 4, pp. 56-59 [Probl. Inf. Trans. (Engl. Transl.), vol. 37, no. 4, pp. 325-328] (jointly with L.A. Bassalygo).Google Scholar
  19. 108.
    2001 Asymptotic Investigation of the Information Rates in Certain Stationary Channels with and without Memory, Amer. J. Math. Manag. Sci., vol. 21,no. 1-2, pp. 29-42 (jointly with V.V. Prelov and E.C. van der Meulen).Google Scholar
  20. 109.
    2002 Epsilon-entropy of an Ellipsoid in a Hamming Space, Probl. Peredachi Inf., vol. 38,no. 1, pp. 3-18 [Probl. Inf. Trans. (Engl. Transl.), vol. 38, no. 1, pp. 1-15] (jointly with I.I. Dumer and V.V. Prelov).Google Scholar
  21. 110.
    2002 An Optimization Problem Related to the Computation of the Epsilon-entropy of an Ellipsoid in a Hamming Space, Probl. Peredachi Inf., vol. 38,no. 2, pp. 3-18 [Probl. Inf. Trans. (Engl. Transl.), vol. 38, no. 2, pp. 99-112] (jointly with I.I. Dumer and V.V. Prelov).Google Scholar
  22. 111.
    2003 On Coverings of Ellipsoids in Euclidean Spaces, sumbitted to IEEE Trans. Inf. Theory (jointly with I.I. Dumer and V.V. Prelov).Google Scholar
  23. 112.
    2003 On the Thinnest Coverings of Spheres and Ellipsoids with Balls in Hamming and Euclidean Spaces, submitted to General Theory of Information Transfer and Combinatorics (jointly with I.I. Dumer and V.V. Prelov).Google Scholar

Copyright information

© MAIK “Nauka/Interperiodica” 2004

Personalised recommendations