Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Iliya Bouyukliev"'
Publikováno v:
Axioms, Vol 13, Iss 8, p 495 (2024)
In this paper, three discrete transforms related to vector spaces over finite fields are studied. For our purposes, and according to the properties of the finite fields, the most suitable transforms are as follows: for binary fields, this is the Wals
Externí odkaz:
https://doaj.org/article/97dfb821bbe549aebfc1766eadedb620
Publikováno v:
Algorithms, Vol 17, Iss 7, p 311 (2024)
In this work, we systematize several implementations of the Gray code over an alphabet with m≥2 elements, which we present in C code so that they can be used directly after copying from the text. We consider two variants—reflected and modular (or
Externí odkaz:
https://doaj.org/article/171e9f0aee06433e92d4a0bcf85ed740
Autor:
Stefka Bouyuklieva, Iliya Bouyukliev
Publikováno v:
Mathematics, Vol 12, Iss 2, p 328 (2024)
An algorithm for equivalence of linear codes over finite fields is presented. Its main advantage is that it can extract exactly one representative from each equivalence class among a large number of linear codes. It can also be used as a test for iso
Externí odkaz:
https://doaj.org/article/9d2a5aed2aec4521a8292954b3df6fda
Publikováno v:
Mathematics, Vol 11, Iss 24, p 4950 (2023)
Binary codes have a special place in coding theory since they are one of the most commonly used in practice. There are classes of codes specific only to the binary case. One such class is self-complementary codes. Self-complementary linear codes are
Externí odkaz:
https://doaj.org/article/a652407698b5498a986ccca3c9ab6131
Publikováno v:
Mathematics, Vol 11, Iss 8, p 1864 (2023)
In this paper, we present a library with sequential and parallel functions for computing some of the most important cryptographic characteristics of Boolean and vectorial Boolean functions. The library implements algorithms to calculate the nonlinear
Externí odkaz:
https://doaj.org/article/93b5f9d57f394ec0bee307899024bcf0
Publikováno v:
Mathematics, Vol 10, Iss 23, p 4588 (2022)
Bounds for the parameters of codes are very important in coding theory. The Grey–Rankin bound refers to the cardinality of a self-complementary binary code. Codes meeting this bound are associated with families of two-weight codes and other combina
Externí odkaz:
https://doaj.org/article/145a15c3c89b4e639588cc0853325b14
An Extension of the Brouwer–Zimmermann Algorithm for Calculating the Minimum Weight of a Linear Code
Autor:
Stefka Bouyuklieva, Iliya Bouyukliev
Publikováno v:
Mathematics, Vol 9, Iss 19, p 2354 (2021)
A modification of the Brouwer–Zimmermann algorithm for calculating the minimum weight of a linear code over a finite field is presented. The aim was to reduce the number of codewords for consideration. The reduction is significant in cases where th
Externí odkaz:
https://doaj.org/article/edd400138a95425ea80f28b96bc97ee7
Publikováno v:
Mathematics, Vol 8, Iss 3, p 320 (2020)
Using an exhaustive computer search, we prove that the number of inequivalent ( 29 , 5 ) -arcs in PG ( 2 , 7 ) is exactly 22. This generalizes a result of Barlotti (see Barlotti, A. Some Topics in Finite Geometrical Structures, 1965), who constructed
Externí odkaz:
https://doaj.org/article/db3ab1086b4343baaff35065566e58e5
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AE,..., Iss Proceedings (2005)
Before this work, at least 762 inequivalent Hadamard matrices of order 36 were known. We found 7238 Hadamard matrices of order 36 and 522 inequivalent [72,36,12] double-even self-dual codes which are obtained from all 2-(35,17,8) designs with an auto
Externí odkaz:
https://doaj.org/article/da072b8b100745e894bd1669388071e4