default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNatalia A. Shekhunova
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j13]Sergey Bezzateev
, Natalia A. Shekhunova:
Totally decomposed cumulative Goppa codes with improved estimations. Des. Codes Cryptogr. 87(2-3): 569-587 (2019)- 2018
- [j12]Sergei V. Bezzateev, Natalia A. Shekhunova:
Lower Bounds on the Covering Radius of the Non-Binary and Binary Irreducible Goppa Codes. IEEE Trans. Inf. Theory 64(11): 7171-7177 (2018) - 2017
- [j11]Sergey Bezzateev, Natalia A. Shekhunova:
Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets. Cryptogr. Commun. 9(1): 23-39 (2017) - [j10]Sergey Bezzateev, Natalia A. Shekhunova:
Lower bound of covering radius of binary irreducible Goppa codes. Des. Codes Cryptogr. 82(1-2): 69-76 (2017) - [j9]Sergei V. Bezzateev, Natalia A. Shekhunova:
Lower Bound of the Covering Radius of Irreducible Goppa Codes. Electron. Notes Discret. Math. 57: 55-60 (2017) - 2013
- [j8]Sergey Bezzateev, Natalia A. Shekhunova:
Class of generalized Goppa codes perfect in weighted Hamming metric. Des. Codes Cryptogr. 66(1-3): 391-399 (2013) - [j7]Sergei V. Bezzateev, Natalia A. Shekhunova:
A new subclass of cyclic Goppa codes. Probl. Inf. Transm. 49(4): 348-353 (2013) - [j6]Sergei V. Bezzateev, Natalia A. Shekhunova:
Subclass of Cyclic Goppa Codes. IEEE Trans. Inf. Theory 59(11): 7379-7385 (2013) - 2012
- [j5]Sergei V. Bezzateev, Natalia A. Shekhunova:
Binary generalized (L, G) codes that are perfect in a weighted hamming metric. Probl. Inf. Transm. 48(3): 239-242 (2012) - 2010
- [j4]Sergei V. Bezzateev, Natalia A. Shekhunova:
Special classes of separable Goppa codes with improved parameter estimates. Probl. Inf. Transm. 46(3): 225-244 (2010) - 2008
- [j3]Sergey Bezzateev, Natalia A. Shekhunova:
Chain of Separable Binary Goppa Codes and Their Minimal Distance. IEEE Trans. Inf. Theory 54(12): 5773-5778 (2008) - 1998
- [j2]Sergei V. Bezzateev, Natalia A. Shekhunova:
A Subclass of Binary Goppa Codes with Improved Estimation of the Code Dimension. Des. Codes Cryptogr. 14(1): 23-38 (1998) - 1995
- [j1]Sergei V. Bezzateev, Natalia A. Shekhunova:
Subclass of binary Goppa codes with minimal distance equal to the design distance. IEEE Trans. Inf. Theory 41(2): 554-555 (1995)
Informal and Other Publications
- 2010
- [i2]Sergey Bezzateev, Natalia A. Shekhunova:
Cumulative-Separable Codes. CoRR abs/1005.1524 (2010) - 2007
- [i1]Sergey Bezzateev, Natalia A. Shekhunova:
Chain of Separable Binary Goppa Codes and their Minimal Distance. CoRR abs/0707.4083 (2007)
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 2025-01-21 00:15 CET 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:
