A translation of Problemy Peredachi Informatsii

previous Volume 32, Number 2, April–June, 1996 next
Back to contents page


Estimate for the Probability of Undetected Error   [View Abstract]
V. M. Blinovskii
pp. 139–144

On the Trellis Complexity of Block and Convolutional Codes   [View Abstract]
U. Dettmar, R. Raschhofer, and U. K. Sorger
pp. 145–155

Data Compression Using an “Imaginary Sliding Window”   [View Abstract]
B. Ya. Ryabko
pp. 156–163

Difference Sets and Codes Correcting Single Localized Errors of Known Value   [View Abstract]
G. A. Kabatianskii and V. S. Lebedev
pp. 164–167

Codes Detecting Localized Errors   [View Abstract]
L. A. Bassalygo and M. S. Pinsker
pp. 168–170

Optimal Sets of Binary Sequences   [View Abstract]
B. Zh. Kamaletdinov
pp. 171–175

On the Averaging Principle for Nonlinear Filtering Problems with Random Contamination   [View Abstract]
M. L. Kleptsina and A. P. Serebrovski
pp. 176–183

Asymptotically Minimax Criteria for Testing Complex Nonparametric Hypotheses   [View Abstract]
M. S. Ermakov
pp. 184–196

Local Asymptotical Normality for Stationary Gaussian Sequences with Degenerate Spectral Density   [View Abstract]
N. K. Bakirov
pp. 197–204

Improving Parameter Estimates and Shortening the Procedure of Design of Efficient Diagnostic Polynomials   [View Abstract]
Yu. L. Sagalovich
pp. 205–215

On Rank Distributions of Letter Frequencies in Human Languages   [View Abstract]
M. S. Gelfand and Zhao Ming
pp. 216–221