


default search action
Problems of Information Transmission, Volume 46
Volume 46, Number 1, March 2010
- Vladimir S. Lebedev:
Separating codes and a new combinatorial search model. 1-6 - A. N. Voronina:
On volumes of spheres for the stem distance. 7-16 - Victor A. Zinoviev, Dmitrii V. Zinoviev:
Binary perfect and extended perfect codes of lengths 15 and 16 and of ranks 13 and 14. 17-21 - Anna V. Kitaeva, Gennady M. Koshkin:
Nonparametric semirecursive identification in a wide sense of strong mixing processes. 22-37 - Andrei A. Muchnik, Andrei E. Romashchenko
:
Stability of properties of Kolmogorov complexity under relativization. 38-61 - V. R. Fatalov:
Small deviations for two classes of Gaussian stationary processes and Lp-functionals, 0 < p ≤ ∞. 62-85 - Anatoly A. Nazarov
, Elena A. Sudyko:
Method of asymptotic semiinvariants for studying a mathematical model of a random access network. 86-102
Volume 46, Number 2, June 2010
- Marat V. Burnashev, Hirosuke Yamamoto
:
On the reliability function for a BSC with noisy feedback. 103-121 - Vyacheslav V. Prelov:
On computation of information via variation and inequalities for the entropy function. 122-126 - Christian Senger, Vladimir R. Sidorenko
, Martin Bossert, Victor V. Zyablov
:
Multitrial decoding of concatenated codes using fixed thresholds. 127-141 - Alexey A. Frolov
, Victor V. Zyablov
:
Asymptotic estimation of the fraction of errors correctable by q-ary LDPC codes. 142-159 - V. R. Fatalov:
Large deviations for distributions of sums of random variables: Markov chain method. 160-183 - Andrey M. Turlikov
, S. G. Foss
:
On ergodic algorithms in random multiple access systems with "success-failure" feedback. 184-200
Volume 46, Number 3, September 2010
- Alexander S. Holevo, Maksim E. Shirokov
:
Mutual and coherent information for infinite-dimensional quantum channels. 201-218 - Denis S. Krotov
, Vladimir N. Potapov
:
On switching equivalence of n-ary quasigroups of order 4 and perfect binary codes. 219-224 - Sergei V. Bezzateev
, Natalia A. Shekhunova:
Special classes of separable Goppa codes with improved parameter estimates. 225-244 - D. N. Bylkov:
A class of injective compressing maps on linear recurring sequences over a Galois ring. 245-252 - M. S. Bespalov:
Eigenspaces of the discrete Walsh transform. 253-271
Volume 46, Number 4, December 2010
- Vladimir M. Blinovsky:
BSC reliability function under list decoding. 273-282 - Naresh Sharma, Shlomo Shamai (Shitz)
:
Transition points in the capacity-achieving distribution for the peak-power limited AWGN and free-space optical intensity channels. 283-299 - Ernst M. Gabidulin, Nina I. Pilipchuk, Martin Bossert:
Decoding of random network codes. 300-320 - Alexander A. Davydov
, Victor V. Zyablov
, Rustam E. Kalimullin:
Special sequences as subcodes of reed-solomon codes. 321-345 - S. S. Marchenkov:
Complete and incomplete Boolean degrees. 346-352 - M. S. Bespalov:
Discrete Chrestenson transform. 353-375 - Vladimir S. Lebedev:
On enumeration of q-ary sequences with a fixed number of occurrences of the subblock 00. 376-381 - Alexander Yur'evich Veretennikov:
On the rate of beta-mixing and convergence to a stationary distribution in continuous-time Erlang-type systems. 382-389 - Yulia S. Medvedeva, B. Ya. Ryabko:
Fast enumeration algorithm for words with given constraints on run lengths of ones. 390-399

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.