![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Mark Semenovich Pinsker
Person information
- unicode name: Марк Семено́вич Пи́нскер
- award (1996): IEEE Richard W. Hamming Medal
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
- [j15]Mark S. Pinsker:
Some mathematical questions of theory of information transmission. Probl. Inf. Transm. 43(4): 380-392 (2007) - 2006
- [c3]Rudolf Ahlswede, Mark S. Pinsker:
Report on Models of Write-Efficient Memories with Localized Errors and Defects. GTIT-C 2006: 628-632 - [c2]Ilya Dumer
, Mark S. Pinsker, Vyacheslav V. Prelov:
On the Thinnest Coverings of Spheres and Ellipsoids with Balls in Hamming and Euclidean Spaces. GTIT-C 2006: 898-925 - 2005
- [j14]Rudolf Ahlswede, Mark S. Pinsker:
Report on models of write-efficient memories with localized errors and defects. Electron. Notes Discret. Math. 21: 205-207 (2005) - [j13]Ilya Dumer
, Mark S. Pinsker, Vyacheslav V. Prelov:
On the thinnest coverings of spheres and ellipsoids with balls in Hamming and Euclidean spaces. Electron. Notes Discret. Math. 21: 277 (2005) - [j12]Mark S. Pinsker:
On Estimation of Information via Variation. Probl. Inf. Transm. 41(2): 71-75 (2005) - 2004
- [j11]Ilya Dumer
, Mark S. Pinsker, Vyacheslav V. Prelov:
On coverings of ellipsoids in Euclidean spaces. IEEE Trans. Inf. Theory 50(10): 2348-2356 (2004) - [c1]Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
On the thinnest coverings of ellipsoids. ISIT 2004: 521 - 2002
- [j10]Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
Epsilon-entropy of an Ellipsoid in a Hamming Space. Probl. Inf. Transm. 38(1): 1-15 (2002) - [j9]Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
An Optimization Problem Related to the Computation of the Epsilon-entropy of an Ellipsoid in a Hamming Space. Probl. Inf. Transm. 38(2): 99-112 (2002) - 2001
- [j8]Leonid A. Bassalygo, Mark S. Pinsker:
Correction of Ordinary and Localized Errors. Probl. Inf. Transm. 37(4): 325-328 (2001)
1990 – 1999
- 1997
- [j7]Leonid A. Bassalygo, Mark S. Pinsker:
On codes correcting weakly localized errors. IEEE Trans. Inf. Theory 43(1): 363-364 (1997) - 1995
- [j6]Rudolf Ahlswede, Leonid A. Bassalygo, Mark S. Pinsker:
Localized random and arbitrary errors in the light of arbitrarily varying channel theory. IEEE Trans. Inf. Theory 41(1): 14-25 (1995) - [j5]Mark S. Pinsker, Vyacheslav V. Prelov, Sergio Verdú:
Sensitivity of channel capacity. IEEE Trans. Inf. Theory 41(6): 1877-1888 (1995) - 1993
- [j4]Rudolf Ahlswede, Leonid A. Bassalygo, Mark S. Pinsker:
Nonbinary codes correcting localized errors. IEEE Trans. Inf. Theory 39(4): 1413-1416 (1993) - 1991
- [j3]Leonid A. Bassalygo, S. I. Gelfand, Mark S. Pinsker:
Coding for partially localized errors. IEEE Trans. Inf. Theory 37(3): 880-884 (1991)
1980 – 1989
- 1988
- [j2]Leonid A. Bassalygo, Roland L. Dobrushin, Mark S. Pinsker:
Kolmogorov remembered. IEEE Trans. Inf. Theory 34(2): 174-175 (1988)
1960 – 1969
- 1966
- [j1]Mark S. Pinsker:
Certain mathematical problems in the theory of transmission of information. Kybernetika 2(2): 117-147 (1966)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint