default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir D. Tonchev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j101]Makoto Araya, Masaaki Harada, Vladimir D. Tonchev:
Hadamard Matrices of Orders 60 and 64 with Automorphisms of Orders 29 and 31. Electron. J. Comb. 31(1) (2024)- [j100]Hadi Kharaghani, Thomas Pender, Vladimir D. Tonchev:
On optimal constant weight codes derived from ømega-circulant balanced generalized weighing matrices. Des. Codes Cryptogr. 92(10): 2791-2799 (2024) - 2023
- [i11]Makoto Araya, Masaaki Harada, Vladimir D. Tonchev:
Hadamard matrices of orders 60 and 64 with automorphisms of orders 29 and 31. CoRR abs/2307.08983 (2023) - 2022
- [j99]Akihiro Munemasa, Vladimir D. Tonchev:
Quasi-symmetric 2-(41, 9, 9) designs and doubly even self-dual codes of length 40. Appl. Algebra Eng. Commun. Comput. 33(6): 855-866 (2022) - [j98]Vladimir D. Tonchev, Alfred Wassermann:
On the classification of unitals on 28 points of low rank. Appl. Algebra Eng. Commun. Comput. 33(6): 903-913 (2022) - [j97]Vladimir D. Tonchev:
Book Review: "Designs from Linear Codes", second edition, by Cunsheng Ding and Chunming Tang, World Scientific, 2022. Des. Codes Cryptogr. 90(7): 1595-1597 (2022) - [j96]Vladimir D. Tonchev
:
On Pless symmetry codes, ternary QR codes, and related Hadamard matrices and designs. Des. Codes Cryptogr. 90(11): 2753-2762 (2022) - [j95]Qi Liu, Cunsheng Ding, Sihem Mesnager, Chunming Tang, Vladimir D. Tonchev:
On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences. IEEE Trans. Inf. Theory 68(5): 3096-3107 (2022) - 2021
- [j94]Cunsheng Ding, Chunming Tang, Vladimir D. Tonchev:
The projective general linear group ${\mathrm {PGL}}(2, 2^m)$ and linear codes of length 2m+1. Des. Codes Cryptogr. 89(7): 1713-1734 (2021) - [i10]Qi Liu, Cunsheng Ding, Sihem Mesnager, Chunming Tang, Vladimir D. Tonchev:
On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and their Consequences. CoRR abs/2109.09051 (2021) - 2020
- [j93]Mustafa Gezek, Rudi Mathon, Vladimir D. Tonchev:
Maximal Arcs, Codes, and New Links Between Projective Planes of Order 16. Electron. J. Comb. 27(1): 1 (2020) - [j92]Cunsheng Ding, Chunming Tang, Vladimir D. Tonchev:
Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes. Des. Codes Cryptogr. 88(4): 625-641 (2020) - [i9]Cunsheng Ding, Chunming Tang, Vladimir D. Tonchev:
The Projective General Linear Group PGL2(GF(2sm)) and Linear Codes of Length 2m+1. CoRR abs/2010.09448 (2020)
2010 – 2019
- 2019
- [j91]Dean Crnkovic, Andrea Svob, Vladimir D. Tonchev:
Cyclotomic Trace Codes. Algorithms 12(8): 168 (2019) - [j90]Stefaan De Winter, Cunsheng Ding, Vladimir D. Tonchev:
Maximal arcs and extended cyclic codes. Des. Codes Cryptogr. 87(4): 807-816 (2019) - [j89]Dieter Jungnickel, Spyros S. Magliveras, Vladimir D. Tonchev, Alfred Wassermann:
The classification of Steiner triple systems on 27 points with 3-rank 24. Des. Codes Cryptogr. 87(4): 831-839 (2019) - [j88]Dieter Jungnickel, Vladimir D. Tonchev:
Counting Steiner triple systems with classical parameters and prescribed rank. J. Comb. Theory A 162: 10-33 (2019) - [j87]Cunsheng Ding, Akihiro Munemasa, Vladimir D. Tonchev:
Bent Vectorial Functions, Codes and Designs. IEEE Trans. Inf. Theory 65(11): 7533-7541 (2019) - [i8]Cunsheng Ding, Chunming Tang, Vladimir D. Tonchev:
Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes. CoRR abs/1907.13032 (2019) - 2018
- [j86]Dieter Jungnickel, Vladimir D. Tonchev:
On Bonisoli's theorem and the block codes of Steiner triple systems. Des. Codes Cryptogr. 86(3): 449-462 (2018) - [j85]Dieter Jungnickel, Yue Zhou, Vladimir D. Tonchev:
Extension sets, affine designs, and Hamada's conjecture. Des. Codes Cryptogr. 86(3): 587-610 (2018) - [j84]Dieter Jungnickel, Vladimir D. Tonchev:
The classification of antipodal two-weight linear codes. Finite Fields Their Appl. 50: 372-381 (2018) - [j83]Cunsheng Ding, Hao Liu, Vladimir D. Tonchev:
All Binary Linear Codes That Are Invariant Under PSL2(n). IEEE Trans. Inf. Theory 64(8): 5769-5775 (2018) - 2017
- [j82]Vladimir D. Tonchev:
On resolvable Steiner 2-designs and maximal arcs in projective planes. Des. Codes Cryptogr. 84(1-2): 165-172 (2017) - [j81]Vladimir D. Tonchev:
Linearly embeddable designs. Des. Codes Cryptogr. 85(2): 233-247 (2017) - [j80]Dean Crnkovic, Bernardo Gabriel Rodrigues, Sanja Rukavina, Vladimir D. Tonchev:
Quasi-symmetric 2-(64, 24, 46) designs derived from AG(3, 4). Discret. Math. 340(10): 2472-2478 (2017) - [c9]Dieter Jungnickel, Spyros S. Magliveras, Vladimir D. Tonchev, Alfred Wassermann:
On Classifying Steiner Triple Systems by Their 3-Rank. MACIS 2017: 295-305 - [i7]Cunsheng Ding, Hao Liu, Vladimir D. Tonchev:
All binary linear codes that are invariant under PSL2(n). CoRR abs/1704.01199 (2017) - 2016
- [j79]Masaaki Harada, Ethan Novak, Vladimir D. Tonchev:
The weight distribution of the self-dual [128, 64] polarity design code. Adv. Math. Commun. 10(3): 643-648 (2016) - [i6]Masaaki Harada, Ethan Novak, Vladimir D. Tonchev:
The weight distribution of the self-dual $[128, 64]$ polarity design code. CoRR abs/1602.04661 (2016) - 2015
- [j78]Dieter Jungnickel, Vladimir D. Tonchev:
Maximal arcs and quasi-symmetric designs. Des. Codes Cryptogr. 77(2-3): 365-374 (2015) - [p3]Vladimir D. Tonchev:
Galois geometries, codes, and new invariants for incidence structures. Advances on Superelliptic Curves and their Applications 2015: 360-371 - 2014
- [c8]Bernardo Gabriel Rodrigues, Vladimir D. Tonchev:
On Quasi-symmetric 2-(64, 24, 46) Designs Derived from Codes. ICMCTA 2014: 327-333 - [c7]David Clark, Vladimir D. Tonchev:
The Nonexistence of (18, 3, 18, 6) Relative Difference Sets. SETA 2014: 149-153 - 2013
- [j77]David Clark, Vladimir D. Tonchev:
A new class of majority-logic decodable codes derived from polarity designs. Adv. Math. Commun. 7(2): 175-186 (2013) - [j76]David Clark, Vladimir D. Tonchev:
Enumeration of (16, 4, 16, 4) Relative Difference Sets. Electron. J. Comb. 20(1): 72 (2013) - [j75]Dieter Jungnickel, Vladimir D. Tonchev:
New invariants for incidence structures. Des. Codes Cryptogr. 68(1-3): 163-177 (2013) - [j74]Yuichiro Fujiwara, Vladimir D. Tonchev:
High-Rate Self-Synchronizing Codes. IEEE Trans. Inf. Theory 59(4): 2328-2335 (2013) - [j73]Yuichiro Fujiwara, Vladimir D. Tonchev:
A Characterization of Entanglement-Assisted Quantum Low-Density Parity-Check Codes. IEEE Trans. Inf. Theory 59(6): 3347-3353 (2013) - [i5]Yuichiro Fujiwara, Vladimir D. Tonchev, Tony W. H. Wong:
Algebraic techniques in designing quantum synchronizable codes. CoRR abs/1304.0502 (2013) - [i4]Vladimir D. Tonchev:
A doubling construction for self-orthogonal codes. CoRR abs/1311.2549 (2013) - 2012
- [j72]Dieter Jungnickel, Vladimir D. Tonchev:
A Hamada type characterization of the classical geometric designs. Des. Codes Cryptogr. 65(1-2): 15-28 (2012) - [j71]David Clark, Vladimir D. Tonchev:
Nonbinary quantum codes derived from finite geometries. Finite Fields Their Appl. 18(1): 63-69 (2012) - [c6]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
- [j70]David Clark, Dieter Jungnickel, Vladimir D. Tonchev:
Affine geometry designs, polarities, and Hamada's conjecture. J. Comb. Theory 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:
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 [contents] - [i2]Yuichiro Fujiwara, Vladimir D. Tonchev:
A characterization of entanglement-assisted quantum low-density parity-check codes. CoRR abs/1108.0679 (2011) - 2010
- [j69]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. Electron. J. Comb. 17(1) (2010) - [j68]Dieter Jungnickel, Vladimir D. Tonchev:
The number of designs with geometric parameters grows exponentially. Des. Codes Cryptogr. 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
- [j67]Dieter Jungnickel, Vladimir D. Tonchev:
Polarities, quasi-symmetric designs, and Hamada's conjecture. Des. Codes Cryptogr. 51(2): 131-140 (2009) - [j66]Vladimir D. Tonchev:
Generalized weighing matrices and self-orthogonal codes. Discret. Math. 309(14): 4697-4699 (2009) - [c5]Hao Wang, Vladimir D. Tonchev:
An algorithm for optimal comma free codes with isomorphism rejection. SAC 2009: 1007-1008 - [p1]Vladimir D. Tonchev:
Combinatorial Designs and Code Synchronization. Algebraic Aspects of Digital Communications 2009: 81-99 - 2008
- [j65]Vassili C. Mavron, T. P. McDonough, Vladimir D. Tonchev:
On affine designs and Hadamard designs with line spreads. Discret. Math. 308(13): 2742-2750 (2008) - [j64]Yukiyasu Mutoh, Vladimir D. Tonchev:
Difference systems of sets and cyclotomy. Discret. Math. 308(14): 2959-2969 (2008) - [j63]Vladimir D. Tonchev:
Quantum codes from caps. Discret. Math. 308(24): 6368-6372 (2008) - [j62]Vladimir D. Tonchev:
Steiner systems for two-stage disjunctive testing. J. Comb. Optim. 15(1): 1-6 (2008) - 2007
- [j61]Vladimir D. Tonchev, Hao Wang:
An algorithm for optimal difference systems of sets. J. Comb. Optim. 14(2-3): 165-175 (2007) - [j60]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 Trans. Inf. Theory 53(8): 2732-2742 (2007) - 2006
- [j59]Ryoh Fuji-Hara, Akihiro Munemasa, Vladimir D. Tonchev:
Hyperplane partitions and difference systems of sets. J. Comb. Theory A 113(8): 1689-1698 (2006) - [c4]Vladimir D. Tonchev, Hao Wang:
Optimal Difference Systems of Sets with Multipliers. CSR 2006: 612-618 - [c3]Vladimir D. Tonchev:
Code Synchronization, Cyclotomy, and Finite Geometry. ITW 2006: 270-274 - 2005
- [j58]Masaaki Harada, Clement W. H. Lam, Vladimir D. Tonchev:
Symmetric (4,4)-Nets and Generalized Hadamard Matrices Over Groups of Order 4. Des. Codes Cryptogr. 34(1): 71-87 (2005) - [j57]Vladimir D. Tonchev:
Affine designs and linear orthogonal arrays. Discret. Math. 294(1-2): 219-222 (2005) - [j56]Vladimir D. Tonchev:
Partitions of difference sets and code synchronization. Finite Fields Their Appl. 11(3): 601-621 (2005) - [c2]Vladimir I. Levenshtein, Vladimir D. Tonchev:
Optimal conflict-avoiding codes for three active users. ISIT 2005: 535-537 - 2004
- [j55]Akihiro Munemasa, Vladimir D. Tonchev:
A new quasi-symmetric 2-(56, 16, 6) design obtained from codes. Discret. Math. 284(1-3): 231-234 (2004) - [j54]Vladimir D. Tonchev:
On generalized Hadamard matrices of minimum rank. Finite Fields Their Appl. 10(4): 522-529 (2004) - 2003
- [j53]Vladimir D. Tonchev:
A Note on MDS Codes, n-Arcs and Complete Designs. Des. Codes Cryptogr. 29(1-3): 247-250 (2003) - [j52]Masaaki Harada, Vladimir D. Tonchev:
Self-orthogonal Codes from Symmetric Designs with Fixed-point-free Auto-morphisms. Discret. Math. 264(1-3): 81-90 (2003) - [j51]Anton Betten, Dieter Betten, Vladimir D. Tonchev:
Unitals and codes. Discret. Math. 267(1-3): 23-33 (2003) - 2002
- [j50]Vladimir D. Tonchev:
Error-correcting codes from graphs. Discret. Math. 257(2-3): 549-557 (2002) - [j49]Vladimir D. Tonchev:
A Varshamov-Gilbert bound for a class of formally self-dual codes and related quantum codes. IEEE Trans. Inf. Theory 48(4): 975-977 (2002) - 2001
- [j48]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 Cryptogr. 24(2): 225-232 (2001) - [j47]Dieter Jungnickel, Vladimir D. Tonchev:
Perfect Codes and Balanced Generalized Weighing Matrices, II. Electron. Notes Discret. Math. 6: 113-122 (2001) - [j46]Vladimir D. Tonchev:
A Mass Formula for Steiner Triple Systems STS(2n-1) of 2-Rank 2n-n. J. Comb. Theory A 95(2): 197-208 (2001) - 2000
- [j45]Stoicho D. Stoichev, Vladimir D. Tonchev:
Unital designs in planes of order 16. Discret. Appl. Math. 102(1-2): 151-158 (2000) - [j44]Clement W. H. Lam, Sigmund Lam, Vladimir D. Tonchev:
Bounds on the Number of Affine, Symmetric, and Hadamard Designs and Matrices. J. Comb. Theory A 92(2): 186-196 (2000)
1990 – 1999
- 1999
- [j43]Vladimir D. Tonchev:
Linear Perfect Codes and a Characterization of the Classical Designs. Des. Codes Cryptogr. 17(1-3): 121-128 (1999) - 1998
- [j42]Gary McGuire, Vladimir D. Tonchev, Harold N. Ward:
Characterizing the Hermitian and Ree Unitals on 28 Points. Des. Codes Cryptogr. 13(1): 57-61 (1998) - [j41]David B. Jaffe, Vladimir D. Tonchev:
Computing Linear Codes and Unitals. Des. Codes Cryptogr. 14(1): 39-52 (1998) - [j40]Zvonimir Janko, Vladimir D. Tonchev:
New Designs with Block Size 7. J. Comb. Theory A 83(1): 152-157 (1998) - [j39]Vladimir D. Tonchev:
Maximum Disjoint Bases and Constant-Weight Codes. IEEE Trans. Inf. Theory 44(1): 333-334 (1998) - 1997
- [j38]Marijn van Eupen, Vladimir D. Tonchev:
Linear Codes and the Existence of a Reversible Hadamard Difference Set in Z2xZ2xZ45. J. Comb. Theory A 79(1): 161-167 (1997) - [j37]Vladimir D. Tonchev:
Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs. IEEE Trans. Inf. Theory 43(3): 1021-1025 (1997) - 1996
- [j36]Alphonse Baartmans, Ivan N. Landjev, Vladimir D. Tonchev:
On the Binary Codes of Steiner Triple Systems. Des. Codes Cryptogr. 8(1-2): 29-43 (1996) - [j35]Willem H. Haemers, Vladimir D. Tonchev:
Spreads in Strongly Regular Graphs. Des. Codes Cryptogr. 8(1-2): 145-157 (1996) - [j34]Vladimir D. Tonchev:
Special Issue Containing Papers Presented at the Second Upper Michigan Combinatorics Workshop on Designs, Codes and Geometries - Preface. Des. Codes Cryptogr. 9(1): 5-6 (1996) - [j33]Vladimir D. Tonchev:
The uniformly packed binary [27, 21, 3] and [35, 29, 3] codes. Discret. Math. 149(1-3): 283-288 (1996) - [j32]Vladimir D. Tonchev, Vassil Y. Yorgov:
The existence of certain extremal [54, 27, 10] self-dual codes. IEEE Trans. Inf. Theory 42(5): 1628-1631 (1996) - 1995
- [j31]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 Cryptogr. 5(1): 43-55 (1995) - [j30]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 Cryptogr. 6(2): 97-106 (1995) - [c1]Masaaki Harada, Vladimir D. Tonchev:
Singly-Even Self-Dual Codes and Hadamard Matrices. AAECC 1995: 279-284 - 1994
- [j29]Christopher Parker, Edward Spence, Vladimir D. Tonchev:
Designs with the Symmetric Difference Property on 64 Points and Their Groups. J. Comb. Theory A 67(1): 23-43 (1994) - 1993
- [j28]Willem H. Haemers, Christopher Parker, Vera Pless, Vladimir D. Tonchev:
A Design and a Code Invariant under the Simple Group Co3. J. Comb. Theory A 62(2): 225-233 (1993) - [j27]Jack H. van Lint, Vladimir D. Tonchev:
A Class of Non-embeddable Designs. J. Comb. Theory A 62(2): 252-260 (1993) - [j26]Vera Pless, Vladimir D. Tonchev, Jeffrey S. Leon:
On the existence of a certain (64, 32, 12) extremal code. IEEE Trans. Inf. Theory 39(1): 214-215 (1993) - 1992
- [j25]Charles J. Colbourn, Eric Mendelsohn, Cheryl E. Praeger, Vladimir D. Tonchev:
Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems. Des. Codes Cryptogr. 2(3): 237-251 (1992) - [j24]Vladimir D. Tonchev:
Some small non-embeddable designs. Discret. Math. 106-107: 489-492 (1992) - [j23]Vladimir D. Tonchev, Scott A. Vanstone:
On Kirkman triple systems of order 33. Discret. Math. 106-107: 493-496 (1992) - [j22]Edward Spence, Vladimir D. Tonchev:
Extremal self-dual codes from symmetric designs. Discret. Math. 110(1-3): 265-268 (1992) - [j21]Dieter Jungnickel, Vladimir D. Tonchev:
On Symmetric and Quasi-Symmetric Designs with the Symmetric Difference Property and Their Codes. J. Comb. Theory A 59(1): 40-50 (1992) - 1991
- [j20]Vladimir D. Tonchev:
Self-dual codes and Hadamard matrices. Discret. Appl. Math. 33(1-3): 235-240 (1991) - [j19]Dieter Jungnickel, Vladimir D. Tonchev:
Exponential Number of Quasi-Symmetric SDP Designs and Codes Meeting. Des. Codes Cryptogr. 1(3): 247-253 (1991) - [j18]Zvonimir Janko, Vladimir D. Tonchev:
Cyclic 2-(91, 6, 1) designs with multiplier automorphisms. Discret. Math. 97(1-3): 265-268 (1991) - 1990
- [j17]Frans C. Bussemaker, Vladimir D. Tonchev:
Extremal doubly-even codes of length 40 derived from Hadamard matrices of order 20. Discret. Math. 82(3): 317-321 (1990) - [j16]Stoyan N. Kapralov, Vladimir D. Tonchev:
Extremal doubly-even codes of length 64 derived from symmetric designs. Discret. Math. 83(2-3): 285-289 (1990)
1980 – 1989
- 1989
- [j15]Frans C. Bussemaker, Vladimir D. Tonchev:
New extremal doubly-even codes of length 56 derived from Hadamard matrices of order 28. Discret. Math. 76(1): 45-49 (1989) - [j14]Ivan N. Landgev, Vladimir D. Tonchev:
Automorphisms of 2-(22, 8, 4) designs. Discret. Math. 77(1-3): 177-189 (1989) - [j13]Vladimir D. Tonchev:
Self-orthogonal designs and extremal doubly even codes. J. Comb. Theory A 52(2): 197-205 (1989) - 1988
- [j12]Stefan M. Dodunekov, Krassimir N. Manev, Vladimir D. Tonchev:
On the covering radius of binary [14, 6] codes containing the all-one vector. IEEE Trans. Inf. Theory 34(3): 591-593 (1988) - 1987
- [j11]Vladimir D. Tonchev:
Transitive Steiner triple systems of order 25. Discret. Math. 67(2): 211-214 (1987) - [j10]Vera Pless, Vladimir D. Tonchev:
Self-dual codes over GF(7). IEEE Trans. Inf. Theory 33(5): 723-727 (1987) - 1986
- [j9]Vladimir D. Tonchev:
Quasi-symmetric Designs and Self-dual Codes. Eur. J. Comb. 7(1): 67-73 (1986) - [j8]Vladimir D. Tonchev:
Quasi-symmetric 2-(31, 7, 7) designs and a revision of Hamada's conjecture. J. Comb. Theory 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 A 43(2): 219-227 (1986) - 1985
- [j6]Vladimir D. Tonchev:
Hadamard Matrices of Order 28 with Automorphisms of Order 7. J. Comb. Theory 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. Discret. Math. 49(2): 213-217 (1984) - [j4]Jack H. van Lint, Vladimir D. Tonchev:
Nonembeddable Quasi-residual Designs with Large K. J. Comb. Theory A 37(3): 359-362 (1984) - 1983
- [j3]Vladimir D. Tonchev:
Hadamard Matrices of Order 28 with Automorphisms of Order 13. J. Comb. Theory 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 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 Trans. Inf. Theory 26(5): 625-626 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
