default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDV. S. Usatyuk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i13]Vasiliy Usatyuk, Denis Sapozhnikov, Sergey Egorov:
Topology-Aware Exploration of Energy-Based Models Equilibrium: Toric QC-LDPC Codes and Hyperbolic MET QC-LDPC Codes. CoRR abs/2401.14749 (2024)- [i12]Vasiliy Usatyuk, Yury Kuznetsov, Sergey Egorov:
Cyclic Group Projection for Enumerating Quasi-Cyclic Codes Trapping Sets. CoRR abs/2401.14810 (2024) - 2023
- [i11]Vasiliy Usatyuk, Sergey Egorov, Denis Sapozhnikov:
Spherical and Hyperbolic Toric Topology-Based Codes On Graph Embedding for Ising MRF Models: Classical and Quantum Topology Machine Learning. CoRR abs/2307.15778 (2023) - 2022
- [i10]Vasiliy Usatyuk:
An Modified Cole's Importance Sampling Method For Low Error Floor QC-LDPC Codes Construction. CoRR abs/2208.05795 (2022) - 2020
- [c9]Vasiliy Usatyuk
, Sergey Egorov:
Hyper Neural Network as the Diffeomorphic Domain for Short Code Soft Decision Beyound Belief Propagation Decoding Problem. EWDTS 2020: 1-6 - [c8]Vasiliy Usatyuk:
Wireless Channels Topology Invariant as Mathematical Foundation of Neural Network Channel Estimation Transfer Learning Properties. TSP 2020: 105-111
2010 – 2019
- 2019
- [c7]German Svistunov, Vasiliy Usatyuk:
Interleaved Cyclic Group Decomposition Length Adaptive MET QC-LDPC Codes. BlackSeaCom 2019: 1-3 - [c6]German Svistunov, Vasiliy Usatyuk, Sergey Egorov:
Protograph Sieving Method for Construction Moderate Length Multi-Edge Type QC-LDPC Codes. EWDTS 2019: 1-4 - [c5]Vasiliy Usatyuk, Sergey Egorov, German Svistunov:
Construction of Length and Rate Adaptive MET QC-LDPC Codes by Cyclic Group Decomposition. EWDTS 2019: 1-5 - [c4]Vasiliy Usatyuk, Ilya Vorobyev:
Construction of High Performance Block and Convolutional Multi-Edge Type QC-LDPC codes. TSP 2019: 158-163 - 2018
- [c3]Ilya Vorobyev, Nikita Polyanskii, German Svistunov, Sergey Egorov, Vasiliy Usatyuk:
Generalization of Floor Lifting for QC-LDPC Codes: Theoretical Properties and Applications. EWDTS 2018: 1-6 - [c2]Vasiliy Usatyuk, Ilya Vorobyev:
Simulated Annealing Method for Construction of High-Girth QC-LDPC Codes. TSP 2018: 1-5 - 2017
- [c1]Vasiliy Usatyuk, Sergey Egorov:
Generalization of floor lifting for QC-LDPC codes. EWDTS 2017: 1-6 - [i9]Nikita Polyanskii, Vasiliy Usatyuk, Ilya Vorobyev:
Floor Scale Modulo Lifting for QC-LDPC codes. CoRR abs/1701.07521 (2017) - 2015
- [i8]Vasiliy Usatyuk:
Some problems of Graph Based Codes for Belief Propagation decoding. CoRR abs/1511.00133 (2015) - 2014
- [i7]Vasiliy Usatyuk:
Application of lattice reduction block Korkin-Zolotarev method to MIMO-decoding. CoRR abs/1405.3599 (2014) - 2013
- [i6]Vasiliy Usatyuk:
Upper bound on the cardinality containing shortest vectors in a lattice reduced by block Korkin-Zolotarev method. CoRR abs/1302.4062 (2013) - [i5]Vasiliy Usatyuk:
The implementation of the parallel shortest vector enumerate in the block Korkin-Zolotarev method. CoRR abs/1304.1900 (2013) - 2012
- [i4]Vasiliy Usatyuk:
Short review of lattice basis reduction types and his applications. (Russian). CoRR abs/1210.6494 (2012) - [i3]Vasiliy Usatyuk:
Block Korkin-Zolotarev algorithm generalization and their practical implementation. (Russian). CoRR abs/1210.6502 (2012) - 2010
- [i2]V. S. Usatyuk:
Review of Lattice-based Public key Cryptography. (Russian). CoRR abs/1003.5304 (2010) - [i1]V. S. Usatyuk:
Lattice Problems and Their Reductions. (Russian). CoRR abs/1010.2368 (2010)
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-10-07 21:12 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:
