Probl. Peredachi Inf., 1981, Volume 17, Issue 4

Problemy Peredachi Informatsii

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

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

	General information
	Latest issue
	Archive
	Impact factor
	Guidelines for authors

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
	Find

Personal entry:
Login:
Password:
	Save password
	Enter
	Forgotten password?
	Register

1981, Volume 17, Issue 4

Information Theory
	Use of Defect-Correcting Codes to Restrict Access to a Broadcast Channel A. V. Kuznetsov	3–10
	Nonasymptotic Estimates for Efficiency of Code Jamming in a Wire-Tap Channel V. I. Korzhik, V. A. Yakovlev	11–18
	Bound on Admissible Transmission Rates in a Broadcast Channel with Errors in Both Components L. A. Bassalygo	19–28
	List Concatenated Decoding V. V. Zyablov, M. S. Pinsker	29–33
	Analytic Bounds for Quasioptimal Block Code Reception Methods in the Large É. É. Nemirovskii, G. V. Romanenko, L. G. Mikhailovskaya	34–40
	Bounds for Error Probability for a Symmetrical Model in Designing Screening Experiments A. G. D'yachkov	41–52

Coding Theory
	Generalized Concatenated Codes for Channels with Error Bursts and Independent Errors V. A. Zinov'ev	53–62
	To the Optimization of Shortened Hamming Codes N. R. Toropov, L. N. Kaplan, Yu. B. Smerkis, G. L. Tauglikh	63–72

Methods of Signal Processing
	On Predictions under Conditions of Uncertainty A. S. Nemirovskii	73–83

Automata Theory and Large System Science
	Method of Synthesizing Asymptotically Optimal Self-Correction Networks That Correct a Quasilinear Proportion of Errors S. I. Ortyukov	84–97
	Team of Automata with Universal Passability G. L. Kurdyumov	98–112

Сorrespondence
	Additive Codes for Correction of Multiple Defects Yu. D. Karyakin, V. V. Losev	113–115
	Equidistant Codes and Equidistant Permutation Arrays L. G. Khachatryan	116–119
	On Some Properties of $Q$-Complexity of Finite Objects E. Z. Dyment	119–123

Registration to the website

Logotypes