We stand with Ukraine  

Rumen N. Daskalov

Orcid: 0000-0001-7441-4757

According to our database1, Rumen N. Daskalov authored at least 26 papers between 1992 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
New QC Codes over GF(11).
[BibTeX]
[DOI]
Rumen N. Daskalov
,
Elena Metodieva
Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

Three new large (n, r) arcs in PG(2, 31).
[BibTeX]
[DOI]
Rumen N. Daskalov
,
Elena Metodieva
Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

2017
Some new (n, r)-arcs in PG(2, 31).
[BibTeX]
[DOI]
Rumen N. Daskalov
,
Elena Metodieva
Electron. Notes Discret. Math., 2017

Improved lower bounds on m<sub>r</sub>(2, 29).
[BibTeX]
[DOI]
Rumen N. Daskalov
,
Elena Metodieva
Electron. Notes Discret. Math., 2017

A new (37, 3)-arc in PG(2, 23).
[BibTeX]
[DOI]
Rumen N. Daskalov
,
Mladen M. Dordevic
Electron. Notes Discret. Math., 2017

2011
New (<i>n, r</i>)-arcs in PG(2, 17), PG(2, 19), and PG(2, 23).
[BibTeX]
[DOI]
Rumen N. Daskalov
,
Elena Metodieva
Probl. Inf. Transm., 2011

2008
A geometric construction of a (38, 2)-blocking set in PG(2, 13) and the related [145, 3, 133]<sub>13</sub> code.
[BibTeX]
[DOI]
Rumen N. Daskalov
Discret. Math., 2008

On the maximum size of some (k, r)-arcs in PG(2, q).
[BibTeX]
[DOI]
Rumen N. Daskalov
Discret. Math., 2008

2007
Some high-rate linear codes over <i>GF</i>(5) and <i>GF</i>(7).
[BibTeX]
[DOI]
Rumen N. Daskalov
Probl. Inf. Transm., 2007

2004
New Minimum Distance Bounds for Linear Codes over <i>GF</i>(9).
[BibTeX]
[DOI]
Rumen N. Daskalov
,
Elena Metodieva
,
Plamen Hristov
Probl. Inf. Transm., 2004

The Nonexistence of Ternary [284, 6, 188] Codes.
[BibTeX]
[DOI]
Rumen N. Daskalov
,
Elena Metodieva
Probl. Inf. Transm., 2004

The nonexistence of ternary [105, 6, 68] and [230, 6, 152] codes.
[BibTeX]
[DOI]
Rumen N. Daskalov
,
Elena Metodieva
Discret. Math., 2004

New minimum distance bounds for linear codes over GF(5).
[BibTeX]
[DOI]
Rumen N. Daskalov
,
Plamen Hristov
,
Elena Metodieva
Discret. Math., 2004

2003
New binary one-generator quasi-cyclic codes.
[BibTeX]
[DOI]
Rumen N. Daskalov
,
Plamen Hristov
IEEE Trans. Inf. Theory, 2003

New quasi-twisted degenerate ternary linear codes.
[BibTeX]
[DOI]
Rumen N. Daskalov
,
Plamen Hristov
IEEE Trans. Inf. Theory, 2003

New Quasi-cyclic Degenerate Linear Codes over <i>GF</i>(8).
[BibTeX]
[DOI]
Rumen N. Daskalov
,
Plamen Hristov
Probl. Inf. Transm., 2003

2002
New One-Generator Quasi-cyclic Codes over GF(7).
[BibTeX]
[DOI]
Rumen N. Daskalov
,
Plamen Hristov
Probl. Inf. Transm., 2002

2001
New Minimum Distance Bounds for Linear Codes over Small Fields.
[BibTeX]
[DOI]
Rumen N. Daskalov
,
T. Aaron Gulliver
Probl. Inf. Transm., 2001

Some nonexistence results for 7-dimensional ternary linear codes.
[BibTeX]
Rumen N. Daskalov
Ars Comb., 2001

2000
New quasi-twisted quaternary linear codes.
[BibTeX]
[DOI]
Rumen N. Daskalov
,
T. Aaron Gulliver
IEEE Trans. Inf. Theory, 2000

1999
New ternary linear codes.
[BibTeX]
[DOI]
Rumen N. Daskalov
,
T. Aaron Gulliver
,
Elena Metodieva
IEEE Trans. Inf. Theory, 1999

Bounds on Minimum Distance for Linear Codes over GF(5).
[BibTeX]
[DOI]
Rumen N. Daskalov
,
T. Aaron Gulliver
Appl. Algebra Eng. Commun. Comput., 1999

1997
New good quasi-cyclic ternary and quaternary linear codes.
[BibTeX]
[DOI]
Rumen N. Daskalov
,
T. Aaron Gulliver
IEEE Trans. Inf. Theory, 1997

1996
Optimal quaternary linear codes of dimension five.
[BibTeX]
[DOI]
Iliya G. Bouyukliev
,
Rumen N. Daskalov
,
Stoyan N. Kapralov
IEEE Trans. Inf. Theory, 1996

1995
The nonexistence of some five-dimensional quaternary linear codes.
[BibTeX]
[DOI]
Rumen N. Daskalov
,
Elena Metodieva
IEEE Trans. Inf. Theory, 1995

1992
New minimum distance bounds for certain binary linear codes.
[BibTeX]
[DOI]
Rumen N. Daskalov
,
Stoyan N. Kapralov
IEEE Trans. Inf. Theory, 1992


  Loading...