49 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Bulgarian Academy of SciencesBG6 papers
- Institute of Mathematics and InformaticsBG4 papers
- Otto-von-Guericke-Universität MagdeburgDE3 papers
- Shumen UniversityBG2 papers
- Japan Science and Technology AgencyJP1 paper
- Medical University PlovdivBG1 paper
- Osaka Prefecture UniversityJP1 paper
- Pohang University of Science and TechnologyKR1 paper
- Sogang UniversityKR1 paper
- Universidad del NorteCO1 paper
- University of BayreuthDE1 paper
- University of LouisvilleUS1 paper
20 papers
Pingmark: A Textual Protocol for Universal Spatial Mentions
Kalin Dimitrov
Pingmark defines a universal textual protocol for expressing spatial context through a minimal symbol: !@. Rather than embedding coordinates or using proprietary map links, Pingmar…
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…
About the Study of the -dimensional Boolean Cube in the Bachelor's Programs in Computer Science
Valentin Bakoev
Here we present our arguments for a more in-depth study of the Boolean cube, which is one of the most important discrete structures. The article contains a case study that analyses…
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…
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…
CRC selection for decoding of CRC-polar concatenated codes
Tsonka Baicheva, Peter Kazakov
An efficient scheme to increase the performance of polar codes at short and moderate block lengths is a concatenation of CRC code and a polar code. In order to obtain better result…
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…
Fast Computing the Algebraic Degree of Boolean Functions
Valentin Bakoev
Here we consider an approach for fast computing the algebraic degree of Boolean functions. It combines fast computing the ANF (known as ANF transform) and thereafter the algebraic…
Combinatorial and Algorithmic Properties of One Matrix Structure at Monotone Boolean Functions
Valentin Bakoev
One matrix structure in the area of monotone Boolean functions is defined here. Some of its combinatorial, algebraic and algorithmic properties are derived. On the base of these pr…
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…
Slant null curves on normal almost contact B-metric 3-manifolds with parallel Reeb vector field
Galia Nakova, Hristo Manev
In this paper we study slant null curves with respect to the original parameter on 3-dimensional normal almost contact B-metric manifolds with parallel Reeb vector field. We prove…
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…
Radical transversal lightlike hypersurfaces of almost complex manifolds with Norden metric
Galia Nakova
In this paper we introduce radical transversal lightlike hypersurfaces of almost complex manifolds with Norden metric. The study of these hypersurfaces is motivated by the fact tha…
On the convergence of the Metropolis-Hastings Markov chains
Dimiter Tsvetkov, Lyubomir Hristov, Ralitsa Angelova-Slavova
In this paper we study Markov chains associated with the Metropolis-Hastings algorithm. We consider conditions under which the sequence of the successive densities of such a chain…
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…
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,…
Some lightlike submanifolds of almost complex manifolds with Norden metric
Galia Nakova
In this paper we study submanifolds of an almost complex manifold with Norden metric which are non-degenerate with respect to the one Norden metric and lightlike with respect to th…
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…
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…
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.