![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 34 matches
- 2004
- L. L. Boiko:
Wavelets and Estimation of Discontinuous Functions. Probl. Inf. Transm. 40(3): 226-236 (2004) - Marat V. Burnashev:
On Optimal Detectors in Multiuser Detection Problems. Probl. Inf. Transm. 40(1): 44-52 (2004) - Marat V. Burnashev, Christian Schlegel, Witold A. Krzymien, Zhenning Shi:
Analysis of the dynamics of iterative interference cancellation in iterative decoding. Probl. Inf. Transm. 40(4): 297-317 (2004) - Ning Cai, Andreas J. Winter
, Raymond W. Yeung:
Quantum privacy and quantum wiretap channels. Probl. Inf. Transm. 40(4): 318-336 (2004) - Rumen N. Daskalov, Elena Metodieva:
The Nonexistence of Ternary [284, 6, 188] Codes. Probl. Inf. Transm. 40(2): 135-146 (2004) - Rumen N. Daskalov, Elena Metodieva, Plamen Hristov:
New Minimum Distance Bounds for Linear Codes over GF(9). Probl. Inf. Transm. 40(1): 13-24 (2004) - Xavier Descombes, Elena A. Zhizhina:
Gibbs Field Approaches in Image Processing Problems. Probl. Inf. Transm. 40(3): 279-295 (2004) - Rossitza Dodunekova, Stefan M. Dodunekov, Evgeniya P. Nikolova:
On the error-detecting performance of some classes of block codes. Probl. Inf. Transm. 40(4): 356-364 (2004) - V. R. Fatalov:
Point Asymptotics for Probabilities of Large Deviations of the ω2 Statistics in Verification of the Symmetry Hypothesis. Probl. Inf. Transm. 40(3): 212-225 (2004) - O. V. Gaas:
On the Asymptotic Power of the Likelihood Ratio Criterion for Testing the Hypothesis of Nonstationarity of an Autoregressive Series with Cauchy Innovations. Probl. Inf. Transm. 40(2): 175-185 (2004) - Ernst M. Gabidulin, Nina I. Pilipchuk:
Symmetric Rank Codes. Probl. Inf. Transm. 40(2): 103-117 (2004) - G. K. Golubev:
The Method of Risk Envelope in Estimation of Linear Functionals. Probl. Inf. Transm. 40(1): 53-65 (2004) - G. K. Golubev:
On a Method of Empirical Risk Minimization. Probl. Inf. Transm. 40(3): 202-211 (2004) - Hyun Kwang Kim, Vladimir S. Lebedev:
On the Optimality of Trivial (w, r)-Cover-Free Codes. Probl. Inf. Transm. 40(3): 195-201 (2004) - P. I. Kotsyuruba, Anatoly A. Nazarov:
Local Diffusion Approximation of the State Changing Process of an Unstable Random Access Network in a Neighborhood of the Asymptotic Mean. Probl. Inf. Transm. 40(1): 78-89 (2004) - Denis S. Krotov, Vladimir N. Potapov:
On Multifold MDS and Perfect Codes That Are Not Splittable into Onefold Codes. Probl. Inf. Transm. 40(1): 5-12 (2004) - D. Yu. Kuznetsov, Anatoly A. Nazarov:
Analysis of a Communication Network Governed by an Adaptive Random Multiple Access Protocol in Critical Load. Probl. Inf. Transm. 40(3): 243-253 (2004) - Evgeny Lakshtanov, E. S. Langvagen:
Criterion of Infinite Topological Entropy for Multidimensional Cellular Automata. Probl. Inf. Transm. 40(2): 165-167 (2004) - Alexey V. Lebedev:
Gated Infinite-Server Queue with Heavy Traffic and Power Tail. Probl. Inf. Transm. 40(3): 237-242 (2004) - A. V. Los':
Construction of Perfect q-ary Codes by Sequential Switchings of (∼α)-Components. Probl. Inf. Transm. 40(1): 37-43 (2004) - Sergey A. Nekrasov:
Probability-Theoretic and Statistical Analysis of Dictionary Texts. Probl. Inf. Transm. 40(2): 168-174 (2004) - Yu. I. Pastukhova:
Asymptotically efficient estimation of smooth functionals of the regression function for a known distribution of the observation noise. Probl. Inf. Transm. 40(4): 365-378 (2004) - Dmitriy A. Popov, Dmitry V. Sushko:
Image Restoration in Optical-Acoustic Tomography. Probl. Inf. Transm. 40(3): 254-278 (2004) - B. Ya. Ryabko, Andrey Pestunov:
"Book Stack" as a New Statistical Test for Random Numbers. Probl. Inf. Transm. 40(1): 66-71 (2004) - Yuri M. Shtarkov, Tjalling J. Tjalkens, Frans M. J. Willems:
Optimal Universal Coding with Respect to the Maximal Individual Relative Redundancy Criterion. Probl. Inf. Transm. 40(1): 90-101 (2004) - V. V. Tarasov:
On Indication of External Factors by Circuits of Functional Elements. Probl. Inf. Transm. 40(1): 72-77 (2004) - Natalia N. Tokareva:
On Components of Preparata Codes. Probl. Inf. Transm. 40(2): 159-164 (2004) - Mark Semenovich Pinsker. In Memoriam. Probl. Inf. Transm. 40(1): 1-4 (2004)
- Remark on "Construction of Perfect q-ary Codes by Sequential Switchings of (∼α)-Components" Published in Probl. Peredachi Inf., 2004, no. 1. Probl. Inf. Transm. 40(2): 186 (2004)
- Victor A. Zinoviev, Tor Helleseth:
On Weight Distributions of Shifts of Goethals-like Codes. Probl. Inf. Transm. 40(2): 118-134 (2004)
skipping 4 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-03 11:39 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