An application of linear codes for the construction of a 2-transitive symmetric design from its residual or derived designs is discussed. The Higman design is constructed as the design supported by the minimum weight codewords in the extended binary code of certain designs invariant under PΣU (3, 52)
AbstractWe give a characterization of codes meeting the Grey–Rankin bound. When the codes have even ...
It is proved that a quasi-symmetric design with the Symmetric Difference Property (SDP) is uniquely ...
A method is given for constructing extremal binary self-dual [42, 21, 8]-codes from certain symmetri...
AbstractAn application of linear codes for the construction of a 2-transitive symmetric design from ...
An application of linear codes for the construction of a 2-transitive symmetric design from its resi...
A classical method of constructing a linear code over GF(q) with a t-design is to use the incidence ...
AbstractThe four symmetric 2-(64, 28, 12) designs with the symmetric difference property are charact...
Given a code C, invariant linear forms are used to study the designs afforded by codewords of a fixe...
A new definition for the dimension of a combinatorial t-(v,k,λ) design over a finite field is propos...
The binary code spanned by the blocks of the known quasi-symmetric 2-(56,16,6) design is utilized fo...
The Fq - code of a symmetric (v, k,l )- design is a subspace generated by the incidence matrix of th...
The binary codes spanned by the blocks of the six known symmetric (61,16,4) designs and their automo...
AbstractThe binary code spanned by the blocks of the known quasi-symmetric 2-(56,16,6) design is uti...
AbstractWe introduce the study of designs in a coset of a binary code which can be held by vectors o...
The paper studies quasi-symmetric 2-(64, 24, 46) designs supported by minimum weight codewords in th...
AbstractWe give a characterization of codes meeting the Grey–Rankin bound. When the codes have even ...
It is proved that a quasi-symmetric design with the Symmetric Difference Property (SDP) is uniquely ...
A method is given for constructing extremal binary self-dual [42, 21, 8]-codes from certain symmetri...
AbstractAn application of linear codes for the construction of a 2-transitive symmetric design from ...
An application of linear codes for the construction of a 2-transitive symmetric design from its resi...
A classical method of constructing a linear code over GF(q) with a t-design is to use the incidence ...
AbstractThe four symmetric 2-(64, 28, 12) designs with the symmetric difference property are charact...
Given a code C, invariant linear forms are used to study the designs afforded by codewords of a fixe...
A new definition for the dimension of a combinatorial t-(v,k,λ) design over a finite field is propos...
The binary code spanned by the blocks of the known quasi-symmetric 2-(56,16,6) design is utilized fo...
The Fq - code of a symmetric (v, k,l )- design is a subspace generated by the incidence matrix of th...
The binary codes spanned by the blocks of the six known symmetric (61,16,4) designs and their automo...
AbstractThe binary code spanned by the blocks of the known quasi-symmetric 2-(56,16,6) design is uti...
AbstractWe introduce the study of designs in a coset of a binary code which can be held by vectors o...
The paper studies quasi-symmetric 2-(64, 24, 46) designs supported by minimum weight codewords in th...
AbstractWe give a characterization of codes meeting the Grey–Rankin bound. When the codes have even ...
It is proved that a quasi-symmetric design with the Symmetric Difference Property (SDP) is uniquely ...
A method is given for constructing extremal binary self-dual [42, 21, 8]-codes from certain symmetri...