Vladimir D. Tonchev

Orcid: 0000-0003-1806-3571

According to our database1, Vladimir D. Tonchev authored at least 117 papers between 1980 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On optimal constant weight codes derived from ømega-circulant balanced generalized weighing matrices.
Des. Codes Cryptogr., October, 2024

Hadamard Matrices of Orders 60 and 64 with Automorphisms of Orders 29 and 31.
Electron. J. Comb., 2024

2022
On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences.
IEEE Trans. Inf. Theory, 2022

On Pless symmetry codes, ternary QR codes, and related Hadamard matrices and designs.
Des. Codes Cryptogr., 2022

Book Review: "Designs from Linear Codes", second edition, by Cunsheng Ding and Chunming Tang, World Scientific, 2022.
Des. Codes Cryptogr., 2022

On the classification of unitals on 28 points of low rank.
Appl. Algebra Eng. Commun. Comput., 2022

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

2021
The projective general linear group ${\mathrm {PGL}}(2, 2^m)$ and linear codes of length 2<sup>m+1</sup>.
Des. Codes Cryptogr., 2021

2020
Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes.
Des. Codes Cryptogr., 2020

The Projective General Linear Group PGL<sub>2</sub>(GF(2s<sup>m</sup>)) and Linear Codes of Length 2<sup>m</sup>+1.
CoRR, 2020

Maximal Arcs, Codes, and New Links Between Projective Planes of Order 16.
Electron. J. Comb., 2020

2019
Bent Vectorial Functions, Codes and Designs.
IEEE Trans. Inf. Theory, 2019

Counting Steiner triple systems with classical parameters and prescribed rank.
J. Comb. Theory A, 2019

Maximal arcs and extended cyclic codes.
Des. Codes Cryptogr., 2019

The classification of Steiner triple systems on 27 points with 3-rank 24.
Des. Codes Cryptogr., 2019

Cyclotomic Trace Codes.
Algorithms, 2019

2018
All Binary Linear Codes That Are Invariant Under PSL<sub>2</sub>(n).
IEEE Trans. Inf. Theory, 2018

The classification of antipodal two-weight linear codes.
Finite Fields Their Appl., 2018

Extension sets, affine designs, and Hamada's conjecture.
Des. Codes Cryptogr., 2018

On Bonisoli's theorem and the block codes of Steiner triple systems.
Des. Codes Cryptogr., 2018

2017
Quasi-symmetric 2-(64, 24, 46) designs derived from AG(3, 4).
Discret. Math., 2017

Linearly embeddable designs.
Des. Codes Cryptogr., 2017

On resolvable Steiner 2-designs and maximal arcs in projective planes.
Des. Codes Cryptogr., 2017

On Classifying Steiner Triple Systems by Their 3-Rank.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

2016
The weight distribution of the self-dual [128, 64] polarity design code.
Adv. Math. Commun., 2016

2015
Galois geometries, codes, and new invariants for incidence structures.
Proceedings of the Advances on Superelliptic Curves and their Applications, 2015

Maximal arcs and quasi-symmetric designs.
Des. Codes Cryptogr., 2015

2014
The Nonexistence of (18, 3, 18, 6) Relative Difference Sets.
Proceedings of the Sequences and Their Applications - SETA 2014, 2014

On Quasi-symmetric 2-(64, 24, 46) Designs Derived from Codes.
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

2013
A Characterization of Entanglement-Assisted Quantum Low-Density Parity-Check Codes.
IEEE Trans. Inf. Theory, 2013

High-Rate Self-Synchronizing Codes.
IEEE Trans. Inf. Theory, 2013

New invariants for incidence structures.
Des. Codes Cryptogr., 2013

Algebraic techniques in designing quantum synchronizable codes
CoRR, 2013

A doubling construction for self-orthogonal codes.
CoRR, 2013

Enumeration of (16, 4, 16, 4) Relative Difference Sets.
Electron. J. Comb., 2013

A new class of majority-logic decodable codes derived from polarity designs.
Adv. Math. Commun., 2013

2012
Nonbinary quantum codes derived from finite geometries.
Finite Fields Their Appl., 2012

A Hamada type characterization of the classical geometric designs.
Des. Codes Cryptogr., 2012

A direct product construction for high-rate self-synchronizing codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

2011
Finite geometry designs, codes, and Hamada's conjecture.
Proceedings of the Information Security, Coding Theory and Related Combinatorics, 2011

Affine geometry designs, polarities, and Hamada's conjecture.
J. Comb. Theory A, 2011

2010
The number of designs with geometric parameters grows exponentially.
Des. Codes Cryptogr., 2010

Entanglement-assisted quantum low-density parity-check codes
CoRR, 2010

Classification of Generalized Hadamard Matrices <i>H(6,3)</i> and Quaternary Hermitian Self-Dual Codes of Length 18.
Electron. J. Comb., 2010

2009
Combinatorial Designs and Code Synchronization.
Proceedings of the Algebraic Aspects of Digital Communications, 2009

Generalized weighing matrices and self-orthogonal codes.
Discret. Math., 2009

Polarities, quasi-symmetric designs, and Hamada's conjecture.
Des. Codes Cryptogr., 2009

An algorithm for optimal comma free codes with isomorphism rejection.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

2008
Steiner systems for two-stage disjunctive testing.
J. Comb. Optim., 2008

Quantum codes from caps.
Discret. Math., 2008

Difference systems of sets and cyclotomy.
Discret. Math., 2008

On affine designs and Hadamard designs with line spreads.
Discret. Math., 2008

2007
On Conflict-Avoiding Codes of Length n=4m for Three Active Users.
IEEE Trans. Inf. Theory, 2007

An algorithm for optimal difference systems of sets.
J. Comb. Optim., 2007

2006
Hyperplane partitions and difference systems of sets.
J. Comb. Theory A, 2006

Code Synchronization, Cyclotomy, and Finite Geometry.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Optimal Difference Systems of Sets with Multipliers.
Proceedings of the Computer Science, 2006

2005
Partitions of difference sets and code synchronization.
Finite Fields Their Appl., 2005

Affine designs and linear orthogonal arrays.
Discret. Math., 2005

Symmetric (4,4)-Nets and Generalized Hadamard Matrices Over Groups of Order 4.
Des. Codes Cryptogr., 2005

Optimal conflict-avoiding codes for three active users.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
On generalized Hadamard matrices of minimum rank.
Finite Fields Their Appl., 2004

A new quasi-symmetric 2-(56, 16, 6) design obtained from codes.
Discret. Math., 2004

2003
Self-orthogonal Codes from Symmetric Designs with Fixed-point-free Auto-morphisms.
Discret. Math., 2003

Unitals and codes.
Discret. Math., 2003

A Note on MDS Codes, <i>n</i>-Arcs and Complete Designs.
Des. Codes Cryptogr., 2003

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

Error-correcting codes from graphs.
Discret. Math., 2002

2001
A Mass Formula for Steiner Triple Systems STS(2<sup>n</sup>-1) of 2-Rank 2<sup>n</sup>-n.
J. Comb. Theory A, 2001

Perfect Codes and Balanced Generalized Weighing Matrices, II.
Electron. Notes Discret. Math., 2001

The Existence of a Bush-Type Hadamard Matrix of Order 324 and Two New Infinite Classes of Symmetric Designs.
Des. Codes Cryptogr., 2001

2000
Bounds on the Number of Affine, Symmetric, and Hadamard Designs and Matrices.
J. Comb. Theory A, 2000

Unital designs in planes of order 16.
Discret. Appl. Math., 2000

1999
Linear Perfect Codes and a Characterization of the Classical Designs.
Des. Codes Cryptogr., 1999

1998
Maximum Disjoint Bases and Constant-Weight Codes.
IEEE Trans. Inf. Theory, 1998

