Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
EDBT 2026 Demo / reviewers in the wild / expert

Natalia A. Shekhunova

dblp:60/2765 · DBLP profile ↗
← Back
9ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 5 · 1 since 2021Theory of computation · 4

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
4 papers
Coding theory · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
algebraic coding theory		 0.642018
Lower Bounds on the Covering Radius of the Non-Binary and Binary Irreducible Goppa Codes · IEEE Trans. Inf. Theory 2018
Subclass of Cyclic Goppa Codes · IEEE Trans. Inf. Theory 2013
Chain of Separable Binary Goppa Codes and Their Minimal Distance · IEEE Trans. Inf. Theory 2008
Coding theory › error-correcting codes › algebraic geometry code
goppa codes		 0.642018
Lower Bounds on the Covering Radius of the Non-Binary and Binary Irreducible Goppa Codes · IEEE Trans. Inf. Theory 2018
Subclass of Cyclic Goppa Codes · IEEE Trans. Inf. Theory 2013
Chain of Separable Binary Goppa Codes and Their Minimal Distance · IEEE Trans. Inf. Theory 2008
Coding theory › error-correcting codes › covering radius
covering radius bound		 0.312018
Lower Bounds on the Covering Radius of the Non-Binary and Binary Irreducible Goppa Codes · IEEE Trans. Inf. Theory 2018
Coding theory › error-correcting codes › algebraic geometry code › goppa codes
cyclic goppa codes		 0.212013
Subclass of Cyclic Goppa Codes · IEEE Trans. Inf. Theory 2013
Coding theory › error-correcting codes › algebraic geometry code › goppa codes
binary goppa codes		 0.011995
Subclass of binary Goppa codes with minimal distance equal to the design distance · IEEE Trans. Inf. Theory 1995
YearPublicationVenuePosition
2025 Self-reversible generalized (L,G)-codes
Sergey Bezzateev, Natalia A. Shekhunova
 Des. Codes Cryptogr.2
2019 Totally decomposed cumulative Goppa codes with improved estimations
Sergey Bezzateev, Natalia A. Shekhunova
 Des. Codes Cryptogr.2
2018 Lower Bounds on the Covering Radius of the Non-Binary and Binary Irreducible Goppa Codes
abstract
New lower bounds on the covering radius for different subclasses of irreducible Goppa codes are obtained.
Sergey Bezzateev, Natalia A. Shekhunova
 IEEE Trans. Inf. Theory2
2017 Lower bound of covering radius of binary irreducible Goppa codes
Sergey Bezzateev, Natalia A. Shekhunova
 Des. Codes Cryptogr.2
2013 Class of generalized Goppa codes perfect in weighted Hamming metric
Sergey Bezzateev, Natalia A. Shekhunova
 Des. Codes Cryptogr.2
2013 Subclass of Cyclic Goppa Codes
abstract
The subclass of cyclic Goppa codes is proposed. It is proved that this subclass contains all cyclic codes of length n|qm±1 with generator polynomial g(x), g(αi)=g(α-j)=0, i=0,1,..., s1, j=1,..., s2, αn=1, α ∈ GF(q2m).
Sergey Bezzateev, Natalia A. Shekhunova
 IEEE Trans. Inf. Theory2
2008 Chain of Separable Binary Goppa Codes and Their Minimal Distance
abstract
It is shown that subclasses of separable binary Goppa codes,Gamma(L,G) - codes, withL={alpha isin GF(22l):G(alpha) ne 0 } and special Goppa polynomialsG(x) can be presented as a chain of embedded and equivalent codes. The true minimal distance has been obtained for all codes of the chain.
Sergey Bezzateev, Natalia A. Shekhunova
 IEEE Trans. Inf. Theory2
1998 A Subclass of Binary Goppa Codes with Improved Estimation of the Code Dimension
Sergey Bezzateev, Natalia A. Shekhunova
 Des. Codes Cryptogr.2
1995 Subclass of binary Goppa codes with minimal distance equal to the design distance
abstract
A subclass of binary Goppa codes specified by a separable polynomial G(x)=x/sup t/+A and a subset L of elements of GF(2/sup m/) (no element of L may be a root of G(x) and t|(2/sup m/-1), A is a tth power in {GF(2/sup m/)/{0}}, is studied. For such codes it is shown that their minimal distance is equal to the design distance d=2t+1.>
Sergey Bezzateev, Natalia A. Shekhunova
 IEEE Trans. Inf. Theory2