default search action
Problems of Information Transmission, Volume 39
Volume 39, Number 1, January 2003
- Andrei Nikolaevich Kolmogorov. 1
- Mark I. Vishik, Vladimir V. Chepyzhov:
Kolmogorov ε-Entropy in the Problems on Global Attractors for Evolution Equations of Mathematical Physics. 2-20 - V. G. Vovk, Glenn R. Shafer:
Kolmogorov's Contributions to the Foundations of Probability. 21-31 - Vladimir V. V'yugin:
Problems of Robustness for Universal Coding Schemes. 32-46 - Efim I. Dinaburg, Yakov G. Sinai:
Existence and Uniqueness of Solutions of a Quasilinear Approximation of the 3D Navier-Stokes System. 47-50 - Ildar A. Ibragimov:
An Estimation Problem for Quasilinear Stochastic Partial Differential Equations. 51-77 - Anatoly A. Karatsuba:
Zeros and Local Extrema of Trigonometric Sums. 78-91 - Leonid A. Levin:
The Tale of One-Way Functions. 92-103 - Georgii G. Magaril-Il'yaev, Konstantin Yu. Osipenko, Vladimir M. Tikhomirov:
Indefinite Knowledge about an Object and Accuracy of Its Recovery Methods. 104-118 - Andrei A. Muchnik, Alexei L. Semenov:
On the Role of the Law of Large Numbers in the Theory of Randomness. 119-147 - Andrei E. Romashchenko:
A Criterion for Extractability of Mutual Information for a Triple of Strings. 148-157
Volume 39, Number 2, April 2003
- Ernst M. Gabidulin, Vitaly A. Obernikhin:
Codes in the Vandermonde F-Metric and Their Application. 159-169 - V. A. Leus:
On a Geometric Generalization of Entropy. 170-177 - Sergey V. Avgustinovich, Faina I. Solov'eva:
To the Metrical Rigidity of Binary Codes. 178-183 - Rumen N. Daskalov, Plamen Hristov:
New Quasi-cyclic Degenerate Linear Codes over GF(8). 184-190 - Marat V. Burnashev:
On Optimal Linear Detectors, Asymptotic Efficiency, and Some CDMA Problems. 191-206 - B. Ya. Ryabko, V. S. Stognienko, Yu. I. Shokin:
Adaptive χ2 Test for Discriminating between Close Hypotheses with a Large Number of Classes and Its Application to Some Cryptography Problems. 207-215 - Vasily N. Malozemov, K. Yu. Tsvetkov:
On Optimal Signal-Filter Pairs. 216-226 - V. V. Tarasov:
Boolean Functions with Improper Parameters. 227-230
Volume 39, Number 3, July 2003
- Peter Trifonov, Sergei V. Fedorenko:
A Method for Fast Computation of the Fourier Transform over a Finite Field. 231-238 - Vladimir B. Balakirsky, A. J. Han Vinck:
On the Performance of Permutation Codes for Multi-User Communication. 239-254 - Rossitza Dodunekova:
Extended Binomial Moments of a Linear Code and the Undetected Error Probability. 255-265 - P. V. Golubtsov, Vassily A. Lyubetsky:
Stochastic Dynamic Games with Various Types of Information. 266-293 - Victor P. Maslov:
Note on a Computer-Oriented Language. 294-298 - P. I. Kotsyuruba, Anatoly A. Nazarov:
Analysis of Asymptotic Average Characteristics for Non-Markovian Models of Unstable Random Access Networks. 299-308 - Alexey V. Lebedev:
The Gated Infinite-Server Queue with Unbounded Service Times and Heavy Traffic. 309-316
Volume 39, Number 4, October 2003
- Vladimir S. Lebedev:
Asymptotic Upper Bound for the Rate of (w, r) Cover-Free Codes. 317-323 - Vyacheslav V. Prelov, Edward C. van der Meulen:
Higher-Order Asymptotics of Mutual Information for Nonlinear Channels with Non-Gaussian Noise. 324-340 - Sergey V. Avgustinovich, Faina I. Solov'eva, Olof Heden:
On the Ranks and Kernels Problem for Perfect Codes. 341-345 - Galina T. Bogdanova, Stoyan N. Kapralov:
Enumeration of Optimal Ternary Constant-Composition Codes. 346-351 - Shun-ichi Amari, Marat V. Burnashev:
On Some Singularities in Parameter Estimation Problems. 352-372 - Rudolf Ahlswede, Vladimir M. Blinovsky:
Large Deviations in Quantum Information Theory. 373-379 - Vladimir V. V'yugin, Victor P. Maslov:
Extremal Relations between Additive Loss Functions and the Kolmogorov Complexity. 380-394 - Michael V. Vyugin:
Systems of Strings with High Mutual Complexity. 395-399
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.