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 26 matches
- 2021
- Krishna Gopal Benerjee, Manish K. Gupta:
Trade-off for Heterogeneous Distributed Storage Systems between Storage and Repair Cost. Probl. Inf. Transm. 57(1): 33-53 (2021) - A. V. Berdnikov, Andrei M. Raigorodskii:
Bounds on Borsuk Numbers in Distance Graphs of a Special Type. Probl. Inf. Transm. 57(2): 136-142 (2021) - Marat V. Burnashev:
On Minimax Detection of Gaussian Stochastic Sequences and Gaussian Stationary Signals. Probl. Inf. Transm. 57(3): 248-264 (2021) - Nikita Mikhailovich Derevyanko, Mikhail M. Koshelev:
New Modularity Bounds for Graphs G(n, r, s) and Gp(n, r, s). Probl. Inf. Transm. 57(4): 380-401 (2021) - N. G. Dokuchaev:
On Data Compression and Recovery for Sequences Using Constraints on the Spectrum Range. Probl. Inf. Transm. 57(4): 368-372 (2021) - Nikita Andreevich Dubinin:
New Turán Type Bounds for Johnson Graphs. Probl. Inf. Transm. 57(4): 373-379 (2021) - G. D. Dvorkin:
Geometric Interpretation of Entropy: New Results. Probl. Inf. Transm. 57(3): 281-291 (2021) - Arkady G. D'yachkov, D. Yu. Goshkoder:
New Lower Bounds on the Fraction of Correctable Errors under List Decoding in Combinatorial Binary Communication Channels. Probl. Inf. Transm. 57(4): 301-320 (2021) - Elena Egorova, Gregory A. Kabatiansky:
Separable Collusion-Secure Multimedia Codes. Probl. Inf. Transm. 57(2): 178-198 (2021) - Ernst M. Gabidulin, Nina I. Pilipchuk, O. V. Trushina:
Bounds on the Cardinality of Subspace Codes with Non-maximum Code Distance. Probl. Inf. Transm. 57(3): 241-247 (2021) - Ekatherina A. Karatsuba:
On an Evaluation Method for Zeta Constants Based on a Number Theoretic Approach. Probl. Inf. Transm. 57(3): 265-280 (2021) - Simon M. Karpenko, Egor I. Ershov:
Analysis of Properties of Dyadic Patterns for the Fast Hough Transform. Probl. Inf. Transm. 57(3): 292-300 (2021) - Takis Konstantopoulos, A. V. Logachov, A. A. Mogulskii, S. G. Foss:
Limit Theorems for the Maximal Path Weight in a Directed Graph on the Line with Random Weights of Edges. Probl. Inf. Transm. 57(2): 161-177 (2021) - Vladimir S. Lebedev, N. A. Polyanskii:
Coding in a Z-Channel in Case of Many Errors. Probl. Inf. Transm. 57(2): 129-135 (2021) - Georg Maringer, N. A. Polyanskii, Ilya V. Vorobyev, Lorenz Welter:
Feedback Insertion-Deletion Codes. Probl. Inf. Transm. 57(3): 212-240 (2021) - Nupur Patanker, Sanjay Kumar Singh:
Affine Variety Codes over a Hyperelliptic Curve. Probl. Inf. Transm. 57(1): 84-97 (2021) - N. A. Polyanskii:
On List Decoding of Certain 픽q-Linear Codes. Probl. Inf. Transm. 57(4): 341-356 (2021) - Vyacheslav V. Prelov:
The f-Divergence and Coupling of Probability Distributions. Probl. Inf. Transm. 57(1): 54-69 (2021) - Vyacheslav V. Prelov:
On the Maximum f-Divergence of Probability Distributions Given the Value of Their Coupling. Probl. Inf. Transm. 57(4): 321-330 (2021) - Alexander M. Romanov:
On Perfect and Reed-Muller Codes over Finite Fields. Probl. Inf. Transm. 57(3): 199-211 (2021) - Konchady Gautam Shenoy, Vinod Sharma:
Finite Blocklength Analysis of Energy Harvesting Channels. Probl. Inf. Transm. 57(1): 1-32 (2021) - Faina I. Solov'eva:
On Intersections of Reed-Muller Like Codes. Probl. Inf. Transm. 57(4): 357-367 (2021) - Anuj S. Vora, Ankur A. Kulkarni:
Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an Arbitrarily Varying Channel. Probl. Inf. Transm. 57(2): 99-128 (2021) - Mikhail N. Vyalyi:
Counting the Number of Perfect Matchings, and Generalized Decision Trees. Probl. Inf. Transm. 57(2): 143-160 (2021) - Victor A. Zinoviev, Dmitrii V. Zinoviev:
On the Generalized Concatenated Construction for Codes in L1 and Lee Metrics. Probl. Inf. Transm. 57(1): 70-83 (2021) - Victor A. Zinoviev, Dmitrii V. Zinoviev:
On the Generalized Concatenated Construction for the Nordstrom-Robinson Code and the Binary Golay Code. Probl. Inf. Transm. 57(4): 331-340 (2021)
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-28 19:06 CET 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