Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Joost Winne"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AE,..., Iss Proceedings (2005)
A double $2$-$(v,k,2 \lambda)$ design is a design which is reducible into two $2$-$(v,k,\lambda)$ designs. It is called uniquely reducible if it has, up to equivalence, only one reduction. We present properties of uniquely reducible double designs wh
Externí odkaz:
https://doaj.org/article/31dcfc60467a42d69f98bd79f74424d3
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AE,..., Iss Proceedings (2005)
Before this work, at least 762 inequivalent Hadamard matrices of order 36 were known. We found 7238 Hadamard matrices of order 36 and 522 inequivalent [72,36,12] double-even self-dual codes which are obtained from all 2-(35,17,8) designs with an auto
Externí odkaz:
https://doaj.org/article/da072b8b100745e894bd1669388071e4
Publikováno v:
Designs, Codes and Cryptography. 51:105-122
We present the full classification of Hadamard 2-(31,15,7), Hadamard 2-(35, 17,8) and Menon 2-(36,15,6) designs with automorphisms of odd prime order. We also give partial classifications of such designs with automorphisms of order 2. These classific
Publikováno v:
Designs, Codes and Cryptography. 46:25-43
We study codewords of small weight in the codes arising from Desarguesian projective planes. We first of all improve the results of K. Chouinard on codewords of small weight in the codes arising from PG(2, p), p prime. Chouinard characterized all the
Publikováno v:
Discrete Mathematics. 306(18):2141-2151
A classification of the doubles of the projective plane of order 4 with respect to the order of the automorphism group is presented and it is established that, up to isomorphism, there are 1746461307 doubles. We start with the designs possessing non-
Publikováno v:
Discrete Mathematics and Theoretical Computer Science
2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.93-98
2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.93-98
Research Group on Combinatorial Algorithms and Algorithmic Graph Theory, Department of Applied MathematicsandComputerScience,GhentUniversity,Krijgslaan281–S9,B–9000Ghent,Belgium. email: Joost.Winne@ugent.be,Veerle.Fack@ugent.beBefore this work, a
Publikováno v:
Designs, Codes & Cryptography; May2009, Vol. 51 Issue 2, p105-122, 18p
Publikováno v:
Designs, Codes & Cryptography; Jan2008, Vol. 46 Issue 1, p25-43, 19p
Publikováno v:
Designs, Codes & Cryptography; Oct2006, Vol. 41 Issue 1, p59-78, 20p