activity
20112024
most citedOptimal Binary LCD Codes

49 citations · 129 across the 16 of their papers we have counts for

collaborators

17 papers

cs.IT2024

Sequence of Numbers of Linear Codes with Increasing Hull Dimensions

Stefka Bouyuklieva, Iliya Bouyukliev, Ferruh Özbudak

The hull of a linear code is the intersection of with its dual code. We present and analyze the number of linear -ary codes of the same length and dimension but with dif…

cs.IT2023

On the Structure of the Linear Codes with a Given Automorphism

Stefka Bouyuklieva

The purpose of this paper is to present the structure of the linear codes over a finite field with q elements that have a permutation automorphism of order m. These codes can be co…

cs.IT2022★ 1 cited

An Algorithm for Computing the Covering Radius of a Linear Code Based on Vilenkin-Chrestenson Transform

Paskal Piperkov, Iliya Bouyukliev, Stefka Bouyuklieva

We present a generalization of Walsh-Hadamard transform that is suitable for applications in Coding Theory, especially for computation of the weight distribution and the covering r…

cs.DM2022★ 1 cited

About Code Equivalence -- a Geometric Approach

Iliya Bouyukliev, Stefka Bouyuklieva

The equivalence test is a main part in any classification problem. It helps to prove bounds for the main parameters of the considered combinatorial structures and to study their pr…

cs.IT2021

On the Structure of the Binary LCD Codes having an Automorphism of Odd Prime Order

Stefka Bouyuklieva, Javier de la Cruz

The aim of this work is to study the structure and properties of the binary LCD codes having an automorphisms of odd prime order and to present a method for their construction.

cs.IT2020★ 49 cited

Optimal Binary LCD Codes

Stefka Bouyuklieva

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. These codes were first introduced by Massey in…

cs.IT2020★ 25 cited

Computer classification of linear codes

Iliya Bouyukliev, Stefka Bouyuklieva, Sascha Kurz

We present algorithms for classification of linear codes over finite fields, based on canonical augmentation and on lattice point enumeration. We apply these algorithms to obtain c…

cs.DM2019★ 2 cited

Classification of linear codes using canonical augmentation

Iliya Bouyukliev, Stefka Bouyuklieva

We propose an algorithm for classification of linear codes over different finite fields based on canonical augmentation. We apply this algorithm to obtain classification results ov…

cs.DM2018★ 5 cited

Characteristic vector and weight distribution of a linear code

Iliya Bouyukliev, Stefka Bouyuklieva, Tatsuya Maruta +1

We develop an algorithm for computing the weight distribution of a linear code over a finite field . We represent the codes by their characteristic vector wit…

math.CO2017

Nonexistence of certain singly even self-dual codes with minimal shadow

Stefka Bouyuklieva, Masaaki Harada, Akihiro Munemasa

It is known that there is no extremal singly even self-dual code with minimal shadow for , , , and $(24m…

cs.IT2014★ 3 cited

On the Automorphisms of Order 15 for a Binary Self-Dual [96, 48, 20] Code

Stefka Bouyuklieva, Wolfgang Willems, Nikolay Yankov

The structure of binary self-dual codes invariant under the action of a cyclic group of order for odd primes is considered. As an application we prove the nonexisten…

math.CO2012★ 5 cited

On the Automorphism Group of a Binary Self-dual [120, 60, 24] Code

Stefka Bouyuklieva, Javier de la Cruz, Wolfgang Willems

We prove that an automorphism of order 3 of a putative binary self-dual [120, 60, 24] code C has no fixed points. Moreover, the order of the automorphism group of C divides 2^a.3.5…

cs.IT2012★ 1 cited

Classification of Binary Self-Dual [48,24,10] Codes with an Automorphism of Odd Prime Order

Stefka Bouyuklieva, Nikolay Yankov, Jon-Lark Kim

The purpose of this paper is to complete the classification of binary self-dual [48,24,10] codes with an automorphism of odd prime order. We prove that if there is a self-dual [48,…

math.CO2011

Some Extremal Self-Dual Codes and Unimodular Lattices in Dimension 40

Stefka Bouyuklieva, Iliya Bouyukliev, Masaaki Harada

In this paper, binary extremal singly even self-dual codes of length 40 and extremal odd unimodular lattices in dimension 40 are studied. We give a classification of extremal singl…

math.CO2011★ 1 cited

On the classification of binary self-dual [44,22,8] codes with an automorphism of order 3 or 7

Stefka Bouyuklieva, Nikolay Yankov, Radka Russeva

All binary self-dual [44,22,8] codes with an automorphism of order 3 or 7 are classified. In this way we complete the classification of extremal self-dual codes of length 44 having…

math.CO2011★ 7 cited

Singly-even self-dual codes with minimal shadow

Stefka Bouyuklieva, Wolfgang Willems

In this note we investigate extremal singly-even self-dual codes with minimal shadow. For particular parameters we prove non-existence of such codes. By a result of Rains \cite{Rai…

math.CO2011★ 29 cited

An Algorithm for Classification of Binary Self-Dual Codes

Stefka Bouyuklieva, Iliya Bouyukliev

An efficient algorithm for classification of binary self-dual codes is presented. As an application, a complete classification of the self-dual codes of length 38 is given.