Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDProblems of Information Transmission, Volume 47
Volume 47, Number 1, March 2011
- Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov:
Woven convolutional graph codes with large free distances. 1-14 - Darya I. Kovalevskaya:
On metric rigidity for some classes of codes. 15-27 - Maxim A. Babenko, Tatiana Starikovskaya:
Computing the longest common substring with one mismatch. 28-33 - Vladimir M. Blinovsky:
Intersection theorem for finite permutations. 34 - A. N. Starovoitov:
On conditions for a product-form stationary probability distribution of states of a multimode service network. 46-56 - G. Sh. Tsitsiashvili
, M. A. Osipova:
A zero-or-one law in aggregated closed queueing networks. 57-63 - Oleg F. Kurmaev:
Enumeration of constant-weight run-length limited binary sequences. 64-80 - Iosif Abramovich Ovseevich: In memoriam. 81-84
Volume 47, Number 2, June 2011
- Vladimir M. Blinovsky:
Remark on the reliability function of a symmetric channel under list decoding. 85-88 - Boris S. Tsybakov:
On a model and capacity of MIMO channels. 89-97 - Vyacheslav V. Prelov:
Generalization of a Pinsker problem. 98-116 - Antonia Wachter, Vladimir R. Sidorenko, Martin Bossert, Victor V. Zyablov:
On (Partial) unit memory codes based on Gabidulin codes. 117-129 - Victor A. Zinoviev, Dmitrii V. Zinoviev:
Steiner systems S(v, k, k - 1): Components and rank. 130-148 - Vladimir R. Sidorenko, Georg Schmidt:
A linear algebraic approach to multisequence shift-register synthesis. 149-165 - Vladimir V. V'yugin:
On universal algorithms for adaptive forecasting. 166-189 - Vadim A. Malyshev:
Critical states of strongly interacting many-particle systems on a circle. 190-200 - A. L. Chmora:
Key masking using biometry. 201-215
Volume 47, Number 3, September 2011
- Rumen N. Daskalov, Elena Metodieva:
New (n, r)-arcs in PG(2, 17), PG(2, 19), and PG(2, 23). 217 - Tsonka Baicheva, Svetlana Topalova:
Classification of optimal (v, 4, 1) binary cyclically permutable constant-weight codes and cyclic 2-(v, 4, 1) designs with v ≤ 76. 224 - Pao-Liu Chow, Rafail Z. Khasminskii:
Method of Lyapunov functions for analysis of absorption and explosion in Markov chains. 232 - Maksim E. Zhukovskii:
On a sequence of random distance graphs subject to the zero-one law. 251 - Maxim A. Babenko, Timofey A. Urbanovich:
Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph. 269 - Konstantin Yu. Gorbunov, Vassily A. Lyubetsky:
The tree nearest on average to a given set of trees. 274 - Nikita D. Vvedenskaya:
Configuration of overloaded servers with dynamic routing. 289
Volume 47, Number 4, December 2011
- Alexey Kreshchuk, Alexander A. Davydov, Victor V. Zyablov:
Codes for MIMO transmission based on orthogonal sequences. 305-326 - Alexey A. Frolov, Victor V. Zyablov:
Bounds on the minimum code distance for nonbinary codes based on bipartite graphs. 327-341 - Mikhail N. Vyalyi:
On regular realizability problems. 342-352 - Alexander V. Zhozhikashvili, Vadim L. Stefanuk:
Properties of a folded category constructed from a category and a lattice. 353-363 - Sergey A. Dudin, Olga S. Dudina:
Call center operation model as a MAP/PH/N/R-N system with impatient customers. 364-377 - Anna Wierzbicka:
Common language of all people: The innate language of thought. 378-397 - G. A. Margulis:
Random minkowski theorem. 398-402
a service of 
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.
last updated on 2024-04-18 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
