default search action
Problems of Information Transmission, Volume 41
Volume 41, Number 1, January 2005
- Tharmalingam Ratnarajah, Rémi Vaillancourt, M. Alvo:
Complex random matrices and Rician channel capacity. 1-22 - Vladimir M. Blinovsky:
Code bounds for multiple packings over a nonbinary finite alphabet. 23-32 - Arvind Sridharan, Michael Lentmaier, Dmitri V. Truhachev, Daniel J. Costello Jr., Kamil Sh. Zigangirov:
On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices. 33-44 - Vladimir Yu. Tertychnyi-Dauri:
Solution of variational dynamic problems under parametric uncertainty. 45-58 - V. V. Tarasov:
To the problem of expressibility in the algebra of partial Boolean functions. 59-64 - B. Ya. Ryabko, V. A. Monarev:
Experimental investigation of forecasting methods based on data compression algorithms. 65-69
Volume 41, Number 2, April 2005
- Mark S. Pinsker:
On Estimation of Information via Variation. 71-75 - Nilanjana Datta, Alexander S. Holevo, Yuri M. Suhov:
On a Sufficient Condition for Additivity in Quantum Information Theory. 76-90 - Dmitry Yu. Nogin:
Weight Functions and Generalized Hamming Weights of Linear Codes. 91-104 - Sergey V. Avgustinovich, Faina I. Solov'eva, Olof Heden:
On the Structure of Symmetry Groups of Vasil'ev Codes. 105-112 - Natalia N. Tokareva:
Representation of ℤ4-Linear Preparata Codes Using Vector Fields. 113-124 - Leonid A. Bassalygo:
Nonbinary Error-Correcting Codes with One-Time Error-Free Feedback. 125-129 - I. I. Mullayeva:
Interrelation of the Cyclic and Weight Structure of Codes over GF(q) and Proportionality Classes. 130-133 - Vladimir V. V'yugin, Victor P. Maslov:
Concentration Theorems for Entropy and Free Energy. 134-149 - Boris M. Miller, Konstantin Avrachenkov, Karen V. Stepanyan, Gregory B. Miller:
Flow Control as a Stochastic Optimal Control Problem with Incomplete Information. 150-170 - G. Sh. Tsitsiashvili, M. A. Osipova:
New Product Theorems for Queueing Networks. 171-181 - Gregory A. Kabatiansky:
Codes for Copyright Protection: The Case of Two Pirates. 182-186
Volume 41, Number 3, July 2005
- Rossitza Dodunekova, Evgeniya P. Nikolova:
Sufficient Conditions for Monotonicity of the Undetected Error Probability for Large Channel Error Probabilities. 187-198 - Vladimir S. Lebedev:
A Note on the Uniqueness of (w, r) Cover-Free Codes. 199-203 - Faina I. Solov'eva:
On the Construction of Transitive Codes. 204-211 - L. Goldentayer, Fima C. Klebaner, Robert Sh. Liptser:
Tracking Volatility. 212-229 - Alexandre N. Rybko, Senya B. Shlosman:
Poisson Hypothesis: Combinatorial Aspect. 230-236 - Mikhail Ustinov:
Nonreducible Descriptions for the Conditional Kolmogorov Complexity. 237-242 - Oleg M. Tikhonenko:
Generalized Erlang Problem for Service Systems with Finite Total Capacity. 243-253 - Artyom P. Kovalevskii, Valentin Topchii, S. G. Foss:
On the Stability of a Queueing System with Uncountably Branching Fluid Limits. 254-279 - Boris S. Tsybakov:
Busy Periods in a System with Heterogeneous Servers or Channels. 280-295 - Alexey V. Lebedev:
Maxima of Waiting Times for the Random Order Service M|M|1 Queue. 296-299
Volume 41, Number 4, October 2005
- Marat V. Burnashev:
Sharpening of an Upper Bound for the Reliability Function of a Binary Symmetric Channel. 301-318 - Vladimir M. Blinovsky:
Random Sphere Packing. 319-330 - Victor A. Zinoviev, Tor Helleseth, Pascale Charpin:
On Cosets of Weight 4 of Binary BCH Codes with Minimum Distance 8 and Exponential Sums. 331-348 - Arkadii G. D'yachkov, Pavel A. Vilenkin, I. K. Ismagilov, R. S. Sarbaev, Anthony J. Macula, David C. Torney, Scott White:
On DNA Codes. 349-367 - Anatoli B. Juditsky, Alexander V. Nazin, Alexandre B. Tsybakov, Nicolas Vayatis:
Recursive Aggregation of Estimators by the Mirror Descent Algorithm with Averaging. 368-384 - B. Ya. Ryabko, V. A. Monarev, Yu. I. Shokin:
A New Type of Attacks on Block Ciphers. 385-394
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.