M. S. Pinsker

From MaRDI portal
Revision as of 19:50, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:174186

Available identifiers

zbMath Open pinsker.mark-sDBLP16/5752WikidataQ3294206 ScholiaQ3294206MaRDI QIDQ174186

List of research outcomes





PublicationDate of PublicationType
Report on Models of Write–Efficient Memories with Localized Errors and Defects2009-01-22Paper
On the Thinnest Coverings of Spheres and Ellipsoids with Balls in Hamming and Euclidean Spaces2009-01-22Paper
On Coverings of Ellipsoids in Euclidean Spaces2008-12-21Paper
Some mathematical questions of theory of information transmission2008-09-02Paper
Report on models of write–efficient memories with localized errors and defects2007-05-29Paper
On the thinnest coverings of spheres and ellipsoids with balls in Hamming and Euclidean spaces2007-05-29Paper
On estimation of information via variation2005-09-08Paper
Epsilon-entropy of an ellipsoid in a Hamming space2004-01-08Paper
An optimization problem related to the computation of the epsilon-entropy of an ellipsoid in a Hamming space2003-06-19Paper
Correction of ordinary and localized errors2003-06-19Paper
Entropy of an ellipsoid in a Hamming space2002-07-22Paper
On error-free filtering of singular processes under nonstationary distortions2002-03-06Paper
Evaluation of the asymptotics of the summarized capacity of an \(M\)-frequency \(T\)-user noiseless multiple-access channel2001-11-22Paper
Upper and lower bounds and asymptotics of the optimal filtering error of a stationary process with a small information rate2001-07-05Paper
Information rate in memoryless channels for a slowly varying Markov signal2001-01-15Paper
Stationary channels with a random parameter which is a completely singular process2000-06-26Paper
Centered error-correcting codes2000-06-26Paper
On the Hamming bound for nonbinary localized-error-correcting codes2000-06-26Paper
https://portal.mardi4nfdi.de/entity/Q49544072000-06-07Paper
On error-free filtering of some stationary processes2000-05-25Paper
https://portal.mardi4nfdi.de/entity/Q49450622000-01-01Paper
Binary constant-weight codes correcting localized errors and defects1999-11-01Paper
https://portal.mardi4nfdi.de/entity/Q38386671999-11-01Paper
Information rates in certain stationary non-Gaussian channels in weak-signal transmission1999-08-23Paper
Information rates in stationary Gaussian channels in weak signal transmission1999-06-13Paper
Error-free filtering of an entropy-singular signal under independent distortions1999-06-10Paper
https://portal.mardi4nfdi.de/entity/Q38387141999-03-22Paper
Asymptotically optimal binary codes of polynomial complexity correcting localized errors1998-08-19Paper
Codes that detect localized errors.1998-07-16Paper
Sensitivity of the \(\varepsilon\)-entropy of stationary continuous time Gaussian processes1998-07-15Paper
On codes correcting weakly localized errors1997-10-06Paper
https://portal.mardi4nfdi.de/entity/Q47159531997-03-06Paper
Optimal filtering of a Gaussian signal against a background of almost Gaussian noise1996-12-15Paper
Sensitivity of channel capacity1996-06-04Paper
https://portal.mardi4nfdi.de/entity/Q48364151996-04-10Paper
Localized random and arbitrary errors in the light of arbitrarily varying channel theory1995-08-01Paper
https://portal.mardi4nfdi.de/entity/Q33645951995-01-01Paper
Nonbinary codes correcting localized errors1994-10-04Paper
Binary constant-weight codes correcting localized errors1994-03-08Paper
Bounds for codes with separately localized errors1993-03-18Paper
Simple methods for deriving lower bounds the theory of codes1992-09-26Paper
Asymptotic behavior of nonanticipative epsilon-entropy for Gaussian process1992-09-26Paper
https://portal.mardi4nfdi.de/entity/Q33626531992-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33621491991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33622121991-01-01Paper
Bounds on the capacity of FCFS multiple-access algorithms1990-01-01Paper
Controllable connector1990-01-01Paper
Delayed epsilon-entropy of a noisy Gaussian message with small reproduction error1989-01-01Paper
Detecting a signal with an assigned risk1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47324121989-01-01Paper
A comment on the paper of Kasami, Lin, Wei, and Yamamura, ``Coding for the binary symmetric broadcast channel with two receivers1988-01-01Paper
Epsilon-entropy with delay for a Gaussian message corrupted by noise1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38071161988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47297231988-01-01Paper
Epsilon-entropy with delay for small mean-square reproduction error1987-01-01Paper
Self-tuning algorithm for minimax nonparametric estimation of spectral density1986-01-01Paper
(\(\epsilon\) ,\(\delta\) )-entropy of completely ergodic stochastic processes1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37079141985-01-01Paper
Learning algorithm for nonparametric filtering1984-01-01Paper
Estimation of square-integrable probability density of a random variable1983-01-01Paper
Entropy characteristics and linear approximations for a homogeneous Gaussian field1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30364081983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33356741983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37079131983-01-01Paper
Estimation of square integrable density on the basis of a sequence of observations1982-01-01Paper
List cascade decoding1982-01-01Paper
Zero-error capacity for deterministic multiple-access channels with common information1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36606861982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39305081981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39428901981-01-01Paper
Optimal filtering of square-integrable signals in Gaussian noise1980-01-01Paper
Capacity of a broadcast channel with one deterministic component1980-01-01Paper
Bounds on volume of error-correcting codes in a broadcast channel (generalized Blackwell channel)1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38643991980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38723541980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39014351980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39428981980-01-01Paper
Coding of sources on the basis of observations with incomplete information1979-01-01Paper
Bounds for codes with unequal protection of two sets of messages1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38581271979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38581401979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38535491978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41746211978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41802731977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41095721976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41323871975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40778711974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40918211974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41060671974-01-01Paper
On the complexity of an optimal non-blocking commutation scheme without reorganization1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40811381973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44041241973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40962301972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56773791971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56859601971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40630341970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56756241969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40589171968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56787581967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40489541967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55972791966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53294871964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53368131964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55126621963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56174451963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56174461963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53316731961-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56006481961-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56424911960-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32744241960-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32796301960-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32796341960-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32894201960-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57375261958-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32660361958-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32456191957-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32396221956-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32297171955-01-01Paper
https://portal.mardi4nfdi.de/entity/Q58273711954-01-01Paper
https://portal.mardi4nfdi.de/entity/Q58197841953-01-01Paper

Research outcomes over time

This page was built for person: M. S. Pinsker