2 citations · 4 across the 4 of their papers we have counts for
5 papers
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…
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…
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.
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…
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…