| On the cyclic redundancycheck codes of 16-bit redundancy T Baicheva, SM Dodunekov, P Kazakov Proc. 6th Int. Workshop on Algebraic and Combinatorial Coding Theory, Pskov …, 1998 | 77 | 1998 |
| Optimal binary one-error-correcting codes of length 10 have 72 codewords PRJ Ostergard, T Baicheva, E Kolev IEEE Transactions on Information Theory 45 (4), 1229-1231, 1999 | 59 | 1999 |
| On the cyclic redundancy-check codes with 8-bit redundancy T Baicheva, S Dodunekov, P Kazakov Computer Communications 21 (11), 1030-1033, 1998 | 45 | 1998 |
| Determination of the best CRC codes with up to 10-bit redundancy TS Baicheva IEEE Transactions on Communications 56 (8), 1214-1220, 2008 | 23 | 2008 |
| Efficient generation of low autocorrelation binary sequences M Dimitrov, T Baitcheva, N Nikolov IEEE Signal Processing Letters 27, 341-345, 2020 | 19 | 2020 |
| Binary and ternary linear quasi-perfect codes with small dimensions T Baicheva, I Bouyukliev, S Dodunekov, V Fack IEEE transactions on information theory 54 (9), 4335-4339, 2008 | 17 | 2008 |
| On the performance of the ternary [13, 7, 5] quadratic-residue code T Baicheva, S Dodunekov, R Koetter IEEE Transactions on Information Theory 48 (2), 562-564, 2002 | 17 | 2002 |
| On the [10, 5, 6] Reed-Solomon and Glynn Codes T Baicheva, I Bouyukliev, S Dodunekov, W Willems Update 2004, 01-14, 2004 | 15 | 2004 |
| Covering radii of ternary linear codes of small dimensions and codimensions TS Baicheva, ED Velikova IEEE Transactions on Information Theory 43 (6), 2057-2061, 1997 | 15 | 1997 |
| Optimal (v, 4, 2, 1) optical orthogonal codes with small parameters T Baicheva, S Topalova Journal of Combinatorial Designs 20 (2), 142-160, 2012 | 14 | 2012 |
| CRC selection for decoding of CRC-polar concatenated codes T Baicheva, P Kazakov Proceedings of the 9th Balkan Conference on Informatics, 1-5, 2019 | 10 | 2019 |
| The covering radius of ternary cyclic codes with length up to 25 TS Baicheva Designs, Codes and Cryptography 13, 223-227, 1998 | 10 | 1998 |
| On the covering radius of ternary negacyclic codes with length up to 26 TS Baicheva IEEE Transactions on Information Theory 47 (1), 413-416, 2001 | 9 | 2001 |
| On the generation of long binary sequences with record-breaking PSL values M Dimitrov, T Baitcheva, N Nikolov IEEE Signal Processing Letters 27, 1904-1908, 2020 | 8 | 2020 |
| Classification of optimal (v, 4, 1) binary cyclically permutable constant-weight codes and cyclic 2-(v, 4, 1) designs with v ≤ 76 T Baicheva, S Topalova Problems of Information Transmission 47 (3), 224-231, 2011 | 8 | 2011 |
| Optimal conflict-avoiding codes for 3, 4 and 5 active users T Baicheva, S Topalova Problems of Information Transmission 53 (1), 42-50, 2017 | 7 | 2017 |
| Teaching linear codes T Baicheva, I Bouyukliev, S Dodunekov, W Willems International Congress MASSEE, 2003 | 7 | 2003 |
| Binary codes of length eight, minimum distance three and twenty codewords T Baicheva, E Kolev International Workshop on Optimal Codes, Sozopol, Bulgaria, 5-8, 1998 | 7 | 1998 |
| Some comments about CRC selection for the 5G nr specification T Baicheva, P Kazakov, M Dimitrov arXiv preprint arXiv:2104.02639, 2021 | 6 | 2021 |
| Optimal optical orthogonal codes of small T Baicheva, S Topalova Applicable Algebra in Engineering, Communication and Computing 24, 165-177, 2013 | 6 | 2013 |
Svetlana TopalovaProfessor of Computer Science, IMIVerified email at topalov.com
