default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexey Oblaukhov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j5]Sihem Mesnager
, Alexey Oblaukhov:
Classification of the Codewords of Weights 16 and 18 of the Reed-Muller Code RM(n-3, n). IEEE Trans. Inf. Theory 68(2): 940-952 (2022)- 2021
- [j4]Alexey Oblaukhov:
On metric regularity of Reed-Muller codes. Des. Codes Cryptogr. 89(1): 167-197 (2021) - 2020
- [j3]Anastasiya Gorodilova, Sergey Agievich, Claude Carlet, Xiang-dong Hou, Valeriya Idrisova, Nikolay Kolomeec, Alexandr Kutsenko, Luca Mariot, Alexey Oblaukhov, Stjepan Picek, Bart Preneel, Razvan Rosie, Natalia N. Tokareva:
The Fifth International Students' Olympiad in cryptography - NSUCRYPTO: Problems and their solutions. Cryptologia 44(3): 223-256 (2020) - [i6]Anastasiya Gorodilova, Natalia N. Tokareva, Sergey Agievich, Claude Carlet, Evgeny Gorkunov, Valeria Idrisova, Nikolay Kolomeec, Alexandr Kutsenko, Roman Lebedev, Svetla Nikova, Alexey Oblaukhov, Irina Pankratova, Marina Pudovkina, Vincent Rijmen, Aleksei Udovenko:
On the Sixth International Olympiad in Cryptography NSUCRYPTO. CoRR abs/2005.09563 (2020)
2010 – 2019
- 2019
- [j2]Alexey Oblaukhov:
A lower bound on the size of the largest metrically regular subset of the Boolean cube. Cryptogr. Commun. 11(4): 777-791 (2019) - [j1]Anastasiya Gorodilova, Sergey Agievich, Claude Carlet, Evgeny Gorkunov, Valeriya Idrisova, Nikolay Kolomeec, Alexandr Kutsenko, Svetla Nikova, Alexey Oblaukhov, Stjepan Picek, Bart Preneel, Vincent Rijmen, Natalia N. Tokareva:
Problems and solutions from the fourth International Students' Olympiad in Cryptography (NSUCRYPTO). Cryptologia 43(2): 138-174 (2019) - [i5]Anastasiya Gorodilova, Sergey Agievich, Claude Carlet, Xiang-dong Hou, Valeriya Idrisova, Nikolay Kolomeec, Alexandr Kutsenko, Luca Mariot, Alexey Oblaukhov, Stjepan Picek, Bart Preneel, Razvan Rosie, Natalia N. Tokareva:
The Fifth International Students' Olympiad in Cryptography - NSUCRYPTO: problems and their solutions. CoRR abs/1906.04480 (2019) - [i4]Alexey Oblaukhov:
On metric regularity of Reed-Muller codes. CoRR abs/1912.10811 (2019) - [i3]Alexey Oblaukhov:
On metric regularity of Reed-Muller codes. IACR Cryptol. ePrint Arch. 2019: 1481 (2019) - 2018
- [i2]Anastasiya Gorodilova, Sergey Agievich, Claude Carlet, Evgeny Gorkunov, Valeriya Idrisova, Nikolay Kolomeec, Alexandr Kutsenko, Svetla Nikova, Alexey Oblaukhov, Stjepan Picek, Bart Preneel, Vincent Rijmen, Natalia N. Tokareva:
Problems and solutions of the Fourth International Students' Olympiad in Cryptography NSUCRYPTO. CoRR abs/1806.02059 (2018) - 2017
- [i1]Natalia N. Tokareva, Anastasiya Gorodilova, Sergey Agievich, Valeriya Idrisova, Nikolay Kolomeec, Alexandr Kutsenko, Alexey Oblaukhov, George Shushuev:
Mathematical methods in solutions of the problems from the Third International Students' Olympiad in Cryptography. CoRR abs/1710.05873 (2017)
Coauthor Index
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.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
