On the Mutual Embeddability of (2k, k, k - 1) and (2k - 1, k, k) Quasi-Residual Designs. - Vladimir D. Tonchev (J. Comb. Theory A, 1980)

On the number of equivalence classes of Boolean functions under a transformation group (Corresp.). - Jordan D. Denev; Vladimir D. Tonchev (IEEE Trans. Inf. Theory, 1980)

Hadamard Matrices of Order 28 with Automorphisms of Order 13. - Vladimir D. Tonchev (J. Comb. Theory A, 1983)

The isomorphism of the Cohen, Haemers-van Lint and De Clerck-Dye-Thas partial geometries. - Vladimir D. Tonchev (Discret. Math., 1984)

Nonembeddable Quasi-residual Designs with Large K. - Jack H. van Lint; Vladimir D. Tonchev (J. Comb. Theory A, 1984)

Hadamard Matrices of Order 28 with Automorphisms of Order 7. - Vladimir D. Tonchev (J. Comb. Theory A, 1985)

Quasi-symmetric Designs and Self-dual Codes. - Vladimir D. Tonchev (Eur. J. Comb., 1986)

A characterization of designs related to dodecads in the witt system S(5, 8, 24). - Vladimir D. Tonchev (J. Comb. Theory A, 1986)

Quasi-symmetric 2-(31, 7, 7) designs and a revision of Hamada's conjecture. - Vladimir D. Tonchev (J. Comb. Theory A, 1986)

Transitive Steiner triple systems of order 25. - Vladimir D. Tonchev (Discret. Math., 1987)

Self-dual codes over GF(7). - Vera Pless; Vladimir D. Tonchev (IEEE Trans. Inf. Theory, 1987)

On the covering radius of binary [14, 6] codes containing the all-one vector. - Stefan M. Dodunekov; Krassimir N. Manev; Vladimir D. Tonchev (IEEE Trans. Inf. Theory, 1988)

New extremal doubly-even codes of length 56 derived from Hadamard matrices of order 28. - Frans C. Bussemaker; Vladimir D. Tonchev (Discret. Math., 1989)

Automorphisms of 2-(22, 8, 4) designs. - Ivan N. Landgev; Vladimir D. Tonchev (Discret. Math., 1989)

Self-orthogonal designs and extremal doubly even codes. - Vladimir D. Tonchev (J. Comb. Theory A, 1989)

Extremal doubly-even codes of length 40 derived from Hadamard matrices of order 20. - Frans C. Bussemaker; Vladimir D. Tonchev (Discret. Math., 1990)

Extremal doubly-even codes of length 64 derived from symmetric designs. - Stoyan N. Kapralov; Vladimir D. Tonchev (Discret. Math., 1990)

Self-dual codes and Hadamard matrices. - Vladimir D. Tonchev (Discret. Appl. Math., 1991)

Exponential Number of Quasi-Symmetric SDP Designs and Codes Meeting. - Dieter Jungnickel; Vladimir D. Tonchev (Des. Codes Cryptogr., 1991)

Cyclic 2-(91, 6, 1) designs with multiplier automorphisms. - Zvonimir Janko; Vladimir D. Tonchev (Discret. Math., 1991)

Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems. - Charles J. Colbourn; Eric Mendelsohn; Cheryl E. Praeger; Vladimir D. Tonchev (Des. Codes Cryptogr., 1992)

Extremal self-dual codes from symmetric designs. - Edward Spence; Vladimir D. Tonchev (Discret. Math., 1992)

Some small non-embeddable designs. - Vladimir D. Tonchev (Discret. Math., 1992)

On Kirkman triple systems of order 33. - Vladimir D. Tonchev; Scott A. Vanstone (Discret. Math., 1992)

On Symmetric and Quasi-Symmetric Designs with the Symmetric Difference Property and Their Codes. - Dieter Jungnickel; Vladimir D. Tonchev (J. Comb. Theory A, 1992)

A Design and a Code Invariant under the Simple Group Co3. - Willem H. Haemers; Christopher Parker; Vera Pless; Vladimir D. Tonchev (J. Comb. Theory A, 1993)

A Class of Non-embeddable Designs. - Jack H. van Lint; Vladimir D. Tonchev (J. Comb. Theory A, 1993)

On the existence of a certain (64, 32, 12) extremal code. - Vera Pless; Vladimir D. Tonchev; Jeffrey S. Leon (IEEE Trans. Inf. Theory, 1993)

Designs with the Symmetric Difference Property on 64 Points and Their Groups. - Christopher Parker; Edward Spence; Vladimir D. Tonchev (J. Comb. Theory A, 1994)

Singly-Even Self-Dual Codes and Hadamard Matrices. - Masaaki Harada; Vladimir D. Tonchev (AAECC, 1995)

The Existence of Extremal Self-Dual [50, 25, 10] Codes and Quasi-Symmetric 2-(49, 9, 6) Designs. - W. Cary Huffman; Vladimir D. Tonchev (Des. Codes Cryptogr., 1995)

On Quasi-Symmetric 2-(28, 12, 11) and 2-(36, 16, 12) Designs. - Clement W. H. Lam; Larry H. Thiel; Vladimir D. Tonchev (Des. Codes Cryptogr., 1995)

On the Binary Codes of Steiner Triple Systems. - Alphonse Baartmans; Ivan N. Landjev; Vladimir D. Tonchev (Des. Codes Cryptogr., 1996)

Spreads in Strongly Regular Graphs. - Willem H. Haemers; Vladimir D. Tonchev (Des. Codes Cryptogr., 1996)

Special Issue Containing Papers Presented at the Second Upper Michigan Combinatorics Workshop on Designs, Codes and Geometries - Preface. - Vladimir D. Tonchev (Des. Codes Cryptogr., 1996)

The uniformly packed binary [27, 21, 3] and [35, 29, 3] codes. - Vladimir D. Tonchev (Discret. Math., 1996)

The existence of certain extremal [54, 27, 10] self-dual codes. - Vladimir D. Tonchev; Vassil Y. Yorgov (IEEE Trans. Inf. Theory, 1996)

Linear Codes and the Existence of a Reversible Hadamard Difference Set in Z2xZ2xZ45. - Marijn van Eupen; Vladimir D. Tonchev (J. Comb. Theory A, 1997)

Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs. - Vladimir D. Tonchev (IEEE Trans. Inf. Theory, 1997)

Computing Linear Codes and Unitals. - David B. Jaffe; Vladimir D. Tonchev (Des. Codes Cryptogr., 1998)

Characterizing the Hermitian and Ree Unitals on 28 Points. - Gary McGuire; Vladimir D. Tonchev; Harold N. Ward (Des. Codes Cryptogr., 1998)

New Designs with Block Size 7. - Zvonimir Janko; Vladimir D. Tonchev (J. Comb. Theory A, 1998)

Maximum Disjoint Bases and Constant-Weight Codes. - Vladimir D. Tonchev (IEEE Trans. Inf. Theory, 1998)

Linear Perfect Codes and a Characterization of the Classical Designs. - Vladimir D. Tonchev (Des. Codes Cryptogr., 1999)

Unital designs in planes of order 16. - Stoicho D. Stoichev; Vladimir D. Tonchev (Discret. Appl. Math., 2000)

Bounds on the Number of Affine, Symmetric, and Hadamard Designs and Matrices. - Clement W. H. Lam; Sigmund Lam; Vladimir D. Tonchev (J. Comb. Theory A, 2000)

The Existence of a Bush-Type Hadamard Matrix of Order 324 and Two New Infinite Classes of Symmetric Designs. - Zvonimir Janko; Hadi Kharaghani; Vladimir D. Tonchev (Des. Codes Cryptogr., 2001)

Perfect Codes and Balanced Generalized Weighing Matrices, II. - Dieter Jungnickel; Vladimir D. Tonchev (Electron. Notes Discret. Math., 2001)

A Mass Formula for Steiner Triple Systems STS(2n-1) of 2-Rank 2n-n. - Vladimir D. Tonchev (J. Comb. Theory A, 2001)

Error-correcting codes from graphs. - Vladimir D. Tonchev (Discret. Math., 2002)

A Varshamov-Gilbert bound for a class of formally self-dual codes and related quantum codes. - Vladimir D. Tonchev (IEEE Trans. Inf. Theory, 2002)

A Note on MDS Codes, n-Arcs and Complete Designs. - Vladimir D. Tonchev (Des. Codes Cryptogr., 2003)

Unitals and codes. - Anton Betten; Dieter Betten; Vladimir D. Tonchev (Discret. Math., 2003)

Self-orthogonal Codes from Symmetric Designs with Fixed-point-free Auto-morphisms. - Masaaki Harada; Vladimir D. Tonchev (Discret. Math., 2003)

A new quasi-symmetric 2-(56, 16, 6) design obtained from codes. - Akihiro Munemasa; Vladimir D. Tonchev (Discret. Math., 2004)

On generalized Hadamard matrices of minimum rank. - Vladimir D. Tonchev (Finite Fields Their Appl., 2004)

Optimal conflict-avoiding codes for three active users. - Vladimir I. Levenshtein; Vladimir D. Tonchev (ISIT, 2005)

Symmetric (4,4)-Nets and Generalized Hadamard Matrices Over Groups of Order 4. - Masaaki Harada; Clement W. H. Lam; Vladimir D. Tonchev (Des. Codes Cryptogr., 2005)

Affine designs and linear orthogonal arrays. - Vladimir D. Tonchev (Discret. Math., 2005)

Partitions of difference sets and code synchronization. - Vladimir D. Tonchev (Finite Fields Their Appl., 2005)

Optimal Difference Systems of Sets with Multipliers. - Vladimir D. Tonchev; Hao Wang (CSR, 2006)

Code Synchronization, Cyclotomy, and Finite Geometry. - Vladimir D. Tonchev (ITW, 2006)

Hyperplane partitions and difference systems of sets. - Ryoh Fuji-Hara; Akihiro Munemasa; Vladimir D. Tonchev (J. Comb. Theory A, 2006)

An algorithm for optimal difference systems of sets. - Vladimir D. Tonchev; Hao Wang (J. Comb. Optim., 2007)

On Conflict-Avoiding Codes of Length n=4m for Three Active Users. - Masakazu Jimbo; Miwako Mishima; Susan Janiszewski; Amin Y. Teymorian; Vladimir D. Tonchev (IEEE Trans. Inf. Theory, 2007)

On affine designs and Hadamard designs with line spreads. - Vassili C. Mavron; T. P. McDonough; Vladimir D. Tonchev (Discret. Math., 2008)

Difference systems of sets and cyclotomy. - Yukiyasu Mutoh; Vladimir D. Tonchev (Discret. Math., 2008)

Quantum codes from caps. - Vladimir D. Tonchev (Discret. Math., 2008)

Steiner systems for two-stage disjunctive testing. - Vladimir D. Tonchev (J. Comb. Optim., 2008)

An algorithm for optimal comma free codes with isomorphism rejection. - Hao Wang; Vladimir D. Tonchev (SAC, 2009)

Polarities, quasi-symmetric designs, and Hamada's conjecture. - Dieter Jungnickel; Vladimir D. Tonchev (Des. Codes Cryptogr., 2009)

Generalized weighing matrices and self-orthogonal codes. - Vladimir D. Tonchev (Discret. Math., 2009)

Combinatorial Designs and Code Synchronization. - Vladimir D. Tonchev (Algebraic Aspects of Digital Communications, 2009)

Classification of Generalized Hadamard Matrices H(6,3) and Quaternary Hermitian Self-Dual Codes of Length 18. - Masaaki Harada; Clement W. H. Lam; Akihiro Munemasa; Vladimir D. Tonchev (Electron. J. Comb., 2010)

Entanglement-assisted quantum low-density parity-check codes - Yuichiro Fujiwara; David Clark; Peter Vandendriessche; Maarten De Boeck; Vladimir D. Tonchev (CoRR, 2010)

The number of designs with geometric parameters grows exponentially. - Dieter Jungnickel; Vladimir D. Tonchev (Des. Codes Cryptogr., 2010)

Affine geometry designs, polarities, and Hamada's conjecture. - David Clark; Dieter Jungnickel; Vladimir D. Tonchev (J. Comb. Theory A, 2011)

Finite geometry designs, codes, and Hamada's conjecture. - Vladimir D. Tonchev (Information Security, Coding Theory and Related Combinatorics, 2011)

A direct product construction for high-rate self-synchronizing codes. - Yuichiro Fujiwara; Vladimir D. Tonchev (ISITA, 2012)

A Hamada type characterization of the classical geometric designs. - Dieter Jungnickel; Vladimir D. Tonchev (Des. Codes Cryptogr., 2012)

Nonbinary quantum codes derived from finite geometries. - David Clark; Vladimir D. Tonchev (Finite Fields Their Appl., 2012)

A new class of majority-logic decodable codes derived from polarity designs. - David Clark; Vladimir D. Tonchev (Adv. Math. Commun., 2013)

Enumeration of (16, 4, 16, 4) Relative Difference Sets. - David Clark; Vladimir D. Tonchev (Electron. J. Comb., 2013)

A doubling construction for self-orthogonal codes. - Vladimir D. Tonchev (CoRR, 2013)

Algebraic techniques in designing quantum synchronizable codes - Yuichiro Fujiwara; Vladimir D. Tonchev; Tony W. H. Wong (CoRR, 2013)

New invariants for incidence structures. - Dieter Jungnickel; Vladimir D. Tonchev (Des. Codes Cryptogr., 2013)

High-Rate Self-Synchronizing Codes. - Yuichiro Fujiwara; Vladimir D. Tonchev (IEEE Trans. Inf. Theory, 2013)

A Characterization of Entanglement-Assisted Quantum Low-Density Parity-Check Codes. - Yuichiro Fujiwara; Vladimir D. Tonchev (IEEE Trans. Inf. Theory, 2013)

On Quasi-symmetric 2-(64, 24, 46) Designs Derived from Codes. - Bernardo Gabriel Rodrigues; Vladimir D. Tonchev (ICMCTA, 2014)

The Nonexistence of (18, 3, 18, 6) Relative Difference Sets. - David Clark; Vladimir D. Tonchev (SETA, 2014)

Maximal arcs and quasi-symmetric designs. - Dieter Jungnickel; Vladimir D. Tonchev (Des. Codes Cryptogr., 2015)

Galois geometries, codes, and new invariants for incidence structures. - Vladimir D. Tonchev (Advances on Superelliptic Curves and their Applications, 2015)

The weight distribution of the self-dual [128, 64] polarity design code. - Masaaki Harada; Ethan Novak; Vladimir D. Tonchev (Adv. Math. Commun., 2016)

On Classifying Steiner Triple Systems by Their 3-Rank. - Dieter Jungnickel; Spyros S. Magliveras; Vladimir D. Tonchev; Alfred Wassermann (MACIS, 2017)

On resolvable Steiner 2-designs and maximal arcs in projective planes. - Vladimir D. Tonchev (Des. Codes Cryptogr., 2017)

Linearly embeddable designs. - Vladimir D. Tonchev (Des. Codes Cryptogr., 2017)

Quasi-symmetric 2-(64, 24, 46) designs derived from AG(3, 4). - Dean Crnkovic; Bernardo Gabriel Rodrigues; Sanja Rukavina; Vladimir D. Tonchev (Discret. Math., 2017)

On Bonisoli's theorem and the block codes of Steiner triple systems. - Dieter Jungnickel; Vladimir D. Tonchev (Des. Codes Cryptogr., 2018)

Extension sets, affine designs, and Hamada's conjecture. - Dieter Jungnickel; Yue Zhou 001; Vladimir D. Tonchev (Des. Codes Cryptogr., 2018)

The classification of antipodal two-weight linear codes. - Dieter Jungnickel; Vladimir D. Tonchev (Finite Fields Their Appl., 2018)

All Binary Linear Codes That Are Invariant Under PSL2(n). - Cunsheng Ding; Hao Liu 011; Vladimir D. Tonchev (IEEE Trans. Inf. Theory, 2018)

Cyclotomic Trace Codes. - Dean Crnkovic; Andrea Svob; Vladimir D. Tonchev (Algorithms, 2019)

The classification of Steiner triple systems on 27 points with 3-rank 24. - Dieter Jungnickel; Spyros S. Magliveras; Vladimir D. Tonchev; Alfred Wassermann (Des. Codes Cryptogr., 2019)

Maximal arcs and extended cyclic codes. - Stefaan De Winter; Cunsheng Ding; Vladimir D. Tonchev (Des. Codes Cryptogr., 2019)

Counting Steiner triple systems with classical parameters and prescribed rank. - Dieter Jungnickel; Vladimir D. Tonchev (J. Comb. Theory A, 2019)

Bent Vectorial Functions, Codes and Designs. - Cunsheng Ding; Akihiro Munemasa; Vladimir D. Tonchev (IEEE Trans. Inf. Theory, 2019)

Maximal Arcs, Codes, and New Links Between Projective Planes of Order 16. - Mustafa Gezek; Rudi Mathon; Vladimir D. Tonchev (Electron. J. Comb., 2020)

The Projective General Linear Group PGL2(GF(2sm)) and Linear Codes of Length 2m+1. - Cunsheng Ding; Chunming Tang 001; Vladimir D. Tonchev (CoRR, 2020)

Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes. - Cunsheng Ding; Chunming Tang 001; Vladimir D. Tonchev (Des. Codes Cryptogr., 2020)

The projective general linear group ${ mathrm {PGL}}(2, 2^m)$ and linear codes of length 2m+1. - Cunsheng Ding; Chunming Tang 001; Vladimir D. Tonchev (Des. Codes Cryptogr., 2021)

Quasi-symmetric 2-(41, 9, 9) designs and doubly even self-dual codes of length 40. - Akihiro Munemasa; Vladimir D. Tonchev (Appl. Algebra Eng. Commun. Comput., 2022)

On the classification of unitals on 28 points of low rank. - Vladimir D. Tonchev; Alfred Wassermann (Appl. Algebra Eng. Commun. Comput., 2022)

Book Review: "Designs from Linear Codes", second edition, by Cunsheng Ding and Chunming Tang, World Scientific, 2022. - Vladimir D. Tonchev (Des. Codes Cryptogr., 2022)

On Pless symmetry codes, ternary QR codes, and related Hadamard matrices and designs. - Vladimir D. Tonchev (Des. Codes Cryptogr., 2022)

On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences. - Qi Liu; Cunsheng Ding; Sihem Mesnager; Chunming Tang 001; Vladimir D. Tonchev (IEEE Trans. Inf. Theory, 2022)

Hadamard Matrices of Orders 60 and 64 with Automorphisms of Orders 29 and 31. - Makoto Araya; Masaaki Harada; Vladimir D. Tonchev (Electron. J. Comb., 2024)

On optimal constant weight codes derived from ømega-circulant balanced generalized weighing matrices. - Hadi Kharaghani; Thomas Pender; Vladimir D. Tonchev (Des. Codes Cryptogr., 2024)