default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRumen N. Daskalov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
Journal Articles
- 2017
[j24]Rumen N. Daskalov
, Mladen M. Dordevic:
A new (37, 3)-arc in PG(2, 23). Electron. Notes Discret. Math. 57: 97-102 (2017)- [j23]Rumen N. Daskalov, Elena Metodieva:
Improved lower bounds on mr(2, 29). Electron. Notes Discret. Math. 57: 103-108 (2017) - [j22]Rumen N. Daskalov, Elena Metodieva:
Some new (n, r)-arcs in PG(2, 31). Electron. Notes Discret. Math. 57: 109-114 (2017) - 2011
- [j21]Rumen N. Daskalov, Elena Metodieva:
New (n, r)-arcs in PG(2, 17), PG(2, 19), and PG(2, 23). Probl. Inf. Transm. 47(3): 217 (2011) - 2008
- [j20]Rumen N. Daskalov:
On the maximum size of some (k, r)-arcs in PG(2, q). Discret. Math. 308(4): 565-570 (2008) - [j19]Rumen N. Daskalov:
A geometric construction of a (38, 2)-blocking set in PG(2, 13) and the related [145, 3, 133]13 code. Discret. Math. 308(7): 1341-1345 (2008) - 2007
- [j18]Rumen N. Daskalov:
Some high-rate linear codes over GF(5) and GF(7). Probl. Inf. Transm. 43(2): 124-131 (2007) - 2004
- [j17]Rumen N. Daskalov, Plamen Hristov, Elena Metodieva:
New minimum distance bounds for linear codes over GF(5). Discret. Math. 275(1-3): 97-110 (2004) - [j16]Rumen N. Daskalov, Elena Metodieva:
The nonexistence of ternary [105, 6, 68] and [230, 6, 152] codes. Discret. Math. 286(3): 225-232 (2004) - [j15]Rumen N. Daskalov, Elena Metodieva, Plamen Hristov:
New Minimum Distance Bounds for Linear Codes over GF(9). Probl. Inf. Transm. 40(1): 13-24 (2004) - [j14]Rumen N. Daskalov, Elena Metodieva:
The Nonexistence of Ternary [284, 6, 188] Codes. Probl. Inf. Transm. 40(2): 135-146 (2004) - 2003
- [j13]Rumen N. Daskalov, Plamen Hristov:
New Quasi-cyclic Degenerate Linear Codes over GF(8). Probl. Inf. Transm. 39(2): 184-190 (2003) - [j12]Rumen N. Daskalov, Plamen Hristov:
New quasi-twisted degenerate ternary linear codes. IEEE Trans. Inf. Theory 49(9): 2259-2263 (2003) - [j11]Rumen N. Daskalov, Plamen Hristov:
New binary one-generator quasi-cyclic codes. IEEE Trans. Inf. Theory 49(11): 3001-3005 (2003) - 2002
- [j10]Rumen N. Daskalov, Plamen Hristov:
New One-Generator Quasi-cyclic Codes over GF(7). Probl. Inf. Transm. 38(1): 50-54 (2002) - 2001
- [j9]Rumen N. Daskalov:
Some nonexistence results for 7-dimensional ternary linear codes. Ars Comb. 59 (2001) - [j8]Rumen N. Daskalov, T. Aaron Gulliver:
New Minimum Distance Bounds for Linear Codes over Small Fields. Probl. Inf. Transm. 37(3): 206-215 (2001) - 2000
- [j7]Rumen N. Daskalov, T. Aaron Gulliver:
New quasi-twisted quaternary linear codes. IEEE Trans. Inf. Theory 46(7): 2642-2643 (2000) - 1999
- [j6]Rumen N. Daskalov, T. Aaron Gulliver:
Bounds on Minimum Distance for Linear Codes over GF(5). Appl. Algebra Eng. Commun. Comput. 9(6): 547-558 (1999) - [j5]Rumen N. Daskalov, T. Aaron Gulliver, Elena Metodieva:
New ternary linear codes. IEEE Trans. Inf. Theory 45(5): 1687-1688 (1999) - 1997
- [j4]Rumen N. Daskalov, T. Aaron Gulliver:
New good quasi-cyclic ternary and quaternary linear codes. IEEE Trans. Inf. Theory 43(5): 1647-1650 (1997) - 1996
- [j3]Iliya G. Bouyukliev, Rumen N. Daskalov, Stoyan N. Kapralov:
Optimal quaternary linear codes of dimension five. IEEE Trans. Inf. Theory 42(4): 1228-1235 (1996) - 1995
- [j2]Rumen N. Daskalov, Elena Metodieva:
The nonexistence of some five-dimensional quaternary linear codes. IEEE Trans. Inf. Theory 41(2): 581-583 (1995) - 1992
- [j1]Rumen N. Daskalov, Stoyan N. Kapralov:
New minimum distance bounds for certain binary linear codes. IEEE Trans. Inf. Theory 38(6): 1795-1796 (1992)
Conference and Workshop Papers
- 2020
- [c2]Rumen N. Daskalov, Elena Metodieva:
Three new large (n, r) arcs in PG(2, 31). ACCT 2020: 1-4 - [c1]Rumen N. Daskalov, Elena Metodieva:
New QC Codes over GF(11). ACCT 2020: 1-4
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-10-07 21:21 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
