Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Svetlana Topalova"'
Autor:
Svetlana Topalova, Stela Zhelezova
Publikováno v:
Mathematics, Vol 11, Iss 11, p 2458 (2023)
Consider the n-dimensional projective space PG(n,q) over a finite field with q elements. A spread in PG(n,q) is a set of lines which partition the point set. A parallelism is a partition of the set of lines by spreads. A deficiency one parallelism is
Externí odkaz:
https://doaj.org/article/68d323ff2d69434da3687408866bfb1c
Autor:
Tsonka Baicheva, Svetlana Topalova
Publikováno v:
Mathematics, Vol 11, Iss 11, p 2457 (2023)
Optical orthogonal codes (OOCs) are used in optical code division multiple access systems to allow a large number of users to communicate simultaneously with a low error probability. The number of simultaneous users is at most as big as the number of
Externí odkaz:
https://doaj.org/article/82377febed984c56b2aff9e0e9dbca33
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AE,..., Iss Proceedings (2005)
A double $2$-$(v,k,2 \lambda)$ design is a design which is reducible into two $2$-$(v,k,\lambda)$ designs. It is called uniquely reducible if it has, up to equivalence, only one reduction. We present properties of uniquely reducible double designs wh
Externí odkaz:
https://doaj.org/article/31dcfc60467a42d69f98bd79f74424d3
Publikováno v:
Applicable Algebra in Engineering, Communication and Computing. 33:649-674
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f35a50bdba0610151c69cf1f53b47f9
https://doi.org/10.1007/s00200-022-00562-7
https://doi.org/10.1007/s00200-022-00562-7
Autor:
Stela Zhelezova, Svetlana Topalova
Publikováno v:
2021 XVII International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY).
A spread in PG(n, q) is a set of lines such that each point is in exactly one line. A parallelism is a partition of the set of lines of PG(n, q) to spreads. The construction of spreads and parallelisms is motivated by their various relations and appl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0db1a2f8115a34399d071b9f37ff6b18
https://doi.org/10.1109/redundancy52534.2021.9606469
https://doi.org/10.1109/redundancy52534.2021.9606469
Autor:
Stela Zhelezova, Svetlana Topalova
Publikováno v:
Computer Algebra in Scientific Computing ISBN: 9783030851644
CASC
CASC
Let \(\mathrm{PG}(n,q)\) be the n-dimensional projective space over the finite field \({\mathbb F}_q\). A spread in \(\mathrm{PG}(n,q)\) is a set of lines which partition the point set. A partition of the lines of the projective space by spreads is c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2884e2e21b5e1994b6163a01cda593bf
https://doi.org/10.1007/978-3-030-85165-1_23
https://doi.org/10.1007/978-3-030-85165-1_23
Autor:
Stela Zhelezova, Svetlana Topalova
Publikováno v:
Trends in Mathematics ISBN: 9783030838225
We construct all parallelisms of \(\mathrm{PG}(3,5)\) that are invariant under an automorphism group of order 25. Up to isomorphism their number is 14873. Using them we obtain 12 transitive deficiency one parallelisms, two of which belong to an infin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9f2a9f317606a38bd5f702164ff7d48
https://doi.org/10.1007/978-3-030-83823-2_107
https://doi.org/10.1007/978-3-030-83823-2_107
Autor:
Stela Zhelezova, Svetlana Topalova
Publikováno v:
ACCT
There are 372 parallelisms of PG(3,5) which have been explicitly constructed and studied before the present paper. They contain all but one of the 21 nonisomorphic spreads of this projective space. It was not known by now if that particular spread ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e40e84819c371994d66852dd0cbcc63a
https://doi.org/10.1109/acct51235.2020.9383404
https://doi.org/10.1109/acct51235.2020.9383404
Autor:
Stela Zhelezova, Svetlana Topalova
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030521998
ICMS
ICMS
We consider the computer-aided constructive classification of parallelisms with predefined automorphism groups in small finite projective spaces. The usage of a backtrack search algorithm makes it very important to filter away equivalent partial solu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a65cff1ab56792f2641f341c08e8d8aa
https://doi.org/10.1007/978-3-030-52200-1_16
https://doi.org/10.1007/978-3-030-52200-1_16
Autor:
Tsonka Baicheva, Svetlana Topalova
Publikováno v:
Advances in Mathematics of Communications. 16:95
We consider the Improved Generalized Feistel Structure (IGFS) suggested by Suzaki and Minematsu (LNCS, 2010). It is a generalization of the classical Feistel cipher. The message is divided into \begin{document}$ k $\end{document} subblocks, a Feistel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e59e973932d1f6de4dcc7024a94f78d
https://doi.org/10.3934/amc.2020102
https://doi.org/10.3934/amc.2020102