Остановите войну!
for scientists:
default search action
Stefan M. Dodunekov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j25]A. J. van Zanten, A. Bojilov, Stefan M. Dodunekov:
Generalized residue and t-residue codes and their idempotent generators. Des. Codes Cryptogr. 75(2): 315-334 (2015) - 2011
- [j24]Danyo Danev, Stefan M. Dodunekov, Diana Radkova:
A family of constacyclic ternary quasi-perfect codes with covering radius 3. Des. Codes Cryptogr. 59(1-3): 111-118 (2011) - 2010
- [j23]Stefan M. Dodunekov, Leo Storme, Geertrui Van de Voorde:
Partial covers of PG(n, q). Eur. J. Comb. 31(6): 1611-1616 (2010)
2000 – 2009
- 2009
- [p1]Stefan M. Dodunekov:
Applications of Near MDS Codes in Cryptography. Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes 2009: 81-86 - [e1]Bart Preneel, Stefan M. Dodunekov, Vincent Rijmen, Svetla Nikova:
Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes. NATO Science for Peace and Security Series - D: Information and Communication Security 23, IOS Press 2009, ISBN 978-1-60750-002-5 [contents] - 2008
- [j22]Rossitza Dodunekova, Stefan M. Dodunekov, Evgeniya P. Nikolova:
A survey on proper codes. Discret. Appl. Math. 156(9): 1499-1509 (2008) - [j21]Danyo Danev, Stefan M. Dodunekov:
A family of ternary quasi-perfect BCH codes. Des. Codes Cryptogr. 49(1-3): 265-271 (2008) - [j20]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) - 2007
- [j19]Iliya Bouyukliev, Stefka Bouyuklieva, Stefan M. Dodunekov:
On binary self-complementary [120, 9, 56] codes having an automorphism of order 3 and associated SDP designs. Probl. Inf. Transm. 43(2): 89-96 (2007) - 2006
- [j18]Leonid A. Bassalygo, Stefan M. Dodunekov, Victor A. Zinoviev, Tor Helleseth:
The Grey-Rankin bound for nonbinary codes. Probl. Inf. Transm. 42(3): 197-203 (2006) - [c3]Leonid A. Bassalygo, Stefan M. Dodunekov, Tor Helleseth, Victor A. Zinoviev:
On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound. ITW 2006: 278-282 - 2005
- [j17]Rossitza Dodunekova, Stefan M. Dodunekov, Evgeniya P. Nikolova:
A survey on proper codes. Electron. Notes Discret. Math. 21: 273-275 (2005) - [c2]Rossitza Dodunekova, Stefan M. Dodunekov:
Error detection with a class of q-ary two-weight codes. ISIT 2005: 2232-2235 - 2004
- [j16]Rossitza Dodunekova, Stefan M. Dodunekov, Evgeniya P. Nikolova:
On the error-detecting performance of some classes of block codes. Probl. Inf. Transm. 40(4): 356-364 (2004) - [j15]Radinka Dontcheva, A. J. van Zanten, Stefan M. Dodunekov:
Binary self-dual codes with automorphisms of composite order. IEEE Trans. Inf. Theory 50(2): 311-318 (2004) - [c1]Stefan M. Dodunekov, Tor Helleseth, Victor A. Zinoviev:
On q-ary Grey-Rankin bound and codes meeting this bound. ISIT 2004: 528 - 2002
- [j14]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) - [j13]Rossitza Dodunekova, Stefan M. Dodunekov:
The MMD codes are proper for error detection. IEEE Trans. Inf. Theory 48(12): 3109-3111 (2002) - 2000
- [j12]Stefan M. Dodunekov, Ivan N. Landjev:
Near-MDS codes over some small fields. Discret. Math. 213(1-3): 55-65 (2000)
1990 – 1999
- 1999
- [j11]Stefan M. Dodunekov, Sugi Guritman, Juriaan Simonis:
Some new results on the minimum length of binary linear codes of dimension nine. IEEE Trans. Inf. Theory 45(7): 2543-2546 (1999) - 1998
- [j10]Stefan M. Dodunekov, Juriaan Simonis:
Codes and Projective Multisets. Electron. J. Comb. 5 (1998) - [j9]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) - 1997
- [j8]Rossitza Dodunekova, Stefan M. Dodunekov, Torleiv Kløve:
Almost-MDS and near-MDS codes for error detection. IEEE Trans. Inf. Theory 43(1): 285-289 (1997) - [j7]Rossitza Dodunekova, Stefan M. Dodunekov:
Sufficient conditions for good and proper error-detecting codes. IEEE Trans. Inf. Theory 43(6): 2023-2026 (1997) - [j6]Iliya G. Bouyukliev, Stefan M. Dodunekov, Tor Helleseth, Øyvind Ytrehus:
On the [162, 8, 80] codes. IEEE Trans. Inf. Theory 43(6): 2055-2057 (1997) - 1994
- [j5]Stefan M. Dodunekov, Sylvia B. Encheva, Stoyan N. Kapralov:
On the [28, 7, 12] Binary Self-Complementary Codes and Their Residuals. Des. Codes Cryptogr. 4(1): 57-67 (1994) - 1992
- [j4]Stefan M. Dodunekov, Jan E. M. Nilsson:
Algebraic decoding of the Zetterberg codes. IEEE Trans. Inf. Theory 38(5): 1570-1573 (1992)
1980 – 1989
- 1988
- [j3]Stefan M. Dodunekov, Krassimir N. Manev, Vladimir D. Tonchev:
On the covering radius of binary [14, 6] codes containing the all-one vector. IEEE Trans. Inf. Theory 34(3): 591-593 (1988) - 1987
- [j2]Stefan M. Dodunekov, Tor Helleseth, Nikolai L. Manev, Øyvind Ytrehus:
New bounds on binary linear codes of dimension eight. IEEE Trans. Inf. Theory 33(6): 917-919 (1987) - 1985
- [j1]Stefan M. Dodunekov, Nikolai L. Manev:
An improvement of the Griesmer bound for some small minimum distances. Discret. Appl. Math. 12(2): 103-114 (1985)
Coauthor Index
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 2023-10-01 22:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint