The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vladimir D. Tonchev: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Masaaki Harada, Vladimir D. Tonchev
    Singly-Even Self-Dual Codes and Hadamard Matrices. [Citation Graph (0, 0)][DBLP]
    AAECC, 1995, pp:279-284 [Conf]
  2. Vladimir D. Tonchev, Hao Wang
    Optimal Difference Systems of Sets with Multipliers. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:612-618 [Conf]
  3. Stoicho D. Stoichev, Vladimir D. Tonchev
    Unital designs in planes of order 16. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:102, n:1-2, pp:151-158 [Journal]
  4. Alphonse Baartmans, Ivan N. Landjev, Vladimir D. Tonchev
    On the Binary Codes of Steiner Triple Systems. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1996, v:8, n:1-2, pp:29-43 [Journal]
  5. Charles J. Colbourn, Eric Mendelsohn, Cheryl E. Praeger, Vladimir D. Tonchev
    Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1992, v:2, n:3, pp:237-251 [Journal]
  6. Willem H. Haemers, Vladimir D. Tonchev
    Spreads in Strongly Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1996, v:8, n:1-2, pp:145-157 [Journal]
  7. Masaaki Harada, Clement W. H. Lam, Vladimir D. Tonchev
    Symmetric (4,4)-Nets and Generalized Hadamard Matrices Over Groups of Order 4. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:34, n:1, pp:71-87 [Journal]
  8. David B. Jaffe, Vladimir D. Tonchev
    Computing Linear Codes and Unitals. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:14, n:1, pp:39-52 [Journal]
  9. Zvonimir Janko, Hadi Kharaghani, Vladimir D. Tonchev
    The Existence of a Bush-Type Hadamard Matrix of Order 324 and Two New Infinite Classes of Symmetric Designs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:24, n:2, pp:225-232 [Journal]
  10. W. Cary Huffman, Vladimir D. Tonchev
    The Existence of Extremal Self-Dual [50, 25, 10] Codes and Quasi-Symmetric 2-(49, 9, 6) Designs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1995, v:6, n:2, pp:97-106 [Journal]
  11. Dieter Jungnickel, Vladimir D. Tonchev
    Exponential Number of Quasi-Symmetric SDP Designs and Codes Meeting. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1991, v:1, n:3, pp:247-253 [Journal]
  12. Clement W. H. Lam, Larry Thiel, Vladimir D. Tonchev
    On Quasi-Symmetric 2-(28, 12, 11) and 2-(36, 16, 12) Designs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1995, v:5, n:1, pp:43-55 [Journal]
  13. Gary McGuire, Vladimir D. Tonchev, Harold N. Ward
    Characterizing the Hermitian and Ree Unitals on 28 Points. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:13, n:1, pp:57-61 [Journal]
  14. Vladimir D. Tonchev
    A Note on MDS Codes, n-Arcs and Complete Designs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:247-250 [Journal]
  15. Vladimir D. Tonchev
    Special Issue Containing Papers Presented at the Second Upper Michigan Combinatorics Workshop on Designs, Codes and Geometries - Preface. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1996, v:9, n:1, pp:5-6 [Journal]
  16. Vladimir D. Tonchev
    Linear Perfect Codes and a Characterization of the Classical Designs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1999, v:17, n:1-3, pp:121-128 [Journal]
  17. Anton Betten, Dieter Betten, Vladimir D. Tonchev
    Unitals and codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:267, n:1-3, pp:23-33 [Journal]
  18. Masaaki Harada, Vladimir D. Tonchev
    Self-orthogonal Codes from Symmetric Designs with Fixed-point-free Auto-morphisms. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:264, n:1-3, pp:81-90 [Journal]
  19. Akihiro Munemasa, Vladimir D. Tonchev
    A new quasi-symmetric 2-(56, 16, 6) design obtained from codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:284, n:1-3, pp:231-234 [Journal]
  20. Vladimir D. Tonchev
    Error-correcting codes from graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:549-557 [Journal]
  21. Vladimir D. Tonchev
    Affine designs and linear orthogonal arrays. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:294, n:1-2, pp:219-222 [Journal]
  22. Marijn van Eupen, Vladimir D. Tonchev
    Linear Codes and the Existence of a Reversible Hadamard Difference Set in Z2xZ2xZ45. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:79, n:1, pp:161-167 [Journal]
  23. Willem H. Haemers, Christopher Parker, Vera Pless, Vladimir D. Tonchev
    A Design and a Code Invariant under the Simple Group Co3. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1993, v:62, n:2, pp:225-233 [Journal]
  24. Zvonimir Janko, Vladimir D. Tonchev
    New Designs with Block Size 7. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:83, n:1, pp:152-157 [Journal]
  25. Dieter Jungnickel, Vladimir D. Tonchev
    On Symmetric and Quasi-Symmetric Designs with the Symmetric Difference Property and Their Codes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:59, n:1, pp:40-50 [Journal]
  26. Clement W. H. Lam, Sigmund Lam, Vladimir D. Tonchev
    Bounds on the Number of Affine, Symmetric, and Hadamard Designs and Matrices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:92, n:2, pp:186-196 [Journal]
  27. Jack H. van Lint, Vladimir D. Tonchev
    Nonembeddable Quasi-residual Designs with Large K. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1984, v:37, n:3, pp:359-362 [Journal]
  28. Jack H. van Lint, Vladimir D. Tonchev
    A Class of Non-embeddable Designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1993, v:62, n:2, pp:252-260 [Journal]
  29. Christopher Parker, Edward Spence, Vladimir D. Tonchev
    Designs with the Symmetric Difference Property on 64 Points and Their Groups. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:67, n:1, pp:23-43 [Journal]
  30. Vladimir D. Tonchev
    A Mass Formula for Steiner Triple Systems STS(2n-1) of 2-Rank 2n-n. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:95, n:2, pp:197-208 [Journal]
  31. Vladimir D. Tonchev
    On the Mutual Embeddability of (2k, k, k - 1) and (2k - 1, k, k) Quasi-Residual Designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1980, v:29, n:3, pp:329-335 [Journal]
  32. Vladimir D. Tonchev
    Hadamard Matrices of Order 28 with Automorphisms of Order 13. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1983, v:35, n:1, pp:43-57 [Journal]
  33. Vladimir D. Tonchev
    Hadamard Matrices of Order 28 with Automorphisms of Order 7. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:40, n:1, pp:62-81 [Journal]
  34. Vladimir D. Tonchev
    A characterization of designs related to dodecads in the witt system S(5, 8, 24). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:43, n:2, pp:219-227 [Journal]
  35. Vladimir D. Tonchev
    Quasi-symmetric 2-(31, 7, 7) designs and a revision of Hamada's conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:42, n:1, pp:104-110 [Journal]
  36. Vladimir D. Tonchev
    Self-orthogonal designs and extremal doubly even codes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:52, n:2, pp:197-205 [Journal]
  37. Ryoh Fuji-Hara, Akihiro Munemasa, Vladimir D. Tonchev
    Hyperplane partitions and difference systems of sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:8, pp:1689-1698 [Journal]
  38. 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]
  39. Vera Pless, Vladimir D. Tonchev
    Self-dual codes over GF(7). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:5, pp:723-0 [Journal]
  40. Vera Pless, Vladimir D. Tonchev, Jeffrey S. Leon
    On the existence of a certain (64, 32, 12) extremal code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:1, pp:214-0 [Journal]
  41. Vladimir D. Tonchev
    A Varshamov-Gilbert bound for a class of formally self-dual codes and related quantum codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:4, pp:975-977 [Journal]
  42. Vladimir D. Tonchev
    Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:3, pp:1021-1025 [Journal]
  43. Vladimir D. Tonchev
    Maximum Disjoint Bases and Constant-Weight Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:333-334 [Journal]
  44. Vladimir D. Tonchev, Vassil Y. Yorgov
    The existence of certain extremal [54, 27, 10] self-dual codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1628-1631 [Journal]
  45. Vladimir D. Tonchev
    Transitive Steiner triple systems of order 25. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:67, n:2, pp:211-214 [Journal]
  46. Vladimir D. Tonchev
    The isomorphism of the Cohen, Haemers-van Lint and De Clerck-Dye-Thas partial geometries. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:49, n:2, pp:213-217 [Journal]
  47. Frans C. Bussemaker, Vladimir D. Tonchev
    New extremal doubly-even codes of length 56 derived from Hadamard matrices of order 28. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:76, n:1, pp:45-49 [Journal]
  48. Ivan N. Landgev, Vladimir D. Tonchev
    Automorphisms of 2-(22, 8, 4) designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:77, n:1-3, pp:177-189 [Journal]
  49. Frans C. Bussemaker, Vladimir D. Tonchev
    Extremal doubly-even codes of length 40 derived from Hadamard matrices of order 20. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:317-321 [Journal]
  50. Stoyan N. Kapralov, Vladimir D. Tonchev
    Extremal doubly-even codes of length 64 derived from symmetric designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:83, n:2-3, pp:285-289 [Journal]
  51. Zvonimir Janko, Vladimir D. Tonchev
    Cyclic 2-(91, 6, 1) designs with multiplier automorphisms. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:97, n:1-3, pp:265-268 [Journal]
  52. Edward Spence, Vladimir D. Tonchev
    Extremal self-dual codes from symmetric designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:265-268 [Journal]
  53. Vladimir D. Tonchev
    Some small non-embeddable designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:489-492 [Journal]
  54. Vladimir D. Tonchev, Scott A. Vanstone
    On Kirkman triple systems of order 33. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:493-496 [Journal]
  55. Vladimir D. Tonchev
    The uniformly packed binary [27, 21, 3] and [35, 29, 3] codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:149, n:1-3, pp:283-288 [Journal]
  56. Vladimir D. Tonchev, Hao Wang
    An algorithm for optimal difference systems of sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:2-3, pp:165-175 [Journal]

  57. An algorithm for optimal comma free codes with isomorphism rejection. [Citation Graph (, )][DBLP]


  58. Entanglement-assisted quantum low-density parity-check codes [Citation Graph (, )][DBLP]


  59. Self-dual codes and Hadamard matrices. [Citation Graph (, )][DBLP]


  60. Polarities, quasi-symmetric designs, and Hamada's conjecture. [Citation Graph (, )][DBLP]


  61. Quantum codes from caps. [Citation Graph (, )][DBLP]


  62. On affine designs and Hadamard designs with line spreads. [Citation Graph (, )][DBLP]


  63. Difference systems of sets and cyclotomy. [Citation Graph (, )][DBLP]


  64. Generalized weighing matrices and self-orthogonal codes. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
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