Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Vladimir D. Tonchev
2010 – today
- 2013
[j75]David Clark, Vladimir D. Tonchev: Enumeration of (16, 4, 16, 4) Relative Difference Sets. Electr. J. Comb. 20(1): P72 (2013)- [j74]Dieter Jungnickel, Vladimir D. Tonchev: New invariants for incidence structures. Des. Codes Cryptography 68(1-3): 163-177 (2013)
- [j73]Yuichiro Fujiwara, Vladimir D. Tonchev: High-Rate Self-Synchronizing Codes. IEEE Transactions on Information Theory 59(4): 2328-2335 (2013)
- [j72]Yuichiro Fujiwara, Vladimir D. Tonchev: A Characterization of Entanglement-Assisted Quantum Low-Density Parity-Check Codes. IEEE Transactions on Information Theory 59(6): 3347-3353 (2013)
- [i4]Yuichiro Fujiwara, Vladimir D. Tonchev, Tony W. H. Wong: Algebraic techniques in designing quantum synchronizable codes. CoRR abs/1304.0502 (2013)
- 2012
- [j71]Dieter Jungnickel, Vladimir D. Tonchev: A Hamada type characterization of the classical geometric designs. Des. Codes Cryptography 65(1-2): 15-28 (2012)
- [j70]David Clark, Vladimir D. Tonchev: Nonbinary quantum codes derived from finite geometries. Finite Fields and Their Applications 18(1): 63-69 (2012)
- [c4]Yuichiro Fujiwara, Vladimir D. Tonchev: A direct product construction for high-rate self-synchronizing codes. ISITA 2012: 226-229
- [i3]Yuichiro Fujiwara, Vladimir D. Tonchev: High-rate self-synchronizing codes. CoRR abs/1208.5216 (2012)
- 2011
- [j69]David Clark, Dieter Jungnickel, Vladimir D. Tonchev: Affine geometry designs, polarities, and Hamada's conjecture. J. Comb. Theory, Ser. A 118(1): 231-239 (2011)
- [p2]Vladimir D. Tonchev: Finite geometry designs, codes, and Hamada's conjecture. Information Security, Coding Theory and Related Combinatorics 2011: 437-448
- [e1]Dean Crnkovic, Vladimir D. Tonchev (Eds.): Information Security, Coding Theory and Related Combinatorics. NATO Science for Peace and Security Series - D: Information and Communication Security 29, IOS Press 2011, ISBN 978-1-60750-662-1
- [i2]Yuichiro Fujiwara, Vladimir D. Tonchev: A characterization of entanglement-assisted quantum low-density parity-check codes. CoRR abs/1108.0679 (2011)
- 2010
- [j68]Masaaki Harada, Clement W. H. Lam, Akihiro Munemasa, Vladimir D. Tonchev: Classification of Generalized Hadamard Matrices H(6,3) and Quaternary Hermitian Self-Dual Codes of Length 18. Electr. J. Comb. 17(1) (2010)
- [j67]Dieter Jungnickel, Vladimir D. Tonchev: The number of designs with geometric parameters grows exponentially. Des. Codes Cryptography 55(2-3): 131-140 (2010)
- [i1]Yuichiro Fujiwara, David Clark, Peter Vandendriessche, Maarten De Boeck, Vladimir D. Tonchev: Entanglement-assisted quantum low-density parity-check codes. CoRR abs/1008.4747 (2010)
2000 – 2009
- 2009
- [j66]Dieter Jungnickel, Vladimir D. Tonchev: Polarities, quasi-symmetric designs, and Hamada's conjecture. Des. Codes Cryptography 51(2): 131-140 (2009)
- [j65]Vladimir D. Tonchev: Generalized weighing matrices and self-orthogonal codes. Discrete Mathematics 309(14): 4697-4699 (2009)
- [c3]
- [p1]Vladimir D. Tonchev: Combinatorial Designs and Code Synchronization. Algebraic Aspects of Digital Communications 2009: 81-99
- 2008
- [j64]Vassili C. Mavron, T. P. McDonough, Vladimir D. Tonchev: On affine designs and Hadamard designs with line spreads. Discrete Mathematics 308(13): 2742-2750 (2008)
- [j63]Yukiyasu Mutoh, Vladimir D. Tonchev: Difference systems of sets and cyclotomy. Discrete Mathematics 308(14): 2959-2969 (2008)
- [j62]
- [j61]Vladimir D. Tonchev: Steiner systems for two-stage disjunctive testing. J. Comb. Optim. 15(1): 1-6 (2008)
- 2007
- [j60]Vladimir D. Tonchev, Hao Wang: An algorithm for optimal difference systems of sets. J. Comb. Optim. 14(2-3): 165-175 (2007)
- [j59]Masakazu Jimbo, Miwako Mishima, Susan Janiszewski, Amin Y. Teymorian, Vladimir D. Tonchev: On Conflict-Avoiding Codes of Length n=4m for Three Active Users. IEEE Transactions on Information Theory 53(8): 2732-2742 (2007)
- 2006
- [j58]Ryoh Fuji-Hara, Akihiro Munemasa, Vladimir D. Tonchev: Hyperplane partitions and difference systems of sets. J. Comb. Theory, Ser. A 113(8): 1689-1698 (2006)
- [c2]
- 2005
- [j57]Masaaki Harada, Clement W. H. Lam, Vladimir D. Tonchev: Symmetric (4,4)-Nets and Generalized Hadamard Matrices Over Groups of Order 4. Des. Codes Cryptography 34(1): 71-87 (2005)
- [j56]Vladimir D. Tonchev: Affine designs and linear orthogonal arrays. Discrete Mathematics 294(1-2): 219-222 (2005)
- [j55]Vladimir D. Tonchev: Partitions of difference sets and code synchronization. Finite Fields and Their Applications 11(3): 601-621 (2005)
- 2004
- [j54]Akihiro Munemasa, Vladimir D. Tonchev: A new quasi-symmetric 2-(56, 16, 6) design obtained from codes. Discrete Mathematics 284(1-3): 231-234 (2004)
- [j53]Vladimir D. Tonchev: On generalized Hadamard matrices of minimum rank. Finite Fields and Their Applications 10(4): 522-529 (2004)
- 2003
- [j52]Vladimir D. Tonchev: A Note on MDS Codes, n-Arcs and Complete Designs. Des. Codes Cryptography 29(1-3): 247-250 (2003)
- [j51]Masaaki Harada, Vladimir D. Tonchev: Self-orthogonal Codes from Symmetric Designs with Fixed-point-free Auto-morphisms. Discrete Mathematics 264(1-3): 81-90 (2003)
- [j50]Anton Betten, Dieter Betten, Vladimir D. Tonchev: Unitals and codes. Discrete Mathematics 267(1-3): 23-33 (2003)
- 2002
- [j49]Vladimir D. Tonchev: Error-correcting codes from graphs. Discrete Mathematics 257(2-3): 549-557 (2002)
- [j48]Vladimir D. Tonchev: A Varshamov-Gilbert bound for a class of formally self-dual codes and related quantum codes. IEEE Transactions on Information Theory 48(4): 975-977 (2002)
- 2001
- [j47]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. Des. Codes Cryptography 24(2): 225-232 (2001)
- [j46]Dieter Jungnickel, Vladimir D. Tonchev: Perfect Codes and Balanced Generalized Weighing Matrices, II. Electronic Notes in Discrete Mathematics 6: 113-122 (2001)
- [j45]Vladimir D. Tonchev: A Mass Formula for Steiner Triple Systems STS(2n-1) of 2-Rank 2n-n. J. Comb. Theory, Ser. A 95(2): 197-208 (2001)
- 2000
- [j44]Stoicho D. Stoichev, Vladimir D. Tonchev: Unital designs in planes of order 16. Discrete Applied Mathematics 102(1-2): 151-158 (2000)
- [j43]Clement W. H. Lam, Sigmund Lam, Vladimir D. Tonchev: Bounds on the Number of Affine, Symmetric, and Hadamard Designs and Matrices. J. Comb. Theory, Ser. A 92(2): 186-196 (2000)
1990 – 1999
- 1999
- [j42]Vladimir D. Tonchev: Linear Perfect Codes and a Characterization of the Classical Designs. Des. Codes Cryptography 17(1-3): 121-128 (1999)
- 1998
- [j41]Gary McGuire, Vladimir D. Tonchev, Harold N. Ward: Characterizing the Hermitian and Ree Unitals on 28 Points. Des. Codes Cryptography 13(1): 57-61 (1998)
- [j40]David B. Jaffe, Vladimir D. Tonchev: Computing Linear Codes and Unitals. Des. Codes Cryptography 14(1): 39-52 (1998)
- [j39]Zvonimir Janko, Vladimir D. Tonchev: New Designs with Block Size 7. J. Comb. Theory, Ser. A 83(1): 152-157 (1998)
- [j38]Vladimir D. Tonchev: Maximum Disjoint Bases and Constant-Weight Codes. IEEE Transactions on Information Theory 44(1): 333-334 (1998)
- 1997
- [j37]Marijn van Eupen, Vladimir D. Tonchev: Linear Codes and the Existence of a Reversible Hadamard Difference Set in Z2xZ2xZ45. J. Comb. Theory, Ser. A 79(1): 161-167 (1997)
- [j36]Vladimir D. Tonchev: Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs. IEEE Transactions on Information Theory 43(3): 1021-1025 (1997)
- 1996
- [j35]Alphonse Baartmans, Ivan N. Landjev, Vladimir D. Tonchev: On the Binary Codes of Steiner Triple Systems. Des. Codes Cryptography 8(1-2): 29-43 (1996)
- [j34]Willem H. Haemers, Vladimir D. Tonchev: Spreads in Strongly Regular Graphs. Des. Codes Cryptography 8(1-2): 145-157 (1996)
- [j33]Vladimir D. Tonchev: Special Issue Containing Papers Presented at the Second Upper Michigan Combinatorics Workshop on Designs, Codes and Geometries - Preface. Des. Codes Cryptography 9(1): 5-6 (1996)
- [j32]Vladimir D. Tonchev: The uniformly packed binary [27, 21, 3] and [35, 29, 3] codes. Discrete Mathematics 149(1-3): 283-288 (1996)
- [j31]Vladimir D. Tonchev, Vassil Y. Yorgov: The existence of certain extremal [54, 27, 10] self-dual codes. IEEE Transactions on Information Theory 42(5): 1628-1631 (1996)
- 1995
- [j30]Clement W. H. Lam, Larry H. Thiel, Vladimir D. Tonchev: On Quasi-Symmetric 2-(28, 12, 11) and 2-(36, 16, 12) Designs. Des. Codes Cryptography 5(1): 43-55 (1995)
- [j29]W. Cary Huffman, Vladimir D. Tonchev: The Existence of Extremal Self-Dual [50, 25, 10] Codes and Quasi-Symmetric 2-(49, 9, 6) Designs. Des. Codes Cryptography 6(2): 97-106 (1995)
- [c1]Masaaki Harada, Vladimir D. Tonchev: Singly-Even Self-Dual Codes and Hadamard Matrices. AAECC 1995: 279-284
- 1994
- [j28]Christopher Parker, Edward Spence, Vladimir D. Tonchev: Designs with the Symmetric Difference Property on 64 Points and Their Groups. J. Comb. Theory, Ser. A 67(1): 23-43 (1994)
- 1993
- [j27]Willem H. Haemers, Christopher Parker, Vera Pless, Vladimir D. Tonchev: A Design and a Code Invariant under the Simple Group Co3. J. Comb. Theory, Ser. A 62(2): 225-233 (1993)
- [j26]Jack H. van Lint, Vladimir D. Tonchev: A Class of Non-embeddable Designs. J. Comb. Theory, Ser. A 62(2): 252-260 (1993)
- [j25]Vera Pless, Vladimir D. Tonchev, Jeffrey S. Leon: On the existence of a certain (64, 32, 12) extremal code. IEEE Transactions on Information Theory 39(1): 214-215 (1993)
- 1992
- [j24]Charles J. Colbourn, Eric Mendelsohn, Cheryl E. Praeger, Vladimir D. Tonchev: Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems. Des. Codes Cryptography 2(3): 237-251 (1992)
- [j23]Vladimir D. Tonchev: Some small non-embeddable designs. Discrete Mathematics 106-107: 489-492 (1992)
- [j22]Vladimir D. Tonchev, Scott A. Vanstone: On Kirkman triple systems of order 33. Discrete Mathematics 106-107: 493-496 (1992)
- [j21]Edward Spence, Vladimir D. Tonchev: Extremal self-dual codes from symmetric designs. Discrete Mathematics 110(1-3): 265-268 (1992)
- [j20]Dieter Jungnickel, Vladimir D. Tonchev: On Symmetric and Quasi-Symmetric Designs with the Symmetric Difference Property and Their Codes. J. Comb. Theory, Ser. A 59(1): 40-50 (1992)
- 1991
- [j19]Vladimir D. Tonchev: Self-dual codes and Hadamard matrices. Discrete Applied Mathematics 33(1-3): 235-240 (1991)
- [j18]Dieter Jungnickel, Vladimir D. Tonchev: Exponential Number of Quasi-Symmetric SDP Designs and Codes Meeting. Des. Codes Cryptography 1(3): 247-253 (1991)
- [j17]Zvonimir Janko, Vladimir D. Tonchev: Cyclic 2-(91, 6, 1) designs with multiplier automorphisms. Discrete Mathematics 97(1-3): 265-268 (1991)
- 1990
- [j16]Frans C. Bussemaker, Vladimir D. Tonchev: Extremal doubly-even codes of length 40 derived from Hadamard matrices of order 20. Discrete Mathematics 82(3): 317-321 (1990)
- [j15]Stoyan N. Kapralov, Vladimir D. Tonchev: Extremal doubly-even codes of length 64 derived from symmetric designs. Discrete Mathematics 83(2-3): 285-289 (1990)
1980 – 1989
- 1989
- [j14]Frans C. Bussemaker, Vladimir D. Tonchev: New extremal doubly-even codes of length 56 derived from Hadamard matrices of order 28. Discrete Mathematics 76(1): 45-49 (1989)
- [j13]Ivan N. Landgev, Vladimir D. Tonchev: Automorphisms of 2-(22, 8, 4) designs. Discrete Mathematics 77(1-3): 177-189 (1989)
- [j12]Vladimir D. Tonchev: Self-orthogonal designs and extremal doubly even codes. J. Comb. Theory, Ser. A 52(2): 197-205 (1989)
- 1988
- [j11]Stefan M. Dodunekov, Krassimir N. Manev, Vladimir D. Tonchev: On the covering radius of binary [14, 6] codes containing the all-one vector. IEEE Transactions on Information Theory 34(3): 591-593 (1988)
- 1987
- [j10]Vladimir D. Tonchev: Transitive Steiner triple systems of order 25. Discrete Mathematics 67(2): 211-214 (1987)
- [j9]Vera Pless, Vladimir D. Tonchev: Self-dual codes over GF(7). IEEE Transactions on Information Theory 33(5): 723-727 (1987)
- 1986
- [j8]Vladimir D. Tonchev: Quasi-symmetric 2-(31, 7, 7) designs and a revision of Hamada's conjecture. J. Comb. Theory, Ser. A 42(1): 104-110 (1986)
- [j7]Vladimir D. Tonchev: A characterization of designs related to dodecads in the witt system S(5, 8, 24). J. Comb. Theory, Ser. A 43(2): 219-227 (1986)
- 1985
- [j6]Vladimir D. Tonchev: Hadamard Matrices of Order 28 with Automorphisms of Order 7. J. Comb. Theory, Ser. A 40(1): 62-81 (1985)
- 1984
- [j5]Vladimir D. Tonchev: The isomorphism of the Cohen, Haemers-van Lint and De Clerck-Dye-Thas partial geometries. Discrete Mathematics 49(2): 213-217 (1984)
- [j4]Jack H. van Lint, Vladimir D. Tonchev: Nonembeddable Quasi-residual Designs with Large K. J. Comb. Theory, Ser. A 37(3): 359-362 (1984)
- 1983
- [j3]Vladimir D. Tonchev: Hadamard Matrices of Order 28 with Automorphisms of Order 13. J. Comb. Theory, Ser. A 35(1): 43-57 (1983)
- 1980
- [j2]Vladimir D. Tonchev: On the Mutual Embeddability of (2k, k, k - 1) and (2k - 1, k, k) Quasi-Residual Designs. J. Comb. Theory, Ser. A 29(3): 329-335 (1980)
- [j1]Jordan D. Denev, Vladimir D. Tonchev: On the number of equivalence classes of Boolean functions under a transformation group (Corresp.). IEEE Transactions on Information Theory 26(5): 625-626 (1980)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-14 22:37 CEST by the dblp team