Mark Semjonowitsch Pinsker

from Wikipedia, the free encyclopedia

Mark Semenovich Pinsker ( Russian Марк Семенович Пинскер , even Mark Schlemowitsch Pinsker, Russian Марк Шлемович Пинскер * 24. April 1925 , † 23. December 2003 ) was a Russian mathematician who deals with information theory , probability theory , mathematical statistics, ergodic theory and coding theory dealt .

Mark Pinsker, Leningrad 1976

Pinsker was a student of Andrei Kolmogorov at Lomonosov University and later at the Institute for Information Transmission Problems (IITP) of the Soviet Academy of Sciences.

At first he studied stochastic processes under Kolmogorow and entropy of dynamic systems according to Kolmogorow (introduction of the Pinsker partition 1960). Pinsker also achieved important results in the theory of circuit complexity and coding problems.

In 1996 he received the Richard W. Hamming Medal and in 1978 the Claude E. Shannon Award .

Fonts

  • Dynamical systems with completely positive and vanishing entropy (Russian), Doklady Akad. Nauka SSSR, 133, 1960, 1025-1026
  • Information and information stability of random variables and processes , Holden Day 1964
  • with LA Bassalygo The complexity of an optimal non-blocking commutation scheme without reorganization , Problemy Peredaci Informacii, 9, 1973, 84-87, 1973 (Russian), English translation in Problems of Information Transmission, 9, 1974, 64-66.
  • On the complexity of a concentrator , 7th International Teletraffic Conference, 1973, pp. 318 / 1-318 / 4
  • Estimation of error-correction complexity of Gallager low-density codes , Problems of Information Transmission, 11, 1976, pp. 18-28

Web links

Individual evidence

  1. ↑ Mark Semjonowitsch Pinsker in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
personal data
SURNAME Pinsker, Mark Semjonowitsch
ALTERNATIVE NAMES Пинскер, Марк Семенович
BRIEF DESCRIPTION Russian mathematician
DATE OF BIRTH April 24, 1925
DATE OF DEATH December 23, 2003