Stefan M. Dodunekov - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2015

Generalized residue and t-residue codes and their idempotent generatorsA. J. van Zanten, A. Bojilov, Stefan M. Dodunekov. dcc, 75(2):315-334, 2015. [doi]

2011

A family of constacyclic ternary quasi-perfect codes with covering radius 3Danyo Danev, Stefan M. Dodunekov, Diana Radkova. dcc, 59(1-3):111-118, 2011. [doi]

2010

Partial covers of PG(n, q)Stefan M. Dodunekov, Leo Storme, Geertrui Van de Voorde. ejc, 31(6):1611-1616, 2010. [doi]

2009

Applications of Near MDS Codes in CryptographyStefan M. Dodunekov. In Bart Preneel, Stefan M. Dodunekov, Vincent Rijmen, Svetla Nikova, editors, Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes. Volume 23 of NATO Science for Peace and Security Series - D: Information and Communication Security, pages 81-86, IOS Press, 2009. [doi]

2008

Binary and Ternary Linear Quasi-Perfect Codes With Small DimensionsTsonka Stefanova Baicheva, Iliya Bouyukliev, Stefan M. Dodunekov, Veerle Fack. TIT, 54(9):4335-4339, 2008. [doi]

A family of ternary quasi-perfect BCH codesDanyo Danev, Stefan M. Dodunekov. dcc, 49(1-3):265-271, 2008. [doi]

A survey on proper codesRossitza Dodunekova, Stefan M. Dodunekov, E. Nikolova. DAM, 156(9):1499-1509, 2008. [doi]

2007

On binary self-complementary [120, 9, 56] codes having an automorphism of order 3 and associated SDP designsIliya Bouyukliev, Stefka Bouyuklieva, Stefan M. Dodunekov. poit, 43(2):89-96, 2007. [doi]

2006

On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this boundLeonid A. Bassalygo, Stefan M. Dodunekov, Tor Helleseth, Victor A. Zinoviev. itw 2006: 278-282 [doi]

The Grey-Rankin bound for nonbinary codesLeonid A. Bassalygo, Stefan M. Dodunekov, Victor A. Zinoviev, Tor Helleseth. poit, 42(3):197-203, 2006. [doi]

2005

A survey on proper codesRossitza Dodunekova, Stefan M. Dodunekov, E. Nikolova. endm, 21:273-275, 2005. [doi]

Error detection with a class of q-ary two-weight codesRossitza Dodunekova, Stefan M. Dodunekov. isit 2005: 2232-2235 [doi]

2004

On q-ary Grey-Rankin bound and codes meeting this boundStefan M. Dodunekov, Tor Helleseth, Victor A. Zinoviev. isit 2004: 528 [doi]

On the error-detecting performance of some classes of block codesRossitza Dodunekova, Stefan M. Dodunekov, E. Nikolova. poit, 40(4):356-364, 2004. [doi]

Binary self-dual codes with automorphisms of composite orderRadinka Dontcheva, A. J. van Zanten, Stefan M. Dodunekov. TIT, 50(2):311-318, 2004.

2002

On the performance of the ternary [13, 7, 5] quadratic-residue codeTsonka Stefanova Baicheva, Stefan M. Dodunekov, Ralf Koetter. TIT, 48(2):562-564, 2002.

The MMD codes are proper for error detectionRossitza Dodunekova, Stefan M. Dodunekov. TIT, 48(12):3109-3111, 2002.

2000

Near-MDS codes over some small fieldsStefan M. Dodunekov, Ivan N. Landjev. DM, 213(1-3):55-65, 2000. [doi]

1999

Some new results on the minimum length of binary linear codes of dimension nineStefan M. Dodunekov, Sugi Guritman, Juriaan Simonis. TIT, 45(7):2543-2546, 1999.

1998

On the cyclic redundancy-check codes with 8-bit redundancyTsonka Stefanova Baicheva, Stefan M. Dodunekov, Peter Kazakov. comcom, 21(11):1030-1033, 1998. [doi]

Codes and Projective MultisetsStefan M. Dodunekov, Juriaan Simonis. combinatorics, 5, 1998. [doi]

1997

On the [162, 8, 80] codesIliya Boukliev, Stefan M. Dodunekov, Tor Helleseth, Øyvind Ytrehus. TIT, 43(6):2055-2057, 1997.

Almost-MDS and near-MDS codes for error detectionRossitza Dodunekova, Stefan M. Dodunekov, Torleiv Kløve. TIT, 43(1):285-289, 1997.

Sufficient conditions for good and proper error-detecting codesRossitza Dodunekova, Stefan M. Dodunekov. TIT, 43(6):2023-2026, 1997.

1994

On the [28, 7, 12] Binary Self-Complementary Codes and Their ResidualsStefan M. Dodunekov, Sylvia B. Encheva, Stoyan N. Kapralov. dcc, 4(1):57-67, 1994.

1992

Algebraic decoding of the Zetterberg codesStefan M. Dodunekov, Jan E. M. Nilsson. TIT, 38(5):1570, 1992.

1988

On the covering radius of binary [14, 6] codes containing the all-one vectorStefan M. Dodunekov, Krassimir N. Manev, Vladimir D. Tonchev. TIT, 34(3):591, 1988.

1987

New bounds on binary linear codes of dimension eightStefan M. Dodunekov, Tor Helleseth, Nickolai Manev, Øyvind Ytrehus. TIT, 33(6):917, 1987.

1985

An improvement of the Griesmer bound for some small minimum distancesStefan M. Dodunekov, Nikolai L. Manev. DAM, 12(2):103-114, 1985. [doi]

Sign in or sign up to see more results.

runs on WebDSL