![](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 32 matches
- 2007
- Sergey V. Avgustinovich, Faina I. Solov'eva, Olof Heden:
On partitions of an n-cube into nonequivalent perfect codes. Probl. Inf. Transm. 43(4): 310-315 (2007) - Aleksandr V. Babash:
On reconstruction of information on an input word in a Medvedev permutation automaton given initial and final states. Probl. Inf. Transm. 43(2): 132-142 (2007) - Michael L. Blank, Sergey A. Pirogov:
On quasi-successful couplings of Markov processes. Probl. Inf. Transm. 43(4): 316-330 (2007) - Galina T. Bogdanova
, Victor A. Zinoviev, Todor Todorov
:
On the construction of q-ary equidistant codes. Probl. Inf. Transm. 43(4): 280-302 (2007) - Iliya Bouyukliev
, Stefka Bouyuklieva
, Stefan M. Dodunekov:
On binary self-complementary [120, 9, 56] codes having an automorphism of order 3 and associated SDP designs. Probl. Inf. Transm. 43(2): 89-96 (2007) - Marat V. Burnashev:
Addendum to "Code spectrum and the reliability function: Binary symmetric channel". Probl. Inf. Transm. 43(1): 23-25 (2007) - Marat V. Burnashev:
Code spectrum and the reliability function: Gaussian channel. Probl. Inf. Transm. 43(2): 69 (2007) - Jean-François Coeurjolly, Rémy Drouilhet, Jean-François Robineau:
Normalized information-based divergences. Probl. Inf. Transm. 43(3): 167-189 (2007) - Rumen N. Daskalov
:
Some high-rate linear codes over GF(5) and GF(7). Probl. Inf. Transm. 43(2): 124-131 (2007) - Ilya Dumer
, Gregory A. Kabatiansky, Cédric Tavernier:
List decoding of the first-order binary Reed-Muller codes. Probl. Inf. Transm. 43(3): 225-232 (2007) - Grigory Evseev, Andrey M. Turlikov
:
Interrelation of characteristics of blocked RMA stack algorithms. Probl. Inf. Transm. 43(4): 344-352 (2007) - V. R. Fatalov:
Exact asymptotics of distributions of integral functionals of the geometric Brownian motion and other related formulas. Probl. Inf. Transm. 43(3): 233-254 (2007) - S. G. Foss
:
On the exact asymptotics for the stationary sojourn time distribution in a tandem of queues with light-tailed service times. Probl. Inf. Transm. 43(4): 353-366 (2007) - Konstantin Yu. Gorbunov
:
Bound on the cardinality of a covering of an arbitrary randomness test by frequency tests. Probl. Inf. Transm. 43(1): 48-56 (2007) - Alexander S. Holevo:
One-mode quantum Gaussian channels: Structure and quantum capacity. Probl. Inf. Transm. 43(1): 1-11 (2007) - Sungpyo Hong, Stoyan N. Kapralov, Hyun Kwang Kim, Dong Yeol Oh:
Uniqueness of some optimal superimposed codes. Probl. Inf. Transm. 43(2): 113-123 (2007) - Boris D. Kudryashov, Kirill V. Yurkov:
Random coding bound for the second moment of multidimensional lattices. Probl. Inf. Transm. 43(1): 57-68 (2007) - Vladimir I. Levenshtein:
Conflict-avoiding codes and cyclic triple systems. Probl. Inf. Transm. 43(3): 199-212 (2007) - Ivan Yu. Mogilnykh:
On the regularity of perfect 2-colorings of the Johnson graph. Probl. Inf. Transm. 43(4): 303-309 (2007) - Mark S. Pinsker:
Some mathematical questions of theory of information transmission. Probl. Inf. Transm. 43(4): 380-392 (2007) - Vyacheslav V. Prelov:
On inequalities between mutual information and variation. Probl. Inf. Transm. 43(1): 12-22 (2007) - Vyacheslav V. Prelov, Edward C. van der Meulen:
On error-free filtering of finite-state singular processes under dependent distortions. Probl. Inf. Transm. 43(4): 271-279 (2007) - Alexander Yu. Privalov, Khosrow Sohraby:
Playout in slotted CBR networks: Single and multiple nodes. Probl. Inf. Transm. 43(2): 143-166 (2007) - B. Ya. Ryabko:
Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes. Probl. Inf. Transm. 43(4): 367-379 (2007) - Ilya Shapirovsky
:
Modal logics of some geometrical structures. Probl. Inf. Transm. 43(3): 255-262 (2007) - Faina I. Solov'eva:
On ℤ4-linear codes with the parameters of Reed-Muller codes. Probl. Inf. Transm. 43(1): 26-32 (2007) - Faina I. Solov'eva:
Tilings of nonorientable surfaces by Steiner triple systems. Probl. Inf. Transm. 43(3): 213-224 (2007) - Peter Vladimirovich Trifonov
:
Interpolation in list decoding of Reed-Solomon codes. Probl. Inf. Transm. 43(3): 190-198 (2007) - Nikita D. Vvedenskaya, Yuri M. Suhov:
Multi-access system with many users: Stability and metastability. Probl. Inf. Transm. 43(3): 263-269 (2007) - Andrei A. Zamyatin, Vadim A. Malyshev:
Accumulation on the boundary for a one-dimensional stochastic particle system. Probl. Inf. Transm. 43(4): 331-343 (2007)
skipping 2 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-07-12 20:43 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