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

2011, Volume 47, Issue 1  

Coding Theory
Woven convolutional graph codes with large free distances
I. E. Bocharova, F. Hug, R. Johannesson, B. D. Kudryashov 		3–18
On metric rigidity for some classes of codes
D. I. Kovalevskaya 		19–32

Large Systems
Computing the longest common substring with one mismatch
M. A. Babenko, T. A. Starikovskaya 		33–39
Intersection theorem for finite permutations
V. M. Blinovsky 		40–53

Communication Network Theory
On conditions for a product-form stationary probability distribution of states of a multimode service network
A. N. Starovoitov 		54–65
A zero-or-one law in aggregated closed queueing networks
G. Sh. Tsitsiashvili, M. A. Osipova 		66–73

Source Coding
Enumeration of constant-weight run-length limited binary sequences
O. F. Kurmaev 		74–91

Iosif Abramovich Ovseevich: In memoriam
 92–95
Проблемы передачи информации Problems of Information Transmission
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026