default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSvetlana Topalova
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Anton Betten, Svetlana Topalova, Stela Zhelezova:
On parallelisms of PG(3,4) with automorphisms of order 2. Inf. Comput. 301: 105201 (2024)- 2023
- [c8]Svetlana Topalova
, Stela Zhelezova:
Parallelisms of rmPG(3,4) with a Great Number of Regular Spreads. LSSC 2023: 444-452 - 2022
- [j20]Anton Betten, Svetlana Topalova, Stela Zhelezova:
Parallelisms of PG(3, 4) invariant under an elementary abelian group of order 4. Appl. Algebra Eng. Commun. Comput. 33(6): 649-674 (2022) - [j19]Tsonka Baicheva, Svetlana Topalova:
On the diffusion of the Improved Generalized Feistel. Adv. Math. Commun. 16(1): 95-114 (2022) - 2021
- [c7]Svetlana Topalova, Stela Zhelezova:
New Parallelisms of $\mathrm{PG}(3, 5)$ with Automorphisms of Order 8. CASC 2021: 409-419 - [c6]Svetlana Topalova, Stela Zhelezova:
Backtrack Search for Parallelisms of Projective Spaces. IWOCA 2021: 544-557 - [c5]Svetlana Topalova, Stela Zhelezova:
On parallelisms of PG(5, 2) invariant under a cyclic subgroup of order 21. REDUNDANCY 2021: 97-100 - 2020
- [c4]Svetlana Topalova, Stela Zhelezova:
Some parallelisms of PG(3, 5) involving a definite type of spread. ACCT 2020: 1-5 - [c3]Svetlana Topalova, Stela Zhelezova:
Isomorphism and Invariants of Parallelisms of Projective Spaces. ICMS 2020: 162-172
2010 – 2019
- 2019
- [j18]Tsonka Baicheva, Svetlana Topalova:
Classification of optimal (v, k, 1) binary cyclically permutable constant weight codes with $$k=5, $$ k = 5 , 6 and 7 and small lengths. Des. Codes Cryptogr. 87(2-3): 365-374 (2019) - [j17]Svetlana Topalova, Stela Zhelezova:
Types of spreads and duality of the parallelisms of PG(3, 5) with automorphisms of order 13. Des. Codes Cryptogr. 87(2-3): 495-507 (2019) - [c2]Tsonka Baicheva, Svetlana Topalova:
On the Diffusion Property of the Improved Generalized Feistel with Different Permutations for Each Round. CAI 2019: 38-49 - [c1]Anton Betten, Svetlana Topalova, Stela Zhelezova:
Parallelisms of \mathrmPG(3, 4) Invariant Under Cyclic Groups of Order 4. CAI 2019: 88-99 - 2018
- [j16]Tsonka Stefanova Baicheva, Svetlana Topalova:
Classification of Strongly Conflict-Avoiding Codes. IEEE Commun. Lett. 22(12): 2415-2418 (2018) - 2017
- [j15]Tsonka Baicheva, Svetlana Topalova:
Classification of optimal conflict-avoiding codes of weights 6 and 7. Electron. Notes Discret. Math. 57: 9-14 (2017) - [j14]Svetlana Topalova, Stela Zhelezova:
New parallelisms of PG(3, 4). Electron. Notes Discret. Math. 57: 193-198 (2017) - [j13]Tsonka Stefanova Baicheva, Svetlana Topalova:
Optimal conflict-avoiding codes for 3, 4 and 5 active users. Probl. Inf. Transm. 53(1): 42-50 (2017) - 2015
- [j12]Svetlana Topalova, Stela Zhelezova:
On point-transitive and transitive deficiency one parallelisms of PG (3, 4). Des. Codes Cryptogr. 75(1): 9-19 (2015) - 2014
- [j11]Svetlana Topalova, Stela Zhelezova:
Doubly resolvable designs with small parameters. Ars Comb. 117: 289-302 (2014) - [j10]Ronald Shaw, Svetlana Topalova:
Book spreads in PG(7, 2). Discret. Math. 330: 76-86 (2014) - 2013
- [j9]Svetlana Topalova, Stela Zhelezova:
On transitive parallelisms of PG(3, 4). Appl. Algebra Eng. Commun. Comput. 24(3-4): 159-164 (2013) - [j8]Tsonka Stefanova Baicheva, Svetlana Topalova:
Optimal (v, 5, 2, 1) optical orthogonal codes of small v. Appl. Algebra Eng. Commun. Comput. 24(3-4): 165-177 (2013) - 2011
- [j7]Tsonka Baicheva, Svetlana Topalova:
Classification of optimal (v, 4, 1) binary cyclically permutable constant-weight codes and cyclic 2-(v, 4, 1) designs with v ≤ 76. Probl. Inf. Transm. 47(3): 224 (2011) - 2010
- [j6]Svetlana Topalova, Stela Zhelezova:
2-Spreads and Transitive and Orthogonal 2-Parallelisms of PG(5, 2). Graphs Comb. 26(5): 727-735 (2010)
2000 – 2009
- 2009
- [j5]Zlatka Mateva, Svetlana Topalova:
Hadamard 2-(63, 31, 15) designs invariant under the dihedral group of order 10. Discret. Math. 309(6): 1347-1356 (2009) - [p1]Svetlana Topalova, Stela Zhelezova:
Classification of Doubly Resolvable Designs and Orthogonal Resolutions. Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes 2009: 260-264 - 2008
- [j4]Petteri Kaski, Patric R. J. Östergård, Svetlana Topalova, Rosen Zlatarski:
Steiner triple systems of order 19 and 21 with subsystems of order 7. Discret. Math. 308(13): 2732-2741 (2008) - 2006
- [j3]Veerle Fack, Svetlana Topalova, Joost Winne, Rosen Zlatarski:
Enumeration of the doubles of the projective plane of order 4. Discret. Math. 306(18): 2141-2151 (2006) - 2003
- [j2]Svetlana Topalova:
Classification of Hadamard matrices of order 44 with automorphisms of order 7. Discret. Math. 260(1-3): 275-283 (2003)
1990 – 1999
- 1998
- [j1]Stoyan N. Kapralov, Svetlana Topalova:
Enumeration of 2-(21, 6, 3) Designs with Automorphisms of Order 7 or 5. Ars Comb. 48 (1998)
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-08-18 00:35 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:
