Search the dblp DataBase
Tsonka Stefanova Baicheva: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Tsonka Stefanova Baicheva, Stefan M. Dodunekov, Peter Kazakov
On the cyclic redundancy-check codes with 8-bit redundancy. [Citation Graph (0, 0)][DBLP]
Computer Communications, 1998, v:21, n:11, pp:1030-1033 [Journal] - Tsonka Stefanova Baicheva
The Covering Radius of Ternary Cyclic Codes with Length up to 25. [Citation Graph (0, 0)][DBLP]
Des. Codes Cryptography, 1998, v:13, n:3, pp:223-227 [Journal] - Tsonka Stefanova Baicheva
On the covering radius of ternary negacyclic codes with length up to 26. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:413-416 [Journal] - Tsonka Stefanova Baicheva, Stefan M. Dodunekov, Ralf Koetter
On the performance of the ternary [13, 7, 5] quadratic-residue code. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 2002, v:48, n:2, pp:562-564 [Journal] - Tsonka Stefanova Baicheva, Vesselin Vavrek
On the least covering radius of binary linear codes with small lengths. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 2003, v:49, n:3, pp:738-740 [Journal] - Tsonka Stefanova Baicheva, Evgenia D. Velikova
Covering radii of ternary linear codes of small dimensions and codimensions. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1997, v:43, n:6, pp:2057-2061 [Journal] - Tsonka Stefanova Baicheva, Evgenia D. Velikova
Correction to 'Covering Radii of Ternary Linear Codes of Small Dimensions and Codimensions'. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1998, v:44, n:5, pp:2032- [Journal] - Patric R. J. Östergård, Tsonka Stefanova Baicheva, Emil Kolev
Optimal Binary One-Error-Correcting Codes of Length 10 Have 72 Codewords. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1999, v:45, n:4, pp:1229-1231 [Journal]
Optimal (v, 4, 2, 1) optical orthogonal codes with small parameters [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002