Bounds on Mutual Information Functions via Variational Distance
// Proc. 30-th Symp. Inform. Theory in the Benelux. Eindhoven,
May 28--29, 2009, P. 153--159.
Information and Variation: Recent and New
Results // Proc. XII Intern. Symp. on Problem Redundancy in
Information and Control Systems. St.-Petersburg, May 26--30, 2009.
Asymptotic Investigation of Mutual Information and Capacity
of Certain Communication Channels // Aspects of Network and
Information Security, IOS Press. 2008. P. 283--291.
On the Thinnest Coverings of Spheres and Ellipsoids with
Balls in Hamming and Euclidean Spaces // Lecture Notes
in Computer Sciences. 2006. V. 4123. P. 883--910.
On the Entropy and Optimal Covering of Ellipsoids // Proc.
Ninth Intern. Workshop Algebraic and Combinatorial Coding
Theory. Kranevo, Bulgaria, June 19--25, 2004, P. 338--344.
Asymptotic Expansions of Mutual Information for a General
Class of Additive Noise Channels with Small Signal-to-Noise
Ratio // Proc. 24-th Symp. Inform. Theory in the Benelux.
Veldhoven, May 22--23, 2003. P. 165—170.
Higher Order Asymptotics of Mutual Information for
Nonlinear Channels with Non-Gaussian // Proc. IEEE Intern.
Symp. Inform. Theory. Yokohama, Japan, June 29—July 4, 2003,
P. 83 .
Epsilon-Entropy of a Special Class of Ellipsoids in a
Hamming Space // Proc. 23-th Symp. Inform. Theory in the
Benelux. Louvain-la-Neuve, May 29--31, 2002. P. 37--44.
On the Epsilon-Entropy of an Ellipsoid in a Hamming
Space // Proc. IEEE Intern. Symp . Inform. Theory. Lausanne,
Switzerland, June 30 -- July 5, 2002. P. 463.
.Asymptotics of the Epsilon-Entropy for a Certain Class
of Ellipsoids in a Hamming Space // Proc. IEEE Intern. Symp .
Inform. Theory. Lausanne, Switzerland, June 30 -- July 5,
2002. P. 464.
Оптимизационная задача, связанная с вычислением
эпсилон-энтропии эллипсоида в хэмминговом пространстве
// Пробл. передачи информ. 2002. Т. 38. № 2. С. 3--18.
Asymptotic Investigation of the Optimal Filtering Error
and Information Rates in Certain Models of Observations and
Channels // Proc. 22-th Symp. Inform. Theory in the Benelux.
Enschede, May 15--16, 2001. P. 93—100.
On Possibility of Error-Free Filtering under Nonstationary
Distortions // Proc. IEEE Intern. Symp . Inform. Theory.
Washington, USA, June 24--29, 2001.
2001 г.
Авторы: Prelov V., Pinsker M.S., van der Meulen E.
Asymptotic Investigation of the Information Rates in
Certain Stationary Channels with and without Memory
// American J. Math. and Management Sci. 2001. V 21. N 1-2 .
P. 29--42.
Information Transmission of Slowly Varying Input Signals
over Discrete Memoryless Stationary Channels // Proc. 21-th
Symp. Inform. Theory in the Benelux. Wassenaar, May 25--26,
2000. P. 277--283.
On the Entropy of Ellipsoids in the Hamming Space // Proc.
Seventh Intern. Workshop Algebraic and Combinatorial Coding
Theory, Bansko, Bulgaria, June 18--24, 2000, P. 269--272.
Transmission of a Slowly Varying Markov Signal over
Memoryless Channels // Proc. IEEE Intern. Symp. Inform.
Theory. Sorrento, Italy, June 25--30, 2000. P. 488.
О безошибочной фильтрации сингулярных процессов при
нестационарных искажениях // Пробл. передачи информ. 2000.
Т. 36. № 4. С. 89--97.
2000 г.
Авторы: Прелов В.В., Пинскер М.С., ван дер Мейлен Э.
Скорость создания информации в каналах без памяти при
передаче медленно меняющегося марковского сигнала // Пробл.
передачи информ. 2000. Т. 36. № 3. С. 29--38.
1999 г.
Авторы: Прелов В.В., Пинскер, Э.К. ван дер Мейлен М.С.
Стационарные каналы со случайным параметром -- вполне
сингулярным процессом // Пробл. передачи информ. 1999. Т. 35.
№ 1. С. 3--12.
Information Rates and its Asymptotics for a General
Class of Channels with a Random Parameter // Proc. Intern.
Conf. Computer Science and Inform. Technologies. Yerevan,
August 17--22, 1999. P. 146--148.
1998 г.
Авторы: Прелов В.В., Пинскер, Э.К. ван дер Мейлен М.С.
Скорость создания информации в некоторых стационарных
негауссовских каналах при передаче слабыми сигналами // Пробл.
передачи информ. 1998. Т. 34. № 1. С. 3--17.
Верхние и нижние границы и асимптотика ошибки оптимальной
фильтрации стационарного процесса при малой скорости создания
информации // Пробл. передачи информ. 1998. Т. 34. № 4.
С. 23—38
On the Error of the Optimal Filtering of Stationary Processes
with a Small Information Rate // Proc.IEEE Intern. Symp. Inform.
Theory. MIT, Cambridge, August 16--21, 1998. P.332.
Information Transmission over Channels with
Additive-Multiplicative Noise // Proc. IEEE Intern. Symp.
Inform. Theory. MIT, Cambridge, August 16--21, 1998. P. 239.
Information Transmission over Stationary Channels with
Additive Non-Gaussian Noise by means of Weak Input Signals
// Proc. 19-th Symp. Inform. Theory in the Benelux. Veldhoven,
May 28--29, 1998. P. 143--147.
Error-Free Filtering of Entropy-Regular Process against a
Background of Entropy-Singular Noise // Proc. IEEE
Intern. Symp. Inform. Theory. Ulm, June 22--July 4, 1997. P. 72.
Sensitivity of the Rate-Distortion Function of Stationary
Continuous-Time Gaussian Processes to Non-Gaussian Contamination
// Proc. IEEE Intern. Symp. Inform. Theory. Ulm, June 29--July 4,
1997. P. 73.
Asymptotic Behavior of the Information Rates in Certain
Stationary Gaussian and Non-Gaussian Channels // Proc. Intern.
Conf. Computer Science and Inform. Technologies. Yerevan,
September 25--29, 1997. P. 233—235.
Information Rates in Certain Stationary Non-Gaussian
Channels // Proc. Fifth Intern. Workshop
Algebraic and Combinatorial Coding Theory. Sozopol, June 1--7,
1996. P. 297—238 .
