# Tsonka Stefanova Baicheva

According to our database

Collaborative distances:

^{1}, Tsonka Stefanova Baicheva authored at least 20 papers between 1997 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Classification of optimal (v, k, 1) binary cyclically permutable constant weight codes with $$k=5, $$ k = 5 , 6 and 7 and small lengths.

Des. Codes Cryptogr., 2019

On the Diffusion Property of the Improved Generalized Feistel with Different Permutations for Each Round.

Proceedings of the Algebraic Informatics - 8th International Conference, 2019

2018

Classification of Strongly Conflict-Avoiding Codes.

IEEE Communications Letters, 2018

2017

Optimal conflict-avoiding codes for 3, 4 and 5 active users.

Probl. Inf. Transm., 2017

Classification of optimal conflict-avoiding codes of weights 6 and 7.

Electronic Notes in Discrete Mathematics, 2017

2013

Optimal (v, 5, 2, 1) optical orthogonal codes of small v.

Appl. Algebra Eng. Commun. Comput., 2013

2011

Classification of optimal (

*v*, 4, 1) binary cyclically permutable constant-weight codes and cyclic 2-(*v*, 4, 1) designs with*v*≤ 76.
Probl. Inf. Transm., 2011

All binary linear codes of lengths up to 18 or redundancy up to 10 are normal.

Adv. in Math. of Comm., 2011

2010

On the least covering radius of binary linear codes of dimension 6.

Adv. in Math. of Comm., 2010

2009

Linear Codes of Good Error Control Performance.

Proceedings of the Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, 2009

2008

Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions.

IEEE Trans. Information Theory, 2008

Determination of the Best CRC Codes with up to 10-Bit Redundancy.

IEEE Trans. Communications, 2008

2003

On the least covering radius of binary linear codes with small lengths.

IEEE Trans. Information Theory, 2003

2002

On the performance of the ternary [13, 7, 5] quadratic-residue code.

IEEE Trans. Information Theory, 2002

2001

On the covering radius of ternary negacyclic codes with length up to 26.

IEEE Trans. Information Theory, 2001

1999

Optimal Binary One-Error-Correcting Codes of Length 10 Have 72 Codewords.

IEEE Trans. Information Theory, 1999

1998

Correction to 'Covering Radii of Ternary Linear Codes of Small Dimensions and Codimensions'.

IEEE Trans. Information Theory, 1998

The Covering Radius of Ternary Cyclic Codes with Length up to 25.

Des. Codes Cryptogr., 1998

On the cyclic redundancy-check codes with 8-bit redundancy.

Computer Communications, 1998

1997

Covering radii of ternary linear codes of small dimensions and codimensions.

IEEE Trans. Information Theory, 1997