·
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, The Covering Radius of Ternary Cyclic Codes
with Length up to 25, *Designs, Codes and Cryptography*, vol.13, pp.
223-227, 1998.

·
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.

·
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 Undetected Error Probability
Performance of Cyclic Redundancy-Check Codes of 16-bit Redundancy, *IEE Proc.
Communications*, vol. 147, No 5, pp. 253-256, 2000.

·
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, *IEEE Trans. Inform. Theory*,
vol. 48, No. 2, pp. 562-564, 2002.

·
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 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, 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, 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, *Mathematica
Balkanica*, New Series vol. 19, pp. 3-16, 2005.

·
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 and F. Salam, CRC codes for error control, *Mathematica Balkanica*,
New series vol. 21, Fasc. 3-4, pp. 377-388, 2007.

·
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, I. Bouyukliev, *IEEE Trans. on Inform. Theory*,
vol. 54, issue 9, pp. 4335-4339, 2008.

·
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, August, 2010.

·
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, September
2011, pp.224-231.

·
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, November 2011, pp. 681-686,

·
T.
Baicheva and *Journal of Combinatorial Designs*, vol.
20 (2), 2012, pp. 142-160.

·
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, 2013, pp. 165-177.

·
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,
2015, pp. 83-92.

·
E.
Kolev and T. Baicheva,
Minimal coverings of {0,1,2}^{n} with spheres
of radius n, to appear in *Utiltitas** Mathematica*.

·
T.
Baicheva, G.Bogdanova, S.Ilieva, Sv.Topalova,
Object-oriented C++ library for computations in and over finite fields of
characteristic 2, *Mathematics and Education in Mathematics*, pp. 227-230,
1994.

·
T.
Baicheva and K.Manev,
Finding a linear closure of a set of vectors over a finite field of a non-binary
characteristic, Mathematics and Education in Mathematics, pp. 313-318, 1994.
(in Bulgarian)

·
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.

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

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

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

·
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, 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 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 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 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, 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 I. Bouyukliev, On the least covering radius of the
binary linear codes of dimension 6, *Proc.
of the International Workshop on Algebraic and Combinatorial Coding Theory*,
Pamporovo, Bulgaria, pp. 7-12, 2008.

·
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 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 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.

·
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, New perfect difference families, *Proc. of the International Workshop on
Algebraic and Combinatorial Coding Theory*, Svetlogorsk, Russia, pp. 18-23,
2014.

·
T. Baicheva and S. Topalova, Classification of optimal conflict-avoiding
codes of weights 6 and 7, *Proc. of the
International Workshop on Algebraic and Combinatorial Coding Theory*,
Albena, Bulgaria, pp. 13-18, 2016.