The following pages link to Iliya G. Bouyukliev (Q1043573):
Displayed 46 items.
- (Q371231) (redirect page) (← links)
- Foreword to the special issue: Computer algebra in coding theory and cryptography (Q371233) (← links)
- On the least covering radius of binary linear codes of dimension 6 (Q540386) (← links)
- Classification of the extremal formally self-dual even codes of length 30 (Q540389) (← links)
- Projective two-weight codes with small parameters and their corresponding graphs (Q851774) (← links)
- On binary self-complementary [120, 9, 56] codes having an automorphism of order 3 and associated SDP designs (Q926627) (← links)
- A method for efficiently computing the number of codewords of fixed weights in linear codes (Q1005242) (← links)
- 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 (Q1009136) (← links)
- Classification of Griesmer codes and dual transform (Q1043574) (← links)
- Some new results on optimal codes over \(\mathbb F_5\) (Q1406882) (← links)
- S-boxes from binary quasi-cyclic codes (Q1743280) (← links)
- New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4) (Q1827695) (← links)
- Optimal binary linear codes of dimension at most seven (Q1841896) (← links)
- Some extremal self-dual codes and unimodular lattices in dimension 40 (Q1946687) (← links)
- Characteristic vector and weight distribution of a linear code (Q2040349) (← links)
- On the minimum length of linear codes over \(\mathbb{F}_5\) (Q2407026) (← links)
- On the binary projective codes with dimension 6 (Q2499590) (← links)
- Classification of Binary Self-Dual Codes of Length 40 (Q2977333) (← links)
- (Q3511531) (← links)
- Some Results for Linear Binary Codes With Minimum Distance<tex>$5$</tex>and<tex>$6$</tex> (Q3546596) (← links)
- (Q3576667) (← links)
- (Q3598607) (← links)
- Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions (Q3604821) (← links)
- Some bounds for the minimum length of binary linear codes of dimension nine (Q4503570) (← links)
- The smallest length of eight-dimensional binary linear codes with prescribed minimum distance (Q4503617) (← links)
- (Q4639977) (← links)
- (Q4640000) (← links)
- (Q4640001) (← links)
- (Q4664657) (← links)
- Some new results for optimal ternary linear codes (Q4674485) (← links)
- Computer Classification of Linear Codes (Q5032620) (← links)
- Classification of Linear Codes by Extending Their Residuals (Q5039569) (← links)
- The Program Generation in the Software Package QextNewEdition (Q5039570) (← links)
- (Q5212441) (← links)
- (Q5219841) (← links)
- (Q5219842) (← links)
- Results on Binary Linear Codes With Minimum Distance 8 and 10 (Q5272386) (← links)
- (Q5295614) (← links)
- (Q5448211) (← links)
- Classification of Self-Orthogonal Codes over \boldmath$\F_3$ and \boldmath$\F_4$ (Q5470764) (← links)
- (Q5709057) (← links)
- (Q5709171) (← links)
- AN ALGORITHM FOR COMPUTING THE WEIGHT DISTRIBUTION OF A LINEAR CODE OVER A COMPOSITE FINITE FIELD WITH CHARACTERISTIC 2 (Q6167071) (← links)
- ABOUT CODE EQUIVALENCE — A GEOMETRIC APPROACH (Q6178017) (← links)
- AN ALGORITHM FOR COMPUTING THE COVERING RADIUS OF A LINEAR CODE BASED ON VILENKIN-CHRESTENSON TRANSFORM (Q6178018) (← links)
- Classification of linear codes using canonical augmentation (Q6322618) (← links)