Probl. Peredachi Inf., 1986, Volume 22, Issue 2

JOURNALS // Problemy Peredachi Informatsii // Archive

1986, Volume 22, Issue 2

Information Theory and Coding Theory
	New Sufficient Existence Conditions for Codes Meeting the Varshamov–Greismer Bound V. N. Logachev	3
	Zero-Error Capacity of Memoryless Channels with Weak Input Signals V. V. Prelov	27
	New Asymptotic Lower Bounds on the Free Distance of Time-Invariant Convolutional Codes K. Sh. Zigangirov	34
	On Weight Spectra of Some Codes I. E. Shparlinski	43

Communication Network Theory
	Local-Area Network with Random-Multiple-Access Stack Algorithm B. S. Tsybakov, S. P. Fedortsev	49
	Queuing Networks with Regenerating Trajectories A. L. Tolmachev	59

Methods for Signal Processing and Automata Theory
	Robust Reconstruction of Functions by the Local-Approximation Method A. B. Tsybakov	69
	Synthesis of Self-Checking Checkers for Summation Codes A. G. Mel'nikov, V. V. Sapozhnikov, Vl. V. Sapozhnokov	85

Сorrespondence
	Fast Correlation Decoding of $p$-ary Codes of Maximal Length L. V. Kanatova, V. L. Litvinov, L. M. Fink	98
	Throughput Analysis for a Noise-Resistant Multiple Access Algorithm G. S. Evseev, A. M. Tyurlikov	104