| RUS ENG |
| Full version |
|
|
|
| JOURNALS // Problemy Peredachi Informatsii // Archive |
|
2021, Volume 57, Issue 2
|
| Information Theory | |||
|
Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel A. S. Vora, A. A. Kulkarni |
3 | |
| Coding Theory | |||
|
|
Coding in a V. S. Lebedev, N. A. Polyanskii |
36 | |
| Large Systems | |||
|
|
Bounds on Borsuk numbers in distance graphs of a special type A. V. Berdnikov, A. M. Raigorodskii |
44 | |
|
|
Counting the number of perfect matchings, and generalized decision trees M. N. Vyalyi |
51 | |
|
|
Limit theorems for the maximal path weight in a directed graph on the line with random weights of edges T. Konstantopoulos, A. V. Logachov, A. A. Mogulskii, S. G. Foss |
71 | |
| Information Protection | |||
|
|
Separable collusion-secure multimedia codes E. E. Egorova, G. A. Kabatiansky |
90 | |