Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
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

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–26
Zero-Error Capacity of Memoryless Channels with Weak Input Signals
V. V. Prelov 		27–33
New Asymptotic Lower Bounds on the Free Distance of Time-Invariant Convolutional Codes
K. Sh. Zigangirov 		34–42
On Weight Spectra of Some Codes
I. E. Shparlinski 		43–48

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

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

Ñorrespondence
Fast Correlation Decoding of $p$-ary Codes of Maximal Length
L. V. Kanatova, V. L. Litvinov, L. M. Fink 		98–103
Throughput Analysis for a Noise-Resistant Multiple Access Algorithm
G. S. Evseev, A. M. Tyurlikov 		104–109
Ïðîáëåìû ïåðåäà÷è èíôîðìàöèè Problems of Information Transmission
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025