New Designs with Block Size 7.
J. Comb. Theory A, 1998

Characterizing the Hermitian and Ree Unitals on 28 Points.
Des. Codes Cryptogr., 1998

Computing Linear Codes and Unitals.
Des. Codes Cryptogr., 1998

1997
Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs.
IEEE Trans. Inf. Theory, 1997

Linear Codes and the Existence of a Reversible Hadamard Difference Set in Z<sub>2</sub>xZ<sub>2</sub>xZ<sup>4</sup><sub>5</sub>.
J. Comb. Theory A, 1997

1996
The existence of certain extremal [54, 27, 10] self-dual codes.
IEEE Trans. Inf. Theory, 1996

The uniformly packed binary [27, 21, 3] and [35, 29, 3] codes.
Discret. Math., 1996

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

Spreads in Strongly Regular Graphs.
Des. Codes Cryptogr., 1996

On the Binary Codes of Steiner Triple Systems.
Des. Codes Cryptogr., 1996

1995
On Quasi-Symmetric 2-(28, 12, 11) and 2-(36, 16, 12) Designs.
Des. Codes Cryptogr., 1995

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

Singly-Even Self-Dual Codes and Hadamard Matrices.
Proceedings of the Applied Algebra, 1995

1994
Designs with the Symmetric Difference Property on 64 Points and Their Groups.
J. Comb. Theory A, 1994

1993
On the existence of a certain (64, 32, 12) extremal code.
IEEE Trans. Inf. Theory, 1993

A Class of Non-embeddable Designs.
J. Comb. Theory A, 1993

A Design and a Code Invariant under the Simple Group Co<sub>3</sub>.
J. Comb. Theory A, 1993

1992
On Symmetric and Quasi-Symmetric Designs with the Symmetric Difference Property and Their Codes.
J. Comb. Theory A, 1992

On Kirkman triple systems of order 33.
Discret. Math., 1992

Some small non-embeddable designs.
Discret. Math., 1992

Extremal self-dual codes from symmetric designs.
Discret. Math., 1992

Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems.
Des. Codes Cryptogr., 1992

1991
Cyclic 2-(91, 6, 1) designs with multiplier automorphisms.
Discret. Math., 1991

Exponential Number of Quasi-Symmetric SDP Designs and Codes Meeting.
Des. Codes Cryptogr., 1991

Self-dual codes and Hadamard matrices.
Discret. Appl. Math., 1991

1990
Extremal doubly-even codes of length 64 derived from symmetric designs.
Discret. Math., 1990

Extremal doubly-even codes of length 40 derived from Hadamard matrices of order 20.
Discret. Math., 1990

1989
Self-orthogonal designs and extremal doubly even codes.
J. Comb. Theory A, 1989

Automorphisms of 2-(22, 8, 4) designs.
Discret. Math., 1989

New extremal doubly-even codes of length 56 derived from Hadamard matrices of order 28.
Discret. Math., 1989

1988
On the covering radius of binary [14, 6] codes containing the all-one vector.
IEEE Trans. Inf. Theory, 1988

1987
Self-dual codes over GF(7).
IEEE Trans. Inf. Theory, 1987

Transitive Steiner triple systems of order 25.
Discret. Math., 1987

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

A characterization of designs related to dodecads in the witt system <i>S</i>(5, 8, 24).
J. Comb. Theory A, 1986

Quasi-symmetric Designs and Self-dual Codes.
Eur. J. Comb., 1986

1985
Hadamard Matrices of Order 28 with Automorphisms of Order 7.
J. Comb. Theory A, 1985

1984
Nonembeddable Quasi-residual Designs with Large K.
J. Comb. Theory A, 1984

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

1983
Hadamard Matrices of Order 28 with Automorphisms of Order 13.
J. Comb. Theory A, 1983

1980
On the number of equivalence classes of Boolean functions under a transformation group (Corresp.).
IEEE Trans. Inf. Theory, 1980

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


  Loading...