Probl. Peredachi Inf., 1982, Volume 18, Issue 1

JOURNALS // Problemy Peredachi Informatsii // Archive

1982, Volume 18, Issue 1

Information Theory
	Zero-Error Capacity for Deterministic Multiple-Access Channels with Common Information L. A. Bassalygo, M. S. Pinsker, V. V. Prelov	3

Coding Theory
	Random Coding Bounds for Discrete Memoryless Channels G. Sh. Poltyrev	12
	On Error Correction by Generalized Convolutional Concatenated Codes O. D. Skopintsev	27
	On One Modification of the Majority Decoding Algorithm G. L. Katsman, S. L. Portnoi	38
	Pseudostochastic $N$-Partition Coding in Systems with Decision Feedback G. N. Ustinov	43

Methods of Signal Processing
	On Stable Rules for Discrimination of Hypotheses V. P. Kuznetsov	51
	On Comparative Characteristics of the Statistics of Spectral Densities of Stationary Random Processes I. G. Zhurbenko, I. A. Kozhevnikova	64
	On Estimates of Parameters of Counting Processes Yu. N. Lin'kov	78

Automata Theory and Communication-Network Theory
	Existence Conditions for a Steady-State Mode for Two Types of Communications Networks with Message Switching A. N. Rybko	94

Сorrespondence
	Attractive States of Deterministic Automata Systems V. N. Basmanov	104

Book Review
	Book Review. Csiszár I. and Körner J. “Information Theory. Coding Theorems for Discrete Memoryless Systems” G. Sh. Poltyrev	108