|
|
2013, Volume 49, Issue 2
|
 |
|
 |
|
Information Theory
|
|
Some properties of Rényi entropy over countably infinite alphabets
M. Kovačević, I. Stanojević, V. Šenk
|
3–16 |
|
|
Random multiple access in a vector disjunctive channel
E. V. Pustovalov, A. M. Turlikov
|
17–33 |
|
|
Methods of Signal Processing
|
|
|
On interpolation of smooth processes and functions
G. K. Golubev, E. A. Krymova
|
34–57 |
|
|
Automata Theory
|
|
|
Determinization of ordinal automata
An. A. Muchnik
|
58–72 |
|
|
Large Systems
|
|
|
Finiteness in the Beggar-My-Neighbor card game
E. L. Lakshtanov, A. I. Aleksenko
|
73–77 |
|
|
Communication Network Theory
|
|
|
Analysis of an open non-Markovian $GI-(GI\mid\infty)^K$ queueing network with high-rate renewal arrival process
A. A. Nazarov, A. N. Moiseev
|
78–91 |
|
|
Information Protection
|
|
|
Information security in a random network coding network
E. M. Gabidulin, N. I. Pilipchuk, B. Honary, H. Rashwan
|
92–106 |
|
|
|
Remark on "Steiner triple systems $S(2^m-1,3,2)$ of rank $2^m-m+1$ over $\mathbb F_2$" published in Probl. Peredachi Inf., 2012, no. 2
V. A. Zinoviev, D. V. Zinoviev
|
107–111 |
|
|
Contact us: