# Iliya Bouyukliev

According to our database

Collaborative distances:

^{1}, Iliya Bouyukliev authored at least 28 papers between 2000 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2017

S-Boxes from Binary Quasi-Cyclic Codes.

Electronic Notes in Discrete Mathematics, 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

Classification of Binary Self-Dual Codes of Length 40.

IEEE Trans. Information Theory, 2015

On the minimum length of linear codes over F5.

Discrete Mathematics, 2015

2013

Some extremal self-dual codes and unimodular lattices in dimension 40.

Finite Fields and Their Applications, 2013

Development of a personal bibliographic information system.

The Electronic Library, 2013

Foreword: computer algebra in coding theory and cryptography.

Appl. Algebra Eng. Commun. Comput., 2013

2012

An Algorithm for Classification of Binary Self-Dual Codes.

IEEE Trans. Information Theory, 2012

Construction of self-orthogonal codes from combinatorial designs.

Probl. Inf. Transm., 2012

2011

Results on Binary Linear Codes With Minimum Distance 8 and 10.

IEEE Trans. Information Theory, 2011

2010

Classification of the extremal formally self-dual even codes of length 30.

Adv. in Math. of Comm., 2010

On the least covering radius of binary linear codes of dimension 6.

Adv. in Math. of Comm., 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

Classification of Griesmer codes and dual transform.

Discrete Mathematics, 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

Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions.

IEEE Trans. Information Theory, 2008

A method for efficiently computing the number of codewords of fixed weights in linear codes.

Discrete Applied Mathematics, 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

Projective two-weight codes with small parameters and their corresponding graphs.

Des. Codes Cryptogr., 2006

On the binary projective codes with dimension 6.

Discrete Applied Mathematics, 2006

2005

Some results for linear binary codes with minimum distance 5 and 6.

IEEE Trans. Information Theory, 2005

SIAM J. Discrete Math., 2005

2004

New bounds for n4(

*k, d*) and classification of some optimal codes over GF(4).
Discrete Mathematics, 2004

2003

Some New Results on Optimal Codes Over F

^{5}.
Des. Codes Cryptogr., 2003

2002

Some new results for optimal ternary linear codes.

IEEE Trans. Information Theory, 2002

2001

Optimal binary linear codes of dimension at most seven.

Discrete Mathematics, 2001

2000

The smallest length of eight-dimensional binary linear codes with prescribed minimum distance.

IEEE Trans. Information Theory, 2000

Some bounds for the minimum length of binary linear codes of dimension nine.

IEEE Trans. Information Theory, 2000