Stefan M. Dodunekov

According to our database1, Stefan M. Dodunekov authored at least 28 papers between 1985 and 2015.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Generalized residue and t-residue codes and their idempotent generators.
Des. Codes Cryptogr., 2015

2011
A family of constacyclic ternary quasi-perfect codes with covering radius 3.
Des. Codes Cryptogr., 2011

2010
Partial covers of PG(n, q).
Eur. J. Comb., 2010

2009
Applications of Near MDS Codes in Cryptography.
Proceedings of the Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, 2009

2008
Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions.
IEEE Trans. Inf. Theory, 2008

A family of ternary quasi-perfect BCH codes.
Des. Codes Cryptogr., 2008

A survey on proper codes.
Discret. Appl. Math., 2008

2007
On binary self-complementary [120, 9, 56] codes having an automorphism of order 3 and associated SDP designs.
Probl. Inf. Transm., 2007

2006
The Grey-Rankin bound for nonbinary codes.
Probl. Inf. Transm., 2006

On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

2005
Error detection with a class of q-ary two-weight codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Binary self-dual codes with automorphisms of composite order.
IEEE Trans. Inf. Theory, 2004

On the error-detecting performance of some classes of block codes.
Probl. Inf. Transm., 2004

On q-ary Grey-Rankin bound and codes meeting this bound.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2002
The MMD codes are proper for error detection.
IEEE Trans. Inf. Theory, 2002

On the performance of the ternary [13, 7, 5] quadratic-residue code.
IEEE Trans. Inf. Theory, 2002

2000
Near-MDS codes over some small fields.
Discret. Math., 2000

1999
Some new results on the minimum length of binary linear codes of dimension nine.
IEEE Trans. Inf. Theory, 1999

1998
On the cyclic redundancy-check codes with 8-bit redundancy.
Comput. Commun., 1998

Codes and Projective Multisets.
Electron. J. Comb., 1998

1997
Almost-MDS and near-MDS codes for error detection.
IEEE Trans. Inf. Theory, 1997

Sufficient conditions for good and proper error-detecting codes.
IEEE Trans. Inf. Theory, 1997

On the [162, 8, 80] codes.
IEEE Trans. Inf. Theory, 1997

1994
On the [28, 7, 12] Binary Self-Complementary Codes and Their Residuals.
Des. Codes Cryptogr., 1994

1992
Algebraic decoding of the Zetterberg codes.
IEEE Trans. Inf. Theory, 1992

1988
On the covering radius of binary [14, 6] codes containing the all-one vector.
IEEE Trans. Inf. Theory, 1988

1987
New bounds on binary linear codes of dimension eight.
IEEE Trans. Inf. Theory, 1987

1985
An improvement of the Griesmer bound for some small minimum distances.
Discret. Appl. Math., 1985


  Loading...