Probl. Peredachi Inf., 1990, Volume 26, Issue 3

Problemy Peredachi Informatsii

RUS ENG

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

1990, Volume 26, Issue 3

Information Theory and Coding Theory
	Asymptotic Lower Bound on the Free Distance of Constant Linear Convolutional Codes with Rate $1/n_0$ V. B. Balakirskii	3–11
	Majority-Logic Decoding of Generalized Reed–Muller Codes I. I. Grushko	12–20
	Covering the Hamming Space with Sets Translated by Vectors of a Linear Code V. M. Blinovskii	21–26

Methods of Signal Processing
	Detection of a Noisy Source Moving Relative to the Receiver, with Estimation of Its Motion Parameters G. P. Tartakovskii	27–37
	Nonparametric Estimation of the Regression Function in $L^2$ G. K. Golubev, M. Nussbaum	38–49
	Second-Order Asymptotic Minimax Estimation in the Presence of a Nuisance Parameter Z. M. Landsmsn, B. Ya. Levit	50–66

Communication Network Theory
	Random Multiple Access in a Channel with Binary “Success – No Success” Feedback B. S. Tsybakov, A. N. Beloyarov	67–82
	Asymptotic Analysis of Telegraphic Message Switching Systems F. I. Karpelevich, A. Ya. Kreinin	83–95

Сorrespondence
	Probability Distribution of the Stochastic Convolution Functional of a Normal Markov Process Yu. P. Virchenko, A. S. Mazmanishvili	96–101
	Signals with Two-Level Autocorrelation A. L. Vishnevetskii	101–106
	Spectral Density Estimators of a Periodically Correlated Stochastic Process V. G. Alekseev	106–108

Chronicle
	XVII All-Union Workshop on Information Theory and Applications	109