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 28 matches
- 2014
- Daniele Bartoli, Alexander A. Davydov, Giorgio Faina, Aleksei Andreevich Kreshchuk, Stefano Marcugini, Fernanda Pambianco:
Upper bounds on the smallest size of a complete arc in PG(2, q) under a certain probabilistic conjecture. Probl. Inf. Transm. 50(4): 320-339 (2014) - Leonid A. Bassalygo, Victor A. Zinoviev:
Optimal almost equisymbol codes based on difference matrices. Probl. Inf. Transm. 50(4): 313-319 (2014) - Michael L. Blank:
Interlacing and smoothing: Combinatorial aspects. Probl. Inf. Transm. 50(4): 350-363 (2014) - Vladimir M. Blinovsky:
Proof of two conjectures on correlation inequalities for one class of monotone functions. Probl. Inf. Transm. 50(3): 280-284 (2014) - Vladimir M. Blinovsky:
Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture. Probl. Inf. Transm. 50(4): 340-349 (2014) - Marat V. Burnashev, Hirosuke Yamamoto:
On using noisy feedback in a Gaussian channel. Probl. Inf. Transm. 50(3): 217-231 (2014) - Arkadii G. D'yachkov, A. N. Kuzina, N. A. Polyansky, Anthony J. Macula, Vyacheslav V. Rykov:
DNA codes for nonadditive stem similarity. Probl. Inf. Transm. 50(3): 247-269 (2014) - Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyansky, Vladislav Yu. Shchukin:
Bounds on the rate of disjunctive codes. Probl. Inf. Transm. 50(1): 27-56 (2014) - V. R. Fatalov:
Gaussian Ornstein-Uhlenbeck and Bogoliubov processes: Asymptotics of small deviations for L p -functionals, 0 < p < ∞. Probl. Inf. Transm. 50(4): 371-389 (2014) - Alexey A. Frolov, Victor V. Zyablov:
On the capacity of a multiple-access vector adder channel. Probl. Inf. Transm. 50(2): 133-143 (2014) - Alexander S. Holevo:
Gaussian classical-quantum channels: Gain from entanglement-assistance. Probl. Inf. Transm. 50(1): 1-14 (2014) - O. V. Kamlovskii:
Distribution of r-tuples in one class of uniformly distributed sequences over residue rings. Probl. Inf. Transm. 50(1): 90-105 (2014) - O. V. Kamlovskii:
Equidistributed sequences over finite fields produced by one class of linear recurring sequences over residue rings. Probl. Inf. Transm. 50(2): 171-185 (2014) - Ekatherina A. Karatsuba:
On one method for fast approximation of zeta constants by rational fractions. Probl. Inf. Transm. 50(2): 186-202 (2014) - M. E. Kovalenko, Timofey A. Urbanovich:
On the rank of incidence matrices for points and lines of finite affine and projective geometries over a field of four elements. Probl. Inf. Transm. 50(1): 79-89 (2014) - Boris D. Kudryashov, Anton V. Porov:
Universal coding for memoryless sources with countably infinite alphabets. Probl. Inf. Transm. 50(4): 390-399 (2014) - S. N. Popova:
Zero-one law for random distance graphs with vertices in {-1, 0, 1} n . Probl. Inf. Transm. 50(1): 57-78 (2014) - Vyacheslav V. Prelov:
On one extreme value problem for entropy and error probability. Probl. Inf. Transm. 50(3): 203-216 (2014) - Michael A. Raskin:
Remark on "Toom's partial order is transitive" published in Probl. Peredachi Inf., 2012, no. 2. Probl. Inf. Transm. 50(3): 292-301 (2014) - Maksim E. Shirokov, T. V. Shulman:
On superactivation of one-shot quantum zero-error capacity and the related property of quantum measurements. Probl. Inf. Transm. 50(3): 232-246 (2014) - Yuri M. Shtarkov:
Universal coding algorithm for a family of context Markov sources. Probl. Inf. Transm. 50(3): 285-291 (2014) - A. N. Starovoitov:
Conditions for a product-form stationary distribution of one queueing system with batch transfers and a disaster flow. Probl. Inf. Transm. 50(1): 106-116 (2014) - Peter Vladimirovich Trifonov:
Successive cancellation decoding of Reed-Solomon codes. Probl. Inf. Transm. 50(4): 303-312 (2014) - Moritz Wiese, Holger Boche:
On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders. Probl. Inf. Transm. 50(1): 15-26 (2014) - Mark M. Wilde, Andreas J. Winter:
Strong converse for the classical capacity of the pure-loss bosonic channel. Probl. Inf. Transm. 50(2): 117-132 (2014) - Jiang Xue, Md. Zahurul I. Sarkar, Tharmalingam Ratnarajah:
Error exponents for Nakagami-m fading channels. Probl. Inf. Transm. 50(2): 144-170 (2014) - Dmitrii V. Zinoviev:
On the number of 1-factorizations of a complete graph. Probl. Inf. Transm. 50(4): 364-370 (2014) - Victor A. Zinoviev, Dmitrii V. Zinoviev:
Non-full-rank Steiner quadruple systems S(v, 4, 3). Probl. Inf. Transm. 50(3): 270-279 (2014)
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-23 02:08 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