Остановите войну!
for scientists:
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
- 2021
- Dmitry Osipov:
Novel order statistics-based detector and coded modulation for a DHA FH OFDMA system. REDUNDANCY 2021: 11-16 - Kirill V. Andreev, Alexey A. Frolov:
On Unsourced Random Access for the MIMO Channel. REDUNDANCY 2021: 17-21 - Kirill V. Andreev, Alexey A. Frolov, German Svistunov, Kedi Wu, Jing Liang:
Deep Neural Network Based Decoding of Short 5G LDPC Codes. REDUNDANCY 2021: 155-160 - Gleb Balitskiy, Alexey A. Frolov, Pavel S. Rybin:
Linear Programming Decoding of Non-Linear Sparse-Graph Codes. REDUNDANCY 2021: 149-154 - Igor Bogdanov, Vladimir Shchur:
Variational Autoencoders with Euclidean and Hyperbolic Latent Spaces for Population Genetics. REDUNDANCY 2021: 91-94 - Anna Borisovskaya, Anton Glebov, Andrey M. Turlikov:
Estimation of average delay in systems with unsourced random access and multiple departure. REDUNDANCY 2021: 28-33 - Peter G. Boyvalenkov, Navid Safaei:
On spherical 4-distance 7-designs. REDUNDANCY 2021: 101-105 - Mustafa Doger, Sennur Ulukus:
Group Testing with Non-identical Infection Probabilities. REDUNDANCY 2021: 110-115 - Nahid Esmati, Anoosheh Heidarzadeh, Alex Sprintson:
Multi-Server Private Linear Computation with Joint and Individual Privacy Guarantees. REDUNDANCY 2021: 1-6 - Andrey Fionov, Alexandr Klevtsov:
Eliminating Broadband Covert Channels in DSA-Like Signatures. REDUNDANCY 2021: 45-48 - Hong Fu, Hanxu Hou, Li Zhang:
Extended EVENODD+ Codes with Asymptotically Optimal Updates and Efficient Encoding/Decoding. REDUNDANCY 2021: 1-6 - Fedor I. Ivanov, Eugenii Krouk, Victor V. Zyablov:
New Code-Based Cryptosystem Based on Binary Image of Generalized Reed-Solomon Code. REDUNDANCY 2021: 66-69 - Wrya K. Kadir:
New Communication Models and Decoding of Maximum Rank Distance Codes. REDUNDANCY 2021: 125-130 - Fatemeh Kazemi, Alex Sprintson:
Multi-Server Private Linear Transformation with Joint Privacy. REDUNDANCY 2021: 182-187 - Alexander V. Kolnogorov:
Gaussian One-Armed Bandit Problem. REDUNDANCY 2021: 74-79 - Omri Lev, Anatoly Khina:
Schemes for LQG Control over Gaussian Channels with Side Information. REDUNDANCY 2021: 85-90 - Wenhui Li, Vladimir Sidorenko, Antonia Wachter-Zeh:
On transform-domain decoding of generalized Gabidulin codes : Dedicated to the memory of Ernst M. Gabidulin (1937-2021). REDUNDANCY 2021: 131-136 - Alexey Los, Aleksandr Belov:
On the conditions of convergence of the functional from the sum of independent random variables to the functional from the Wiener process. REDUNDANCY 2021: 80-84 - Roberto Assis Machado, Rafael G. L. D'Oliveira, Salim El Rouayheb, Daniel Heinlein:
Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication. REDUNDANCY 2021: 188-193 - Anna Melman, Oleg Evsutin:
On the Efficiency of Metaheuristic Optimization for Adaptive Image Steganography in the DFT Domain. REDUNDANCY 2021: 49-54 - Ilya Morzharetto, Peter Trifonov:
Bidirectional search application for polar codes with large kernels. REDUNDANCY 2021: 161-165 - Alexey Nesterenko:
Differential properties of authenticated encryption mode based on universal hash function (XTSMAC). REDUNDANCY 2021: 39-44 - Cornelia Ott, Sven Puchinger, Martin Bossert:
Bounds and Genericity of Sum-Rank-Metric Codes. REDUNDANCY 2021: 119-124 - Dmitry A. Perepelkin, Minh Pham:
Computer Modeling System of Allocating and Planning Processes of Heterogeneous Resources in Industrial Telecommunication Networks. REDUNDANCY 2021: 22-27 - Vladimir N. Potapov:
An Upper Bound on the Number of Bent Functions. REDUNDANCY 2021: 95-96 - Vladimir N. Potapov:
On Weight Spectrum of Linear Codes. REDUNDANCY 2021: 116-118 - Boris Ryabko:
Application of algorithmic information theory to calibrate tests of random number generators. REDUNDANCY 2021: 61-65 - Boris Ryabko, Nadezhda Savina:
Development of an information-theoretical method of attribution of literary texts. REDUNDANCY 2021: 70-73 - Boris Ryabko, Viacheslav Zhuravlev:
Construction of a pseudo-random number generator whose output is a normal sequence. REDUNDANCY 2021: 1-4 - Alexander B. Sergienko, Polina V. Apalina:
Design of Codebooks Optimized for Noncoherent Transmission over Fast Fading Channel. REDUNDANCY 2021: 5-10
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-05-25 16:30 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