default search action
Assya Rousseva
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j15]Sascha Kurz, Ivan N. Landjev, Assia Rousseva:
Classification of $ \mathbf{(3 \!\mod 5)} $ arcs in $ \mathbf{ \operatorname{PG}(3,5)} $. Adv. Math. Commun. 17(1): 172-206 (2023) - [j14]Ivan N. Landjev
, Assia Rousseva, Konstantin V. Vorob'ev
Constructions of binary codes with two distances. Discret. Math. 346(6): 113337 (2023) - 2021
- [i1]Sascha Kurz, Ivan N. Landjev, Assia Rousseva:
Classification of 3 mod 5 arcs in PG(3, 5). CoRR abs/2108.04871 (2021) - 2020
- [j13]Assia Rousseva
The geometric approach to the existence of some quaternary Griesmer codes. Des. Codes Cryptogr. 88(9): 1925-1940 (2020) - [c1]Assia Rousseva, Ivan N. Landjev:
Codes related to caps and the non-existence of some Griesmer codes. ACCT 2020: 123-127
2010 – 2019
- 2019
- [j12]Assia Rousseva
Linear codes close to the Griesmer bound and the related geometric structures. Des. Codes Cryptogr. 87(4): 841-854 (2019) - [j11]Ivan N. Landjev, Assya Rousseva:
Divisible Arcs, Divisible Codes, and the Extension Problem for Arcs and Codes. Probl. Inf. Transm. 55(3): 226-240 (2019) - 2017
- [j10]Ivan N. Landjev, Assia Rousseva
On the Sharpness of the Griesmer Bound. Electron. Notes Discret. Math. 57: 147-152 (2017) - [j9]Ivan N. Landjev, Assia Rousseva
On the Characterization of (3 mod 5) Arcs. Electron. Notes Discret. Math. 57: 187-192 (2017) - 2016
- [j8]Ivan N. Landjev, Assia Rousseva
The non-existence of (104, 22;3, 5)-arcs. Adv. Math. Commun. 10(3): 601-611 (2016) - [j7]Ivan N. Landjev, Assia Rousseva
On the extendability of quasidivisible Griesmer arcs. Des. Codes Cryptogr. 79(3): 535-547 (2016) - 2014
- [j6]Ivan N. Landjev, Assya Rousseva
On the sharpness of Bruen's bound for intersection sets in Desarguesian affine spaces. Des. Codes Cryptogr. 72(3): 551-558 (2014) - 2013
- [j5]Ivan N. Landjev, Assya Rousseva
On t-fold blocking sets in affine spaces and the sharpness of Bruen's bound. Electron. Notes Discret. Math. 40: 329-333 (2013) - 2011
- [j4]Ivan N. Landjev, Assya Rousseva
Characterization of some optimal arcs. Adv. Math. Commun. 5(2): 317-331 (2011)
2000 – 2009
- 2006
- [j3]Ivan N. Landjev, Assya Rousseva
An extension theorem for arcs and linear codes. Probl. Inf. Transm. 42(4): 319-329 (2006) - 2005
- [j2]Tatsuya Maruta, Ivan N. Landjev, Assya Rousseva
On the Minimum Size of Some Minihypers and Related Linear Codes. Des. Codes Cryptogr. 34(1): 5-15 (2005) - 2003
- [j1]Ivan N. Landjev, Assya Rousseva
On Optimal Codes Over the Field with Five Elements. Des. Codes Cryptogr. 29(1-3): 165-175 (2003)
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:44 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: