M. Dimitrov, T. Baicheva and N.
Nikolov, Efficient generation of low autocorrelation binary sequences, *IEEE Signal Processing Letters*, vol. 27,
pp. 341-345, 2020.

T. Baicheva and S. Topalova,
Classification of optimal (v, k, 1) binary cyclically permutable constant
weight codes with k=5, 6 and 7 and small lengths, *Designs, Codes and Cryptography*, vol. 87 (2-3), pp. 365-374, 2019.

T. Baicheva and S. Topalova,
Classification of strongly conflict-avoiding codes, *IEEE Communications Letters*, vol. 22, issue 12, pp. 2415 - 2418,
2018.

T. Baicheva and S. Topalova, On
Tight Optimal Conflict-avoiding Codes for 3, 4, 5 and 6 Active Users, *Cybernetics and Information Technologies*,
Institute of Information and Communication Technologies - BAS, vol. 18, no. 5,
pp. 5-11, 2018.

T. Baicheva and M. Dimitrov, A
Software Tool ASR for a posteriori Cryptanalysis on Public Keys Generated with
RSA, *Information & Security: An
International Journal*, vol. 37, 2017.

E. Kolev and T. Baicheva, Minimal
coverings of (0,1,2)^{n} with
spheres of radius n, *Utilitas Mathematica*, Vol. 103, pp. 209-216, 2017.

T. Baicheva and S. Topalova,
Classification of optimal conflict-avoiding codes of weights 6 and 7, *Electronic Notes in Discrete Mathematics*,
Vol. 57, pp. 9-14, March 2017.

T. Baicheva and S. Topalova, Optimal
conflict-avoiding codes for 3,4 and 5 active users, *Problems of Information Transmission*, Vol. 53, No. 1, pp. 42-50,
2017.

T. Baicheva and S. Topalova,
Construction and classification of optimal (v,5,3,1) optical orthogonal codes, *Internat. Scientific Journal Science.
Business. Society*., vol. 5, pp. 7-8, 2016.

T. Baicheva and S. Topalova,
Classification of maximal optical orthogonal codes of weight 3 and small
lengths, *Serdica Journal of Computing*,
vol. 9, No. 1, pp. 83-92, 2015.

T. Baicheva and S. Topalova, Optimal
(v, 5, 2, 1) optical orthogonal codes of small v, *Applical Algebra in Engeneering Communication and Computing*, vol.
24, numbers 3-4, pp. 165-177, 2013.

T. Baicheva and S. Topalova, Optimal
(v,4,2,1) optical orthogonal codes with small parameters, *Journal
of Combinatorial Designs*, vol. 20 (2), pp. 142-160, 2012.

T. Baicheva, All binary linear codes
of lengths up to 18 or redundancy up to 10 are normal, *Advances in Mathematics of Communications*, vol. 5, No 4, pp.
681-686, 2011.

T. Baicheva and S. Topalova,
Classification of optimal (v,4,1) binary cyclically permutable constant weight
codes and cyclic S(2,4,v) designs with v≤76, *Problems of Information Transmission*, vol. 47, No 3, pp.224-231, 2011.

T. Baicheva and I. Bouyukliev, On
the least covering radius of the binary linear codes of dimension 6, *Advances
in Mathematics of Communications*, vol.4, No 3, pp. 399-404, 2010.

T. Baicheva, I. Bouyukliev, S.
Dodunekov, and V. Fack, Binary and Ternary Quasi-perfect Codes with Small
Dimensions, *IEEE Trans. on Inform. Theory*,
vol. 54, issue 9, pp. 4335-4339, 2008.

T. Baicheva, Determination of the
best CRC codes with up to 10-bit redundancy,
*IEEE Trans. on Communic., *vol.
56, issue 8, pp. 1214-1220, 2008.

T. Baicheva and F. Salam, CRC codes
for error control, *Mathematica Balkanica*,
New series vol. 21, Fasc. 3-4, pp. 377-388, 2007.

T. Baicheva, On the error correcting
performance of some binary and ternary linear codes, *Serdica,
Journal of Computing*, vol.1, pp. 157-170, 2007.

T. Baicheva, I. Boyukliev, S.
Dodunekov and W. Willems, Teaching linear codes, *Mathematica Balkanica*, New Series vol. 19, pp. 3-16, 2005.

E. Velikova and T. Baicheva, On the
computation of the weight distribution of the cosets of cyclic codes*,
Annuaire de l'Université de Sofia "St.~Kl.~Ohridski"*, vol.
97, pp. 109-114, 2005.

T. Baicheva, I. Boyukliev, S.
Dodunekov and W. Willems, Teaching linear codes, *Mathematica Balkanica*,
New Series vol. 19, pp. 3-16, 2005.

T. Baicheva, I. Boyukliev, S.
Dodunekov and W. Willems, On Reed-Solomon and Glynn $[10,5,6]_9$ codes, *Mathematica
Balkanica*, New Series vol. 18, pp. 67-78, 2004.

T. Baicheva and I. Gancheva,
Computer search for ternary cyclic and negacyclic LUEP codes of lengths up to
26, *Mathematica Balkanica*, New Series vol. 18, pp. 79-80, 2004.

T. Baicheva and V. Varek, On the
least covering radius of binary linear codes with small lengths, *IEEE Trans.
on Inform. Theory*, vol. 49, No. 3, pp. 738-740, 2003.

T. Baicheva, S. Dodunekov and R.
Koetter, On the Performance of the Ternary [13,7,5] Quadratic-Residue Codes, *IEEE
Trans. Inform. Theory*, vol. 48, No. 2, pp. 562-564, 2002.

T. Baicheva, On the covering radius
of ternary negacyclic codes with length up to 26, *IEEE Trans. on Inform.
Theory*, vol. 47, No. 1, pp. 413-416, 2001.

T. Baicheva, S. Dodunekov and P.
Kazakov, On the Undetected Error Probability Performance of Cyclic
Redundancy-Check Codes of 16-bit Redundancy, *IEE Proc. Communications*,
vol. 147, No 5, pp. 253-256, 2000.

P. Östergård, T. Baicheva
and E. Kolev, Optimal Binary One-error-correcting Codes of Length 10 have 72
Codewords*, IEEE Trans. Inform. Theory*, vol. 45, No. 4, pp. 1229-1231,
1999.

T. Baicheva, S. Dodunekov and P.
Kazakov, On the Cyclic Redundancy-Check Codes with 8-Bit Redundancy, *Computer
Communications*, vol. 21, pp. 1030-1033, 1998.

T. Baicheva, The Covering Radius of
Ternary Cyclic Codes with Length up to 25, *Designs, Codes and Cryptography*,
vol.13, pp. 223-227, 1998.

T. Baicheva and E.Velikova, Covering
Radii of Ternary Linear Codes of Small Dimensions and Codimensions*, IEEE
Trans. Inform. Theory*, vol. 43, pp. 2057-2061, 1997.

T. Baicheva and P. Kazakov, CRC
selection for decoding of CRC-polar concatenated codes, *ACM ICPS - 9-th Balkan Conference in Informatics*, Sofia, Bulgaria,
26-28, September, 2019, Article 27.

T. Baicheva and S. Topalova, On the
diffusion property of the Improved Generalized Feistel with different
permutations for each round, *Proc. of 8th
International Conference on Algebraic Informatics*, Niŝ, Serbia, June 30–July 4, 2019, LNCS
11545, pp. 38-49.

M. Dimitrov, T. Baicheva and G.
Ivanov, Implementation of RSA attack using 2-dimensional lattices by
constructing hypotheses of keys with low Hamming weight, presented at Training
School on Cryptanalysis of Ubiquitous
Computing Systems, 16-20 April 2018, Azores, Portugal, available at EXTENDED
ABSTRACTS, Paper 21,

https://www.cryptacus.eu/en/events/training-school-2018/pitches-and-posters/

T. Baicheva, S. Topalova, On
the size of optimal strongly conflict-avoiding codes for 3, 4 and 5 active
users, *Proc. of Eighth International Workshop on Optimal
Codes and Related Topics*, Sofia, Bulgaria, July 2017, pp. 11-16.

T. Baicheva, M. Dimitrov,
Cryptanalysis on short messages encrypted with M-138A cipher machine, *Proc. of
Eighth International Workshop on Optimal Codes and Related Topics*,
Sofia, Bulgaria, July 2017, pp. 5-10.

T. Baicheva and S. Topalova, New
perfect difference families, *Proc. of the
International Workshop on Algebraic and Combinatorial Coding Theory*,
Svetlogorsk, Russia, pp. 18-23, 2014.

E. Kolev and T. Baicheva, About the
inverse football pool problem for 9 games, *Proc
of Seventh Int. Workshop on Optimal Codes and Related Topics*, Albena,
Bulgaria, pp. 125 – 133, 2013.

T. Baicheva and S. Topalova, Optimal
(v, 3, 1) binary cyclically permutable constant weight codes with small v, *Proc. of the International Workshop on
Algebraic and Combinatorial Coding Theory*, Primorsko, Bulgaria, pp. 41-46,
2012.

T. Baicheva and S. Topalova,
Classification of optimal (v,4,1) optical orthogonal codes with v<=76, *Proc. of the International Workshop on
Algebraic and Combinatorial Coding Theory*, Novosibirsk, Russia, pp. 26-30,
2010.

T. Baicheva, Normality of some
binary linear codes, *Proc. of the
International Workshop Optimal Codes and Related Topics*, Varna, Bulgaria,
pp. 5-10, 2009.

T. Baicheva, I. Bouyukliev, Stefan
Dodunekov and V. Fack, Binary and ternary quasi-perfect codes with small
dimensions, *Proc. of the International
Workshop Optimal Codes and Related
Topics*, White Lagoon, Bulgaria, pp.13-18, 2007.

T. Baicheva and F. Sallam, Error
control performance of CRC codes with up to 8 bit redundancy, *Proc. of the International Workshop on
Algebraic and Combinatorial Coding Theory*, Zvenigorod, Russia, pp. 11-14,
2006.

T. Baicheva and F. Sallam, On the
error detection performance of some CRC codes, *Proc. of the workshop 'Mathematics, Informatics and Computer Sciences'*,
Veliko Tarnovo, Bulgaria, pp. 107-110, 2006.

T. Baicheva and I. Boyukliev, On the
ternary projective codes with dimensions 4 and 5, *Proc of the International Workshop on Algebraic and Combinatorial
Coding Theory*, Kranevo, Bulgaria, pp. 34-39, 2004. (__pdf__)

T. Baicheva, The Newton radius of
some binary and ternary cyclic codes, *Proc of the International Workshop on
Algebraic and Combinatorial Coding Theory*, Tsarskoe Selo, Russia, pp.
18-21, 2002. (__pdf__, __List of codes__)

T. Baicheva, Binary and ternary
linear codes which are good and proper for error correction, *Proc of the
International Workshop on Algebraic and Combinatorial Coding Theory*,
Bansko, Bulgaria, pp. 55-60, 2000. (__pdf__)

T. Baicheva, S. Dodunekov and P.
Kazakov, On the error detection performance of some standardized CRC codes, *Proc.of
the Int. Workshop TELECOM*, St. Konstantin, Bulgaria, 1998.

T. Baicheva, On the least covering
radius of some binary linear codes, *Mathematics and Education in Mathematics*,
pp. 144-149, 1998.

T. Baicheva, Computer Tools for
Determining the Covering Radius of Ternary Linear Codes, Mathematics and
Education in Mathematics, pp. 78-81, 1997.

T. Baicheva, Least Covering Radius
of Two-dimensional Codes over GF(3) and GF(4), *Proc. of the International
Workshop on Optimal Codes*, Sozopol, Bulgaria, pp. 7-10, 1995.