Probl. Peredachi Inf., 1996, Volume 32, Issue 2

Problemy Peredachi Informatsii

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

1996, Volume 32, Issue 2

Information Theory
	Estimate for the Probability of Undetected Error V. M. Blinovskii	3–9

Coding Theory
	On the Trellis Complexity of Block and Convolutional Codes U. Dettmar, R. Raschofer, U. K. Sorger	10–21
	Data Compression Using an “Imaginary Sliding Window” B. Ya. Ryabko	22–30
	Difference Sets and Codes Correcting Single Localized Errors of Known Value G. A. Kabatiansky, V. S. Lebedev	31–35
	Codes Detecting Localized Errors L. A. Bassalygo, M. S. Pinsker	36–38
	Optimal Sets of Binary Sequences B. Zh. Kamaletdinov	39–44

Methods of Signal Processing
	On the Averaging Principle for Nonlinear Filtering Problems with Random Contamination M. L. Kleptsyna, A. P. Serebrovskii	45–53
	Asymptotically Minimax Criteria for Testing Complex Nonparametric Hypotheses M. S. Ermakov	54–67
	Local Asymptotical Normality for Stationary Gaussian Sequences with Degenerate Spectral Density N. K. Bakirov	68–76

Automata Theory
	Improving Parameter Estimates and Shortening the Procedure of Design of Efficient Diagnostic Polynomials Yu. L. Sagalovich	77–88

Theory of Languages
	On Rank Distributions of Letter Frequencies in Human Languages M. S. Gel'fand, Zhao Min	89–95