29 citations · 81 across the 10 of their papers we have counts for
10 papers
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…
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…
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…
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…
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…
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…
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.
Results on Binary Linear Codes With Minimum Distance 8 and 10
Iliya Bouyukliev, Erik Jakobsson
All codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33…
Binary and Ternary Quasi-perfect Codes with Small Dimensions
Tsonka Baicheva, Iliya Bouyukliev, Stefan Dodunekov +1
The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete cla…