Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 35 matches
- 2002
- Aleksandr V. Babash:
Solving Automaton Equations with Distortions in the Automaton Transition Function. Probl. Inf. Transm. 38(3): 218-226 (2002) - Vladimir M. Blinovsky:
New Approach to Estimation of the Decoding Error Probability. Probl. Inf. Transm. 38(1): 16-19 (2002) - Vladimir M. Blinovsky:
Random Young Diagram, Variational Method, and Related Problems. Probl. Inf. Transm. 38(2): 126-135 (2002) - Vladimir M. Blinovsky, Lawrence H. Harper:
Size of the Largest Antichain in a Partition Poset. Probl. Inf. Transm. 38(4): 347-353 (2002) - Marat V. Burnashev, Shun-ichi Amari:
On Density Estimation under Relative Entropy Loss Criterion. Probl. Inf. Transm. 38(4): 323-346 (2002) - Rumen N. Daskalov, Plamen Hristov:
New One-Generator Quasi-cyclic Codes over GF(7). Probl. Inf. Transm. 38(1): 50-54 (2002) - Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
Epsilon-entropy of an Ellipsoid in a Hamming Space. Probl. Inf. Transm. 38(1): 1-15 (2002) - Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
An Optimization Problem Related to the Computation of the Epsilon-entropy of an Ellipsoid in a Hamming Space. Probl. Inf. Transm. 38(2): 99-112 (2002) - Guy Fayolle, Arnaud de La Fortelle:
Entropy and Large Deviations for Discrete-Time Markov Chains. Probl. Inf. Transm. 38(4): 354-367 (2002) - Ernst M. Gabidulin, Vitaly V. Shorin:
New Sequences with Zero Autocorrelation. Probl. Inf. Transm. 38(4): 255-267 (2002) - G. K. Golubev:
Reconstruction of Sparse Vectors in White Gaussian Noise. Probl. Inf. Transm. 38(1): 65-79 (2002) - Helmut Griesser, Vladimir R. Sidorenko:
A Posteriory Probability Decoding of Nonsystematically Encoded Block Codes. Probl. Inf. Transm. 38(3): 182-193 (2002) - Boris A. Grishanin:
Compatible Information as a Natural Information Measure of a Quantum Channel. Probl. Inf. Transm. 38(1): 26-35 (2002) - Marc Handlery, Stefan Höst, Rolf Johannesson, Victor V. Zyablov:
A Distance Measure Tailored to Tailbiting Codes. Probl. Inf. Transm. 38(4): 280-295 (2002) - Marc Handlery, Rolf Johannesson, Victor V. Zyablov:
Encoder and Distance Properties of Woven Convolutional Codes with One Tailbiting Component Code. Probl. Inf. Transm. 38(1): 41-49 (2002) - Marc Handlery, Rolf Johannesson, Victor V. Zyablov:
Distance Approach to Window Decoding. Probl. Inf. Transm. 38(3): 169-181 (2002) - V. A. Ivnitskii:
On the Invariance of Stationary State Probabilities of a Non-Product-Form Single-Line Queueing System. Probl. Inf. Transm. 38(4): 368-376 (2002) - Victor V. Konev, Dmitry V. Shapovalov:
On Guaranteed Estimation of the Spectral Density of an Autoregression-Moving Average Process. Probl. Inf. Transm. 38(1): 80-95 (2002) - Oleg F. Kurmaev:
Enumerative Coding for Constant-Weight Binary Sequences with Constrained Run-Length of Zeros. Probl. Inf. Transm. 38(4): 249-254 (2002) - Alexei V. Ourivski, Thomas Johansson:
New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications. Probl. Inf. Transm. 38(3): 237-246 (2002) - Vyacheslav V. Prelov, Edward C. van der Meulen:
On the Epsilon-entropy of One Class of Ellipsoids in a Hamming Space. Probl. Inf. Transm. 38(2): 113-125 (2002) - B. Ya. Ryabko, Elena Matchikina:
An Efficient Generation Method for Uniformly Distributed Random Numbers. Probl. Inf. Transm. 38(1): 20-25 (2002) - Yuri M. Shtarkov:
Joint Matrix Universal Coding of Sequences of Independent Symbols. Probl. Inf. Transm. 38(2): 154-165 (2002) - V. M. Sidelnikov:
Quantum Codes and Abelian Subgroups of the Extra-Special Group. Probl. Inf. Transm. 38(3): 194-202 (2002) - Per Ståhl, Rolf Johannesson:
A Note on Systematic Tailbiting Encoders. Probl. Inf. Transm. 38(1): 55-64 (2002) - Yuri M. Suhov, Nikita D. Vvedenskaya:
Fast Jackson Networks with Dynamic Routing. Probl. Inf. Transm. 38(2): 136-153 (2002) - A. P. Trifonov, A. V. Zakharov, E. V. Pronyaev:
Adaptive Detection of a Stochastic Signal under Parametric a priori Uncertainty. Probl. Inf. Transm. 38(3): 203-217 (2002) - S. N. Tronin:
On the Relation between Cardinalities of 1-Orbits and 1-Information of Words. Probl. Inf. Transm. 38(1): 36-40 (2002) - Boris S. Tsybakov, Anatoly R. Rubinov:
Some Constructions of Conflict-Avoiding Codes. Probl. Inf. Transm. 38(4): 268-279 (2002) - M. Yu. Tyurikov:
Multiplicativity of Markov Chains with Multiaddress Routing. Probl. Inf. Transm. 38(3): 227-236 (2002)
skipping 5 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-09 18:26 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint