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 38 matches
- 2009
- Leonid A. Bassalygo:
A model of restricted asynchronous multiple access in the presence of errors. Probl. Inf. Transm. 45(1): 37-45 (2009) - M. S. Bespalov:
New enumeration of Walsh matrices. Probl. Inf. Transm. 45(4): 333-342 (2009) - Vladimir M. Blinovsky:
Plotkin bound generalization to the case of multiple packings. Probl. Inf. Transm. 45(1): 1-4 (2009) - Vladimir M. Blinovsky:
A proof of one correlation inequality. Probl. Inf. Transm. 45(3): 264 (2009) - Irina E. Bocharova, Boris D. Kudryashov, Roman V. Satyukov:
Graph-based convolutional and block LDPC codes. Probl. Inf. Transm. 45(4): 357-377 (2009) - Silvia P. Boumova, Peter G. Boyvalenkov, Maya Stoyanova:
A method for proving nonexistence of spherical designs of odd strength and odd cardinality. Probl. Inf. Transm. 45(2): 110-123 (2009) - Sergey A. Dudin:
The MAP/M/N retrial queueing system with time-phased batch arrivals. Probl. Inf. Transm. 45(3): 270 (2009) - Arkadii G. D'yachkov, A. N. Voronina:
DNA codes for additive stem similarity. Probl. Inf. Transm. 45(2): 124-144 (2009) - Ernst M. Gabidulin, Martin Bossert:
Algebraic codes for network coding. Probl. Inf. Transm. 45(4): 343-356 (2009) - Fabien Galand, Gregory A. Kabatiansky:
Coverings, centered codes, and combinatorial steganography. Probl. Inf. Transm. 45(3): 289 (2009) - G. K. Golubev:
On signal reconstruction in white noise using dictionaries. Probl. Inf. Transm. 45(4): 378-392 (2009) - Evgeny V. Gorkunov:
The group of permutation automorphisms of a q-ary hamming code. Probl. Inf. Transm. 45(4): 309-316 (2009) - Philippe Jacquet:
Shannon capacity in poisson wireless network model. Probl. Inf. Transm. 45(3): 193 (2009) - S. A. Kalinchuk, Yu L. Sagalovich:
The smallest known length of an ordered system of generators of a symmetric group. Probl. Inf. Transm. 45(3): 242 (2009) - V. V. Khutortsev:
On asymptotic description of a probabilistic change-point model for a two-state discrete Markov process. Probl. Inf. Transm. 45(3): 232 (2009) - A. A. Kozhevnikov, Sergey I. Nikolenko:
On complete one-way functions. Probl. Inf. Transm. 45(2): 168-183 (2009) - Alexey V. Lebedev:
On one top news list model. Probl. Inf. Transm. 45(3): 282-288 (2009) - Nathan Levy, Ofer Zeitouni, Shlomo Shamai (Shitz):
Central limit theorem and large deviations of the fading Wyner cellular model via product of random matrices theory. Probl. Inf. Transm. 45(1): 5-22 (2009) - Vadim A. Malyshev, V. A. Shvets:
On decay of correlations for an exclusion process with asymmetric boundary conditions. Probl. Inf. Transm. 45(1): 65-73 (2009) - S. S. Marchenkov, S. I. Krivospitsky:
Superpositions of continuous functions defined on a Baire space. Probl. Inf. Transm. 45(4): 393-399 (2009) - Ivan Yu. Mogilnykh:
On weak isometries of Preparata codes. Probl. Inf. Transm. 45(2): 145-150 (2009) - Andrei A. Muchnik:
Algorithmic randomness and splitting of supermartingales. Probl. Inf. Transm. 45(1): 54-64 (2009) - Francisco J. Piera, Patricio Parada:
On convergence properties of Shannon entropy. Probl. Inf. Transm. 45(2): 75-94 (2009) - Vladimir V. Podolskii:
Perceptrons of large weight. Probl. Inf. Transm. 45(1): 46-53 (2009) - Vyacheslav V. Prelov:
Mutual information of several random variables and its estimation via variation. Probl. Inf. Transm. 45(4): 295-308 (2009) - Vyacheslav V. Prelov, Edward C. van der Meulen:
Remark on "On Error-free Filtering of Finite-State Singular Processes under Dependent Distortions" published in Probl. Peredachi Inf., 2007, no. 4. Probl. Inf. Transm. 45(2): 191 (2009) - B. Ya. Ryabko, Daniil Ryabko:
Asymptotically optimal perfect steganographic systems. Probl. Inf. Transm. 45(2): 184-190 (2009) - Alexander V. Seliverstov, Vassily A. Lyubetsky:
On symmetric matrices with indeterminate leading diagonals. Probl. Inf. Transm. 45(3): 258 (2009) - V. M. Sidelnikov, O. Yu. Prikhodov:
On the construction of (w, r) cover-free codes. Probl. Inf. Transm. 45(1): 32-36 (2009) - Faina I. Solov'eva:
On transitive partitions of an n-cube into codes. Probl. Inf. Transm. 45(1): 23-31 (2009)
skipping 8 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-10-06 11:51 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