![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Tsonka Stefanova Baicheva
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j22]Tsonka Baicheva
, Svetlana Topalova:
On the diffusion of the Improved Generalized Feistel. Adv. Math. Commun. 16(1): 95-114 (2022) - 2021
- [j21]Miroslav M. Dimitrov
, Tsonka Baicheva
, Nikolay Nikolov
:
Hybrid Constructions of Binary Sequences With Low Autocorrelation Sideobes. IEEE Access 9: 112400-112410 (2021) - [i2]Tsonka Baicheva, Peter Kazakov, Miroslav M. Dimitrov:
Some comments about CRC selection for the 5G NR specification. CoRR abs/2104.02639 (2021) - 2020
- [j20]Miroslav M. Dimitrov
, Tsonka Baicheva
, Nikolay Nikolov
:
Efficient Generation of Low Autocorrelation Binary Sequences. IEEE Signal Process. Lett. 27: 341-345 (2020) - [j19]Miroslav M. Dimitrov
, Tsonka Baicheva
, Nikolay Nikolov
:
On the Generation of Long Binary Sequences With Record-Breaking PSL Values. IEEE Signal Process. Lett. 27: 1904-1908 (2020)
2010 – 2019
- 2019
- [j18]Tsonka Baicheva
, Svetlana Topalova
:
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. 87(2-3): 365-374 (2019) - [c2]Tsonka Baicheva
, Peter Kazakov:
CRC selection for decoding of CRC-polar concatenated codes. BCI 2019: 27:1-27:5 - [c1]Tsonka Baicheva
, Svetlana Topalova
:
On the Diffusion Property of the Improved Generalized Feistel with Different Permutations for Each Round. CAI 2019: 38-49 - [i1]Tsonka Baicheva, Peter Kazakov:
CRC selection for decoding of CRC-polar concatenated codes. CoRR abs/1912.07298 (2019) - 2018
- [j17]Tsonka Stefanova Baicheva
, Svetlana Topalova
:
Classification of Strongly Conflict-Avoiding Codes. IEEE Commun. Lett. 22(12): 2415-2418 (2018) - 2017
- [j16]Tsonka Baicheva
, Svetlana Topalova
:
Classification of optimal conflict-avoiding codes of weights 6 and 7. Electron. Notes Discret. Math. 57: 9-14 (2017) - [j15]Tsonka Stefanova Baicheva
, Svetlana Topalova
:
Optimal conflict-avoiding codes for 3, 4 and 5 active users. Probl. Inf. Transm. 53(1): 42-50 (2017) - 2013
- [j14]Tsonka Stefanova Baicheva
, Svetlana Topalova
:
Optimal (v, 5, 2, 1) optical orthogonal codes of small v. Appl. Algebra Eng. Commun. Comput. 24(3-4): 165-177 (2013) - 2011
- [j13]Tsonka Baicheva
:
All binary linear codes of lengths up to 18 or redundancy up to 10 are normal. Adv. Math. Commun. 5(4): 681-686 (2011) - [j12]Tsonka Baicheva
, Svetlana Topalova
:
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. 47(3): 224 (2011) - 2010
- [j11]Tsonka Stefanova Baicheva, Iliya Bouyukliev
:
On the least covering radius of binary linear codes of dimension 6. Adv. Math. Commun. 4(3): 399-404 (2010)
2000 – 2009
- 2009
- [p1]Tsonka Baicheva:
Linear Codes of Good Error Control Performance. Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes 2009: 250-259 - 2008
- [j10]Tsonka Stefanova Baicheva
:
Determination of the Best CRC Codes with up to 10-Bit Redundancy. IEEE Trans. Commun. 56(8): 1214-1220 (2008) - [j9]Tsonka Stefanova Baicheva
, Iliya Bouyukliev
, Stefan M. Dodunekov, Veerle Fack:
Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions. IEEE Trans. Inf. Theory 54(9): 4335-4339 (2008) - 2003
- [j8]Tsonka Stefanova Baicheva
, Vesselin Vavrek:
On the least covering radius of binary linear codes with small lengths. IEEE Trans. Inf. Theory 49(3): 738-740 (2003) - 2002
- [j7]Tsonka Stefanova Baicheva
, Stefan M. Dodunekov, Ralf Koetter:
On the performance of the ternary [13, 7, 5] quadratic-residue code. IEEE Trans. Inf. Theory 48(2): 562-564 (2002) - 2001
- [j6]Tsonka Stefanova Baicheva
:
On the covering radius of ternary negacyclic codes with length up to 26. IEEE Trans. Inf. Theory 47(1): 413-416 (2001)
1990 – 1999
- 1999
- [j5]Patric R. J. Östergård, Tsonka Stefanova Baicheva
, Emil Kolev:
Optimal Binary One-Error-Correcting Codes of Length 10 Have 72 Codewords. IEEE Trans. Inf. Theory 45(4): 1229-1231 (1999) - 1998
- [j4]Tsonka Stefanova Baicheva
, Stefan M. Dodunekov, Peter Kazakov:
On the cyclic redundancy-check codes with 8-bit redundancy. Comput. Commun. 21(11): 1030-1033 (1998) - [j3]Tsonka Stefanova Baicheva:
The Covering Radius of Ternary Cyclic Codes with Length up to 25. Des. Codes Cryptogr. 13(3): 223-227 (1998) - [j2]Tsonka Stefanova Baicheva, Evgenia D. Velikova
:
Correction to 'Covering Radii of Ternary Linear Codes of Small Dimensions and Codimensions'. IEEE Trans. Inf. Theory 44(5): 2032 (1998) - 1997
- [j1]Tsonka Stefanova Baicheva
, Evgenia D. Velikova
:
Covering radii of ternary linear codes of small dimensions and codimensions. IEEE Trans. Inf. Theory 43(6): 2057-2061 (1997)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint