An improvement of the Griesmer bound for some small minimum distances. - Stefan M. Dodunekov; Nikolai L. Manev (Discret. Appl. Math., 1985)

New bounds on binary linear codes of dimension eight. - Stefan M. Dodunekov; Tor Helleseth; Nikolai L. Manev; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 1987)

On the covering radius of binary [14, 6] codes containing the all-one vector. - Stefan M. Dodunekov; Krassimir N. Manev; Vladimir D. Tonchev (IEEE Trans. Inf. Theory, 1988)

Algebraic decoding of the Zetterberg codes. - Stefan M. Dodunekov; Jan E. M. Nilsson (IEEE Trans. Inf. Theory, 1992)

On the [28, 7, 12] Binary Self-Complementary Codes and Their Residuals. - Stefan M. Dodunekov; Sylvia B. Encheva; Stoyan N. Kapralov (Des. Codes Cryptogr., 1994)

On the [162, 8, 80] codes. - Iliya G. Bouyukliev; Stefan M. Dodunekov; Tor Helleseth; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 1997)

Sufficient conditions for good and proper error-detecting codes. - Rossitza Dodunekova; Stefan M. Dodunekov (IEEE Trans. Inf. Theory, 1997)

Almost-MDS and near-MDS codes for error detection. - Rossitza Dodunekova; Stefan M. Dodunekov; Torleiv Kløve (IEEE Trans. Inf. Theory, 1997)

Codes and Projective Multisets. - Stefan M. Dodunekov; Juriaan Simonis (Electron. J. Comb., 1998)

On the cyclic redundancy-check codes with 8-bit redundancy. - Tsonka Stefanova Baicheva; Stefan M. Dodunekov; Peter Kazakov (Comput. Commun., 1998)

Some new results on the minimum length of binary linear codes of dimension nine. - Stefan M. Dodunekov; Sugi Guritman; Juriaan Simonis (IEEE Trans. Inf. Theory, 1999)

Near-MDS codes over some small fields. - Stefan M. Dodunekov; Ivan N. Landjev (Discret. Math., 2000)

On the performance of the ternary [13, 7, 5] quadratic-residue code. - Tsonka Stefanova Baicheva; Stefan M. Dodunekov; Ralf Koetter (IEEE Trans. Inf. Theory, 2002)

The MMD codes are proper for error detection. - Rossitza Dodunekova; Stefan M. Dodunekov (IEEE Trans. Inf. Theory, 2002)

On q-ary Grey-Rankin bound and codes meeting this bound. - Stefan M. Dodunekov; Tor Helleseth; Victor A. Zinoviev (ISIT, 2004)

On the error-detecting performance of some classes of block codes. - Rossitza Dodunekova; Stefan M. Dodunekov; Evgeniya P. Nikolova (Probl. Inf. Transm., 2004)

Binary self-dual codes with automorphisms of composite order. - Radinka Dontcheva; A. J. van Zanten; Stefan M. Dodunekov (IEEE Trans. Inf. Theory, 2004)

Error detection with a class of q-ary two-weight codes. - Rossitza Dodunekova; Stefan M. Dodunekov (ISIT, 2005)

On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound. - Leonid A. Bassalygo; Stefan M. Dodunekov; Tor Helleseth; Victor A. Zinoviev (ITW, 2006)

The Grey-Rankin bound for nonbinary codes. - Leonid A. Bassalygo; Stefan M. Dodunekov; Victor A. Zinoviev; Tor Helleseth (Probl. Inf. Transm., 2006)

On binary self-complementary [120, 9, 56] codes having an automorphism of order 3 and associated SDP designs. - Iliya Bouyukliev; Stefka Bouyuklieva; Stefan M. Dodunekov (Probl. Inf. Transm., 2007)

A survey on proper codes. - Rossitza Dodunekova; Stefan M. Dodunekov; Evgeniya P. Nikolova (Discret. Appl. Math., 2008)

A family of ternary quasi-perfect BCH codes. - Danyo Danev; Stefan M. Dodunekov (Des. Codes Cryptogr., 2008)

Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions. - Tsonka Stefanova Baicheva; Iliya Bouyukliev; Stefan M. Dodunekov; Veerle Fack (IEEE Trans. Inf. Theory, 2008)

Applications of Near MDS Codes in Cryptography. - Stefan M. Dodunekov (Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, 2009)

Partial covers of PG(n, q). - Stefan M. Dodunekov; Leo Storme; Geertrui Van de Voorde (Eur. J. Comb., 2010)

A family of constacyclic ternary quasi-perfect codes with covering radius 3. - Danyo Danev; Stefan M. Dodunekov; Diana Radkova (Des. Codes Cryptogr., 2011)

Generalized residue and t-residue codes and their idempotent generators. - A. J. van Zanten; A. Bojilov; Stefan M. Dodunekov (Des. Codes Cryptogr., 2015)