Iliya Bouyukliev
Orcid: 0000-0002-6730-1129Affiliations:
- Bulgarian Academy of Sciences, Institute of Mathematics and Informatics
According to our database1,
Iliya Bouyukliev
authored at least 52 papers
between 1996 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on math.bas.bg
On csauthors.net:
Bibliography
2024
2023
Proceedings of the Large-Scale Scientific Computations - 14th International Conference, 2023
2022
An Algorithm for Computing the Covering Radius of a Linear Code Based on Vilenkin-Chrestenson Transform.
CoRR, 2022
2021
Cryptogr. Commun., 2021
2020
Proceedings of the Mathematical Software - ICMS 2020, 2020
Proceedings of the Mathematical Software - ICMS 2020, 2020
Proceedings of the Algebraic and Combinatorial Coding Theory, 2020
Proceedings of the Algebraic and Combinatorial Coding Theory, 2020
2019
2018
CoRR, 2018
2017
Parallel Fast Möbius (Reed-Muller) Transform and its Implementation with CUDA on GPUs.
Proceedings of the International Workshop on Parallel Symbolic Computation, 2017
2015
2013
Finite Fields Their Appl., 2013
Appl. Algebra Eng. Commun. Comput., 2013
2012
IEEE Trans. Inf. Theory, 2012
Probl. Inf. Transm., 2012
2011
IEEE Trans. Inf. Theory, 2011
2010
Adv. Math. Commun., 2010
Adv. Math. Commun., 2010
Experimental results for two implementations of a probabilistic algorithm for minimum distance of linear codes.
Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing, 2010
2009
2-(31, 15, 7), 2-(35, 17, 8) and 2-(36, 15, 6) designs with automorphisms of odd prime order, and their related Hadamard matrices and codes.
Des. Codes Cryptogr., 2009
2008
IEEE Trans. Inf. Theory, 2008
A method for efficiently computing the number of codewords of fixed weights in linear codes.
Discret. Appl. Math., 2008
2007
On binary self-complementary [120, 9, 56] codes having an automorphism of order 3 and associated SDP designs.
Probl. Inf. Transm., 2007
2006
Des. Codes Cryptogr., 2006
2005
IEEE Trans. Inf. Theory, 2005
SIAM J. Discret. Math., 2005
2004
Discret. Math., 2004
2003
2002
2001
2000
The smallest length of eight-dimensional binary linear codes with prescribed minimum distance.
IEEE Trans. Inf. Theory, 2000
IEEE Trans. Inf. Theory, 2000
1998
IEEE Trans. Inf. Theory, 1998
IEEE Trans. Inf. Theory, 1998
1997
IEEE Trans. Inf. Theory, 1997
Discret. Math., 1997
1996