| 2008 |
|---|
| 10 | EE | Tsonka Stefanova Baicheva:
Determination of the Best CRC Codes with up to 10-Bit Redundancy.
IEEE Transactions on Communications 56(8): 1214-1220 (2008) |
| 9 | EE | Tsonka Stefanova Baicheva,
Iliya Bouyukliev,
Stefan M. Dodunekov,
Veerle Fack:
Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions.
IEEE Transactions on Information Theory 54(9): 4335-4339 (2008) |
| 2003 |
|---|
| 8 | | Tsonka Stefanova Baicheva,
Vesselin Vavrek:
On the least covering radius of binary linear codes with small lengths.
IEEE Transactions on Information Theory 49(3): 738-740 (2003) |
| 2002 |
|---|
| 7 | | Tsonka Stefanova Baicheva,
Stefan M. Dodunekov,
Ralf Koetter:
On the performance of the ternary [13, 7, 5] quadratic-residue code.
IEEE Transactions on Information Theory 48(2): 562-564 (2002) |
| 2001 |
|---|
| 6 | | Tsonka Stefanova Baicheva:
On the covering radius of ternary negacyclic codes with length up to 26.
IEEE Transactions on Information Theory 47(1): 413-416 (2001) |
| 1999 |
|---|
| 5 | | Patric R. J. Östergård,
Tsonka Stefanova Baicheva,
Emil Kolev:
Optimal Binary One-Error-Correcting Codes of Length 10 Have 72 Codewords.
IEEE Transactions on Information Theory 45(4): 1229-1231 (1999) |
| 1998 |
|---|
| 4 | EE | Tsonka Stefanova Baicheva,
Stefan M. Dodunekov,
Peter Kazakov:
On the cyclic redundancy-check codes with 8-bit redundancy.
Computer Communications 21(11): 1030-1033 (1998) |
| 3 | | Tsonka Stefanova Baicheva:
The Covering Radius of Ternary Cyclic Codes with Length up to 25.
Des. Codes Cryptography 13(3): 223-227 (1998) |
| 2 | | Tsonka Stefanova Baicheva,
Evgenia D. Velikova:
Correction to 'Covering Radii of Ternary Linear Codes of Small Dimensions and Codimensions'.
IEEE Transactions on Information Theory 44(5): 2032 (1998) |
| 1997 |
|---|
| 1 | | Tsonka Stefanova Baicheva,
Evgenia D. Velikova:
Covering radii of ternary linear codes of small dimensions and codimensions.
IEEE Transactions on Information Theory 43(6): 2057-2061 (1997) |
