Probl. Peredachi Inf., 2011, Volume 47, Issue 3

JOURNALS // Problemy Peredachi Informatsii // Archive

2011, Volume 47, Issue 3

Coding Theory
	New $(n,r)$-arcs in $\mathrm{PG}(2,17)$, $\mathrm{PG}(2,19)$, and $\mathrm{PG}(2,23)$ R. Daskalov, E. Metodieva	3
	Classification of optimal $(v,4,1)$ binary cyclically permutable constant-weight codes and cyclic $2$-$(v,4,1)$ designs with $v\le76$ T. Baicheva, S. Topalova	10

Large Systems
	Method of Lyapunov functions for analysis of absorption and explosion in Markov chains P.-L. Chow, R. Z. Khasminskii	19
	On a sequence of random distance graphs subject to the zero-one law M. E. Zhukovskii	39
	Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph M. A. Babenko, T. A. Urbanovich	59
	The tree nearest on average to a given set of trees K. Yu. Gorbunov, V. A. Lyubetsky	64

Communication Network Theory
	Configuration of overloaded servers with dynamic routing N. D. Vvedenskaya	80