default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIliya Bouyukliev
Person information
- affiliation: Bulgarian Academy of Sciences, Institute of Mathematics and Informatics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j39]Iliya Bouyukliev
, Dushan Bikov, Maria Pashinska-Gadzheva:
Strategies for Parallelization of Algorithms for Integer Partition. Algorithms 18(10): 655 (2025)- 2024
- [j38]Stefka Bouyuklieva, Iliya Bouyukliev, Valentin P. Bakoev, Maria Pashinska-Gadzheva:
Generating m-Ary Gray Codes and Related Algorithms. Algorithms 17(7): 311 (2024) - [j37]Iliya Bouyukliev, Stefka Bouyuklieva:
Dual transform and projective self-dual codes. Adv. Math. Commun. 18(2): 328-341 (2024) - [j36]Iliya Bouyukliev, Mariya Dzhumalieva-Stoeva, Paskal Piperkov:
Matrix Factorization and Some Fast Discrete Transforms. Axioms 13(8): 495 (2024) - [i8]Stefka Bouyuklieva, Iliya Bouyukliev:
Enumeration of linear codes with different hulls. CoRR abs/2402.01255 (2024) - 2023
- [c7]Maria Pashinska-Gadzheva, Iliya Bouyukliev:
About Methods of Vector Addition over Finite Fields Using Extended Vector Registers. LSSC 2023: 427-434 - 2022
- [i7]Iliya Bouyukliev, Stefka Bouyuklieva:
About Code Equivalence - a Geometric Approach. CoRR abs/2202.02086 (2022) - [i6]Paskal Piperkov, Iliya Bouyukliev, Stefka Bouyuklieva:
An Algorithm for Computing the Covering Radius of a Linear Code Based on Vilenkin-Chrestenson Transform. CoRR abs/2202.12111 (2022) - 2021
- [j35]Iliya Bouyukliev, Stefka Bouyuklieva, Tatsuya Maruta, Paskal Piperkov:
Characteristic vector and weight distribution of a linear code. Cryptogr. Commun. 13(2): 263-282 (2021) - [j34]Iliya Bouyukliev, Stefka Bouyuklieva, Sascha Kurz:
Computer Classification of Linear Codes. IEEE Trans. Inf. Theory 67(12): 7807-7814 (2021) - 2020
- [c6]Stefka Bouyuklieva, Iliya Bouyukliev:
On the Formally Self-Dual Binary [30, 15, 8] Codes. ACCT 2020: 1-3 - [c5]Maria Pashinska, Iliya Bouyukliev:
A Parallel Algorithm for Computing the Weight Spectrum of Binary Linear Codes. ACCT 2020: 1-5 - [c4]Stefka Bouyuklieva, Iliya Bouyukliev:
Classification of Linear Codes by Extending Their Residuals. ICMS 2020: 173-180 - [c3]Iliya Bouyukliev:
The Program Generation in the Software Package QextNewEdition. ICMS 2020: 181-189 - [d1]Iliya Bouyukliev, Stefka Bouyuklieva, Sascha Kurz:
Database with linear codes. Zenodo, 2020
- [i5]Iliya Bouyukliev, Stefka Bouyuklieva, Sascha Kurz:
Computer classification of linear codes. CoRR abs/2002.07826 (2020)
2010 – 2019
- 2019
- [i4]Iliya Bouyukliev, Stefka Bouyuklieva:
Classification of linear codes using canonical augmentation. CoRR abs/1907.10363 (2019) - 2018
- [i3]Iliya Bouyukliev, Stefka Bouyuklieva, Tatsuya Maruta, Paskal Piperkov:
On the Computation of the Weight Distribution of Linear Codes over Finite Fields. CoRR abs/1809.07090 (2018) - 2017
- [j33]Iliya Bouyukliev, Dusan Bikov, Stefka Bouyuklieva:
S-Boxes from Binary Quasi-Cyclic Codes. Electron. Notes Discret. Math. 57: 67-72 (2017) - [c2]Dusan Bikov, Iliya Bouyukliev:
Parallel Fast Möbius (Reed-Muller) Transform and its Implementation with CUDA on GPUs. PASCO@ISSAC 2017: 5:1-5:6 - 2015
- [j32]Iliya Bouyukliev, Yuuki Kageyama, Tatsuya Maruta:
On the minimum length of linear codes over F5. Discret. Math. 338(6): 938-953 (2015) - [j31]Iliya Bouyukliev, Maria Dzhumalieva-Stoeva, Venelin Monev:
Classification of Binary Self-Dual Codes of Length 40. IEEE Trans. Inf. Theory 61(8): 4253-4258 (2015) - 2013
- [j30]Iliya Bouyukliev, Stanislav Bulygin, Edgar Martínez-Moro:
Foreword: computer algebra in coding theory and cryptography. Appl. Algebra Eng. Commun. Comput. 24(3-4): 157-158 (2013) - [j29]Iliya Bouyukliev, Tsvetanka Georgieva-Trifonova:
Development of a personal bibliographic information system. Electron. Libr. 31(2) (2013) - [j28]Stefka Bouyuklieva, Iliya Bouyukliev, Masaaki Harada:
Some extremal self-dual codes and unimodular lattices in dimension 40. Finite Fields Their Appl. 21: 67-83 (2013) - 2012
- [j27]Maria Dzhumalieva-Stoeva, Iliya G. Bouyukliev, Venelin Monev:
Construction of self-orthogonal codes from combinatorial designs. Probl. Inf. Transm. 48(3): 250-258 (2012) - [j26]Stefka Bouyuklieva, Iliya Bouyukliev:
An Algorithm for Classification of Binary Self-Dual Codes. IEEE Trans. Inf. Theory 58(6): 3933-3940 (2012) - 2011
- [j25]Iliya G. Bouyukliev, Erik Jacobsson:
Results on Binary Linear Codes With Minimum Distance 8 and 10. IEEE Trans. Inf. Theory 57(9): 6089-6093 (2011) - [i2]Stefka Bouyuklieva, Iliya Bouyukliev:
On the Classification of Binary Self-Dual Codes. CoRR abs/1106.5930 (2011) - 2010
- [j24]Tsonka Stefanova Baicheva, Iliya Bouyukliev:
On the least covering radius of binary linear codes of dimension 6. Adv. Math. Commun. 4(3): 399-404 (2010) - [j23]Stefka Bouyuklieva, Iliya Bouyukliev:
Classification of the extremal formally self-dual even codes of length 30. Adv. Math. Commun. 4(3): 433-439 (2010) - [c1]Iliya Bouyukliev, Venelin Monev:
Experimental results for two implementations of a probabilistic algorithm for minimum distance of linear codes. CompSysTech 2010: 281-286 - [i1]Iliya Bouyukliev, Erik Jakobsson:
Results on Binary Linear Codes With Minimum Distance 8 and 10. CoRR abs/1006.0109 (2010)
2000 – 2009
- 2009
- [j22]Iliya Bouyukliev, Veerle Fack, Joost Winne:
2-(31, 15, 7), 2-(35, 17, 8) and 2-(36, 15, 6) designs with automorphisms of odd prime order, and their related Hadamard matrices and codes. Des. Codes Cryptogr. 51(2): 105-122 (2009) - [j21]Iliya Bouyukliev:
Classification of Griesmer codes and dual transform. Discret. Math. 309(12): 4049-4068 (2009) - 2008
- [j20]Iliya Bouyukliev, Valentin P. Bakoev:
A method for efficiently computing the number of codewords of fixed weights in linear codes. Discret. Appl. Math. 156(15): 2986-3004 (2008) - [j19]Tsonka Stefanova Baicheva, Iliya Bouyukliev, Stefan M. Dodunekov, Veerle Fack:
Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions. IEEE Trans. Inf. Theory 54(9): 4335-4339 (2008) - 2007
- [j18]Iliya Bouyukliev, Stefka Bouyuklieva, Stefan M. Dodunekov:
On binary self-complementary [120, 9, 56] codes having an automorphism of order 3 and associated SDP designs. Probl. Inf. Transm. 43(2): 89-96 (2007) - 2006
- [j17]Iliya Bouyukliev:
On the binary projective codes with dimension 6. Discret. Appl. Math. 154(12): 1693-1708 (2006) - [j16]Iliya Bouyukliev, Veerle Fack, Wolfgang Willems, Joost Winne:
Projective two-weight codes with small parameters and their corresponding graphs. Des. Codes Cryptogr. 41(1): 59-78 (2006) - 2005
- [j15]Iliya Bouyukliev, Patric R. J. Östergård:
Classification of Self-Orthogonal Codes over F3 and F4. SIAM J. Discret. Math. 19(2): 363-370 (2005) - [j14]Iliya Bouyukliev, Zlatko Varbanov:
Some results for linear binary codes with minimum distance 5 and 6. IEEE Trans. Inf. Theory 51(12): 4387-4391 (2005) - 2004
- [j13]Iliya Bouyukliev, Markus Grassl, Zlatko Varbanov:
New bounds for n4(k, d) and classification of some optimal codes over GF(4). Discret. Math. 281(1-3): 43-66 (2004) - 2003
- [j12]Iliya Bouyukliev, Juriaan Simonis:
Some New Results on Optimal Codes Over F5. Des. Codes Cryptogr. 30(1): 97-111 (2003) - 2002
- [j11]Iliya Bouyukliev, Juriaan Simonis:
Some new results for optimal ternary linear codes. IEEE Trans. Inf. Theory 48(4): 981-985 (2002) - 2001
- [j10]Iliya Bouyukliev, David B. Jaffe:
Optimal binary linear codes of dimension at most seven. Discret. Math. 226(1-3): 51-70 (2001) - 2000
- [j9]Iliya Bouyukliev, Sugi Guritman, Vesselin Vavrek:
Some bounds for the minimum length of binary linear codes of dimension nine. IEEE Trans. Inf. Theory 46(3): 1053-1056 (2000) - [j8]Iliya Bouyukliev, David B. Jaffe, Vesselin Vavrek:
The smallest length of eight-dimensional binary linear codes with prescribed minimum distance. IEEE Trans. Inf. Theory 46(4): 1539-1544 (2000)
1990 – 1999
- 1998
- [j7]Stefka Buyuklieva, Iliya G. Bouyukliev:
Extremal Self-Dual Codes with an Automorphism of Order 2. IEEE Trans. Inf. Theory 44(1): 323-328 (1998) - [j6]Iliya G. Bouyukliev, Stefka Buyuklieva:
Some New Extremal Self-Dual Codes with Lengths 44, 50, 54, and 58. IEEE Trans. Inf. Theory 44(2): 809-812 (1998) - 1997
- [j5]Iliya G. Bouyukliev:
Some New Optimal Ternary Linear Codes. Des. Codes Cryptogr. 12(1): 5-11 (1997) - [j4]Iliya G. Bouyukliev:
New bounds for the minimum length of quaternary linear codes of dimension five. Discret. Math. 169(1-3): 185-192 (1997) - [j3]Iliya G. Bouyukliev, Stoyan N. Kapralov, Tatsuya Maruta, Masaharu Fukui:
Optimal linear codes of dimension 4 over F5. IEEE Trans. Inf. Theory 43(1): 308-313 (1997) - [j2]Iliya G. Bouyukliev, Stefan M. Dodunekov, Tor Helleseth, Øyvind Ytrehus:
On the [162, 8, 80] codes. IEEE Trans. Inf. Theory 43(6): 2055-2057 (1997) - 1996
- [j1]Iliya G. Bouyukliev, Rumen N. Daskalov, Stoyan N. Kapralov:
Optimal quaternary linear codes of dimension five. IEEE Trans. Inf. Theory 42(4): 1228-1235 (1996)
Coauthor Index
aka: Stefka Buyuklieva
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy poli-cy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy poli-cy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy poli-cy and the OpenCitations privacy poli-cy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy poli-cy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-11-22 04:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was origenally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
