AbstractThe four symmetric 2-(64, 28, 12) designs with the symmetric difference property are characterized as the only designs with the given parameters and minimal rank over GF(2). These designs give non-isomorphic quasi-symmetric 2-(36, 16, 12) and 2-(28, 12, 11) designs as residual and derived designs. The binary codes of the quasi-symmetric 2-(28, 12, 11) designs provide four inequivalent self-orthogonal doubly-even (28, 7, 12) codes. This gives a negative answer to the question for the uniqueness of the code of the Hermitian unital of order 3
With the intent to discover block designs from groups of order 256 and higher that have the symmetri...
AbstractWe give a characterization of codes meeting the Grey–Rankin bound. When the codes have even ...
New quasi-symmetric 2-(28,12,11) and 2-(36,16,12) designs are constructed by embedding known designs...
AbstractThe four symmetric 2-(64, 28, 12) designs with the symmetric difference property are charact...
Using the classification of certain binary self-dual codes, we establish the uniqueness of the class...
AbstractDillon asked whether the all-1 vector is in the binary code of a square (symmetric) design w...
AbstractIt is proved by use of the classification of the doubly even (32, 16) codes, that in additio...
AbstractThe automorphism groups of the symmetric 2-(64, 28, 12) designs with the symmetric differenc...
AbstractA 2-design is said to be quasi-symmetric if there are two block intersection sizes. We obtai...
AbstractThe binary code spanned by the blocks of the known quasi-symmetric 2-(56,16,6) design is uti...
The paper studies quasi-symmetric 2-(64, 24, 46) designs supported by minimum weight codewords in th...
It is proved that a quasi-symmetric design with the Symmetric Difference Property (SDP) is uniquely ...
AbstractIn this paper, we consider a method for constructing non-binary self-orthogonal codes from s...
In this paper, we give a construction of doubly even self-orthogonal codes from quasi-symmetric desi...
In this paper, we consider a method for constructing non-binary self-orthogonal codes from symmetric...
With the intent to discover block designs from groups of order 256 and higher that have the symmetri...
AbstractWe give a characterization of codes meeting the Grey–Rankin bound. When the codes have even ...
New quasi-symmetric 2-(28,12,11) and 2-(36,16,12) designs are constructed by embedding known designs...
AbstractThe four symmetric 2-(64, 28, 12) designs with the symmetric difference property are charact...
Using the classification of certain binary self-dual codes, we establish the uniqueness of the class...
AbstractDillon asked whether the all-1 vector is in the binary code of a square (symmetric) design w...
AbstractIt is proved by use of the classification of the doubly even (32, 16) codes, that in additio...
AbstractThe automorphism groups of the symmetric 2-(64, 28, 12) designs with the symmetric differenc...
AbstractA 2-design is said to be quasi-symmetric if there are two block intersection sizes. We obtai...
AbstractThe binary code spanned by the blocks of the known quasi-symmetric 2-(56,16,6) design is uti...
The paper studies quasi-symmetric 2-(64, 24, 46) designs supported by minimum weight codewords in th...
It is proved that a quasi-symmetric design with the Symmetric Difference Property (SDP) is uniquely ...
AbstractIn this paper, we consider a method for constructing non-binary self-orthogonal codes from s...
In this paper, we give a construction of doubly even self-orthogonal codes from quasi-symmetric desi...
In this paper, we consider a method for constructing non-binary self-orthogonal codes from symmetric...
With the intent to discover block designs from groups of order 256 and higher that have the symmetri...
AbstractWe give a characterization of codes meeting the Grey–Rankin bound. When the codes have even ...
New quasi-symmetric 2-(28,12,11) and 2-(36,16,12) designs are constructed by embedding known designs...