Probl. Peredachi Inf., 2010, Volume 46, Issue 4

Problemy Peredachi Informatsii

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

2010, Volume 46, Issue 4

Information Theory
	BSC reliability function under list decoding V. M. Blinovsky	3–13
	Transition points in the capacity-achieving distribution for the peak-power limited AWGN and free-space optical intensity channels N. Sharma, S. Shamai (Shitz)	14–32

Coding Theory
	Decoding of random network codes E. M. Gabidulin, N. I. Pilipchuk, M. Bossert	33–55
	Special sequences as subcodes of Reed–Solomon codes A. A. Davydov, V. V. Zyablov, R. E. Kalimullin	56–82

Large Systems
	Complete and incomplete Boolean degrees S. S. Marchenkov	83–90
	Discrete Chrestenson transform M. S. Bespalov	91–115
	On enumeration of $q$-ary sequences with a fixed number of occurrences of the subblock 00 V. S. Lebedev	116–121

Communication Network Theory
	On the rate of beta-mixing and convergence to a stationary distribution in continuous-time Erlang-type systems A. Yu. Veretennikov	122–129

Source Coding
	Fast enumeration algorithm for words with given constraints on run lengths of ones Yu. S. Medvedeva, B. Ya. Ryabko	130–139

	International Symposium on Information Theory (ISIT'2011). Call for papers	140–141