Iliya Bouyukliev

Orcid: 0000-0002-6730-1129

Affiliations:
  • 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:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Matrix Factorization and Some Fast Discrete Transforms.
Axioms, August, 2024

Generating m-Ary Gray Codes and Related Algorithms.
Algorithms, July, 2024

Enumeration of linear codes with different hulls.
CoRR, 2024

Dual transform and projective self-dual codes.
Adv. Math. Commun., 2024

2023
About Methods of Vector Addition over Finite Fields Using Extended Vector Registers.
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

About Code Equivalence - a Geometric Approach.
CoRR, 2022

2021
Computer Classification of Linear Codes.
IEEE Trans. Inf. Theory, 2021

Characteristic vector and weight distribution of a linear code.
Cryptogr. Commun., 2021

2020
Classification of Linear Codes by Extending Their Residuals.
Proceedings of the Mathematical Software - ICMS 2020, 2020

The Program Generation in the Software Package QextNewEdition.
Proceedings of the Mathematical Software - ICMS 2020, 2020

A Parallel Algorithm for Computing the Weight Spectrum of Binary Linear Codes.
Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

On the Formally Self-Dual Binary [30, 15, 8] Codes.
Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

2019
Classification of linear codes using canonical augmentation.
CoRR, 2019

2018
On the Computation of the Weight Distribution of Linear Codes over Finite Fields.
CoRR, 2018

2017
S-Boxes from Binary Quasi-Cyclic Codes.
Electron. Notes Discret. Math., 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. Inf. Theory, 2015

On the minimum length of linear codes over F5.
Discret. Math., 2015

2013
Some extremal self-dual codes and unimodular lattices in dimension 40.
Finite Fields Their Appl., 2013

Development of a personal bibliographic information system.
Electron. Libr., 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. Inf. 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. Inf. Theory, 2011

On the Classification of Binary Self-Dual Codes
CoRR, 2011

2010
Results on Binary Linear Codes With Minimum Distance 8 and 10
CoRR, 2010

Classification of the extremal formally self-dual even codes of length 30.
Adv. Math. Commun., 2010

On the least covering radius of binary linear codes of dimension 6.
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
Classification of Griesmer codes and dual transform.
Discret. Math., 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. 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
Projective two-weight codes with small parameters and their corresponding graphs.
Des. Codes Cryptogr., 2006

On the binary projective codes with dimension 6.
Discret. Appl. Math., 2006

2005
Some results for linear binary codes with minimum distance 5 and 6.
IEEE Trans. Inf. Theory, 2005

Classification of Self-Orthogonal Codes over F<sub>3</sub> and F<sub>4</sub>.
SIAM J. Discret. Math., 2005

2004
New bounds for n4(<i>k, d</i>) and classification of some optimal codes over GF(4).
Discret. Math., 2004

2003
Some New Results on Optimal Codes Over F<sup>5</sup>.
Des. Codes Cryptogr., 2003

2002
Some new results for optimal ternary linear codes.
IEEE Trans. Inf. Theory, 2002

2001
Optimal binary linear codes of dimension at most seven.
Discret. Math., 2001

2000
The smallest length of eight-dimensional binary linear codes with prescribed minimum distance.
IEEE Trans. Inf. Theory, 2000

Some bounds for the minimum length of binary linear codes of dimension nine.
IEEE Trans. Inf. Theory, 2000

1998
Extremal Self-Dual Codes with an Automorphism of Order 2.
IEEE Trans. Inf. Theory, 1998

Some New Extremal Self-Dual Codes with Lengths 44, 50, 54, and 58.
IEEE Trans. Inf. Theory, 1998

1997
Optimal linear codes of dimension 4 over F<sub>5</sub>.
IEEE Trans. Inf. Theory, 1997

On the [162, 8, 80] codes.
IEEE Trans. Inf. Theory, 1997

New bounds for the minimum length of quaternary linear codes of dimension five.
Discret. Math., 1997

Some New Optimal Ternary Linear Codes.
Des. Codes Cryptogr., 1997

1996
Optimal quaternary linear codes of dimension five.
IEEE Trans. Inf. Theory, 1996


  Loading...