|
|
Designs and Configurations
05Bxx
| [1] |
David Applegate, E. M. Rains, and N. J. A. Sloane.
On asymmetric coverings and covering numbers.
J. Combin. Des., 11(3):218–228, 2003. |
| [2] |
Makoto Araya, Masaaki Harada, and Hadi Kharaghani.
Some Hadamard matrices of order 32 and their binary codes.
J. Combin. Des., 12(2):142–146, 2004. |
| [3] |
Eiichi Bannai and Etsuko Bannai.
On Euclidean tight 4-designs.
J. Math. Soc. Japan, 58(3):775–804, 2006. |
| [4] |
L. M. Batten and J. M. Dover.
Some sets of type (m, n) in cubic order planes.
Des. Codes Cryptogr., 16(3):211–213, 1999. |
| [5] |
Thomas Beth, Christopher Charnes, Markus Grassl, Gernot Alber, Aldo Delgado,
and Michael Mussinger.
A new class of designs which protect against quantum jumps.
Des. Codes Cryptogr., 29(1-3):51–70, 2003. |
| [6] |
Anton Betten, Adalbert Kerber, Reinhard Laue, and Alfred Wassermann.
Simple 8-designs with small parameters.
Des. Codes Cryptogr., 15(1):5–27, 1998. |
| [7] |
A. Bonnecaze, E. Rains, and P. Solé.
3-colored 5-designs and Z4-codes.
J. Statist. Plann. Inference, 86(2):349–368, 2000. |
| [8] |
A. Bonnecaze, P. Solé, and P. Udaya.
Tricolore 3-designs in type III codes.
Discrete Math., 241(1-3):129–138, 2001. |
| [9] |
Alexis Bonnecaze, Bernard Mourrain, and Patrick Solé.
Jacobi polynomials, type II codes, and designs.
Des. Codes Cryptogr., 16(3):215–234, 1999. |
| [10] |
Thomas Britz and Carrie G. Rutherford.
Covering radii are not matroid invariants.
Discrete Math., 296(1):117–120, 2005. |
| [11] |
S. Allen Broughton, Robert M. Dirks, Maria T. Sloughter, and C. Ryan Vinroot.
Triangular surface tiling groups for low genus.
Preprint. |
| [12] |
I. Cardinali, N. Durante, T. Penttila, and R. Trombetti.
Bruen chains over fields of small order.
Discrete Math., 282(1-3):245–247, 2004. |
| [13] |
L. L. Carpenter and J. D. Key.
On Hadamard matrices from resolvable Steiner designs.
In Proceedings of the Twenty-sixth Southeastern International
Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL,
1995), volume 108, pages 53–63, 1995. |
| [14] |
David B. Chandler and Qing Xiang.
Cyclic relative difference sets and their p-ranks.
Des. Codes Cryptogr., 30(3):325–343, 2003. |
| [15] |
Chris Charnes, Martin Rötteler, and Thomas Beth.
Homogeneous bent functions, invariants, and designs.
Des. Codes Cryptogr., 26(1-3):139–154, 2002. |
| [16] |
D. Combe, W. D. Palmer, and W. R. Unger.
Bhaskar Rao designs and the alternating group A4.
Australas. J. Combin., 24:275–283, 2001. |
| [17] |
Marston Conder and John McKay.
Markings of the Golay code.
New Zealand J. Math., 25(2):133–139, 1996. |
| [18] |
Antonio Cossidente and Sam K. J. Vereecke.
Some geometry of the isomorphism Sp(4, q)≅O(5, q),
q even.
J. Geom., 70(1-2):28–37, 2001. |
| [19] |
Warwick de Launey and Richard M. Stafford.
On cocyclic weighing matrices and the regular group actions of
certain Paley matrices.
Discrete Appl. Math., 102(1-2):63–101, 2000. |
| [20] |
U. Dempwolff.
Automorphisms and equivalence of bent functions and of difference
sets in elementary abelian 2-groups.
Comm. Algebra, 34(3):1077–1131, 2006. |
| [21] |
Cunsheng Ding, Zeying Wang, and Qing Xiang.
Skew Hadamard difference sets from the Ree-Tits slice
symplectic spreads in PG(3, 32h + 1).
arXiv:math/0609586, 18 pages, 2006. |
| [22] |
G. L. Ebert.
Quasimultiples of geometric designs.
Discrete Math., 284(1-3):123–129, 2004. |
| [23] |
Ronald Evans, Henk D. L. Hollmann, Christian Krattenthaler, and Qing Xiang.
Gauss sums, Jacobi sums, and p-ranks of cyclic difference sets.
J. Combin. Theory Ser. A, 87(1):74–119, 1999. |
| [24] |
D. L. Flannery.
Cocyclic Hadamard matrices and Hadamard groups are equivalent.
J. Algebra, 192(2):749–779, 1997. |
| [25] |
Anna Fukshansky and Corinna Wiedorn.
C-extensions of the Petersen geometry for M22.
European J. Combin., 20(3):233–238, 1999. |
| [26] |
S. Georgiou and C. Koukouvinos.
Some results on orthogonal designs and Hadamard matrices.
Int. J. Appl. Math., 17(4):433–443, 2005. |
| [27] |
Claudia Gohlisch, Helmut Koch, and Gabriele Nebe.
Block squares.
Math. Nachr., 241:73–102, 2002. |
| [28] |
Masaaki Harada.
On the self-dual F5-codes constructed from Hadamard matrices
of order 24.
J. Combin. Des., 13(2):152–156, 2005. |
| [29] |
Masaaki Harada.
Self-orthogonal 3-(56, 12, 65) designs and extremal doubly-even
self-dual codes of length 56.
Des. Codes Cryptogr., 38(1):5–16, 2006. |
| [30] |
Masaaki Harada, Clement Lam, and Vladimir D. Tonchev.
Symmetric (4, 4)-nets and generalized Hadamard matrices over
groups of order 4.
Des. Codes Cryptogr., 34(1):71–87, 2005. |
| [31] |
Masaaki Harada and Akihiro Munemasa.
A quasi-symmetric 2-(49, 9, 6) design.
J. Combin. Des., 10(3):173–179, 2002. |
| [32] |
Masaaki Harada and Vladimir D. Tonchev.
Self-orthogonal codes from symmetric designs with fixed-point-free
automorphisms.
Discrete Math., 264(1-3):81–90, 2003. |
| [33] |
K. J. Horadam.
An introduction to cocyclic generalised Hadamard matrices.
Discrete Appl. Math., 102(1-2):115–131, 2000. |
| [34] |
K. J. Horadam and P. Udaya.
A new class of ternary cocyclic Hadamard codes.
Appl. Algebra Engrg. Comm. Comput., 14(1):65–73, 2003. |
| [35] |
Naoyuki Horiguchi, Hiroyuki Nakasora, and Takehisa Wakabayashi.
On the strongly regular graphs obtained from quasi-symmetric 2-(31,
7, 7) designs.
Bull. Yamagata Univ. Natur. Sci., 16(1):1–6, 2005. |
| [36] |
J. D. Key and M. J. de Resmini.
Small sets of even type and codewords.
J. Geom., 61(1-2):83–104, 1998. |
| [37] |
J. D. Key and K. Mackenzie-Fleming.
Rigidity theorems for a class of affine resolvable designs.
J. Combin. Math. Combin. Comput., 35:147–160, 2000. |
| [38] |
J. D. Key, T. P. McDonough, and V. C. Mavron.
Partial permutation decoding for codes from finite planes.
European J. Combin., 26(5):665–682, 2005. |
| [39] |
J. D. Key and J. Moori.
Codes, designs and graphs from the Janko groups J1 and
J2.
J. Combin. Math. Combin. Comput., 40:143–159, 2002. |
| [40] |
J. D. Key and F. D. Shobe.
Some transitive Steiner triple systems of Bagchi and Bagchi.
J. Statist. Plann. Inference, 58(1):79–86, 1997. |
| [41] |
J. D. Key and F. E. Sullivan.
Steiner triple systems with many affine hyperplanes.
In Proceedings of the Twenty-sixth Southeastern International
Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL,
1995), volume 107, pages 105–112, 1995. |
| [42] |
Jon-Lark Kim and Vera Pless.
Designs in additive codes over GF(4).
Des. Codes Cryptogr., 30(2):187–199, 2003. |
| [43] |
Ilias S. Kotsireas and Christos Koukouvinos.
Orthogonal designs via computational algebra.
J. Combin. Des., 14(5):351–362, 2006. |
| [44] |
Ilias S. Kotsireas, Christos Koukouvinos, and Jennifer Seberry.
Hadamard ideals and Hadamard matrices with circulant core.
J. Combin. Math. Combin. Comput., 57:47–63, 2006. |
| [45] |
Ilias S. Kotsireas, Christos Koukouvinos, and Jennifer Seberry.
Hadamard ideals and Hadamard matrices with two circulant cores.
European J. Combin., 27(5):658–668, 2006. |
| [46] |
Wolfgang Lempken.
Two new symmetric 2-(144, 66, 30) designs.
Preprint. |
| [47] |
Akihiro Munemasa and Vladimir D. Tonchev.
A new quasi-symmetric 2-(56, 16, 6) design obtained from codes.
Discrete Math., 284(1-3):231–234, 2004. |
| [48] |
Christopher Parker and Vladimir D. Tonchev.
Linear codes and doubly transitive symmetric designs.
Linear Algebra Appl., 226/228:237–246, 1995. |
| [49] |
E. M. Rains, N. J. A. Sloane, and John Stufken.
The lattice of N-run orthogonal arrays.
J. Statist. Plann. Inference, 102(2):477–500, 2002. |
| [50] |
Michel Sebille.
On a result of Cameron and Praeger on block-transitive
point-imprimitive t-designs.
In Algebraic Combinatorics and Applications
(Gößweinstein, 1999), pages 316–323. Springer, Berlin, 2001. |
| [51] |
Pawel Wocjan.
Efficient decoupling schemes with bounded controls based on
Eulerian orthogonal arrays.
Phy. Rev. A., 73(6):7, 2006. |
|
