The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stefan M. Dodunekov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stefan M. Dodunekov, Juriaan Simonis
    Codes and Projective Multisets. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  2. Tsonka Stefanova Baicheva, Stefan M. Dodunekov, Peter Kazakov
    On the cyclic redundancy-check codes with 8-bit redundancy. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 1998, v:21, n:11, pp:1030-1033 [Journal]
  3. Stefan M. Dodunekov, Sylvia B. Encheva, Stoyan N. Kapralov
    On the [28, 7, 12] Binary Self-Complementary Codes and Their Residuals. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1994, v:4, n:1, pp:57-67 [Journal]
  4. Stefan M. Dodunekov, Ivan N. Landjev
    Near-MDS codes over some small fields. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:55-65 [Journal]
  5. Tsonka Stefanova Baicheva, Stefan M. Dodunekov, Ralf Koetter
    On the performance of the ternary [13, 7, 5] quadratic-residue code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:2, pp:562-564 [Journal]
  6. Iliya Boukliev, Stefan M. Dodunekov, Tor Helleseth, Øyvind Ytrehus
    On the [162, 8, 80] codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:6, pp:2055-2057 [Journal]
  7. Stefan M. Dodunekov, Sugi Guritman, Juriaan Simonis
    Some new results on the minimum length of binary linear codes of dimension nine. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2543-2546 [Journal]
  8. Stefan M. Dodunekov, Tor Helleseth, Nickolai Manev, Øyvind Ytrehus
    New bounds on binary linear codes of dimension eight. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:6, pp:917-0 [Journal]
  9. Stefan M. Dodunekov, Krassimir N. Manev, Vladimir D. Tonchev
    On the covering radius of binary [14, 6] codes containing the all-one vector. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:3, pp:591-0 [Journal]
  10. Stefan M. Dodunekov, Jan E. M. Nilsson
    Algebraic decoding of the Zetterberg codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:5, pp:1570-0 [Journal]
  11. Rossitza Dodunekova, Stefan M. Dodunekov
    The MMD codes are proper for error detection. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:12, pp:3109-3111 [Journal]
  12. Rossitza Dodunekova, Stefan M. Dodunekov
    Sufficient conditions for good and proper error-detecting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:6, pp:2023-2026 [Journal]
  13. Rossitza Dodunekova, Stefan M. Dodunekov, Torleiv Kløve
    Almost-MDS and near-MDS codes for error detection. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:285-289 [Journal]
  14. Radinka Dontcheva, A. J. van Zanten, Stefan M. Dodunekov
    Binary self-dual codes with automorphisms of composite order. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:311-318 [Journal]

  15. A survey on proper codes. [Citation Graph (, )][DBLP]


  16. A family of ternary quasi-perfect BCH codes. [Citation Graph (, )][DBLP]


  17. Partial covers of PG(n, q). [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002