✦ LIBER ✦

Bounds on the Number of Affine, Symmetric, and Hadamard Designs and Matrices

✍ Scribed by Clement Lam; Sigmund Lam; Vladimir D. Tonchev

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 118 KB
Volume: 92
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.2000.3060

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on the number of Hadamard designs

Bounds on the number of Hadamard designs of even order

✍ Clement Lam; Sigmund Lam; Vladimir D. Tonchev 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB

## Abstract A new lower bound on the number of non‐isomorphic Hadamard symmetric designs of even order is proved. The new bound improves the bound on the number of Hadamard designs of order 2__n__ given in [12] by a factor of 8__n__ − 1 for every odd __n__ > 1, and for every even __n__ such that 4_

Exponential bounds on the number of desi

Exponential bounds on the number of designs with affine parameters

✍ David Clark; Dieter Jungnickel; Vladimir D. Tonchev 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB

## Abstract It is well‐known that the number of designs with the parameters of a classical design having as blocks the hyperplanes in __PG__(__n, q__) or __AG__(__n, q__), __n__≥3, grows exponentially. This result was extended recently [D. Jungnickel, V. D. Tonchev, Des Codes Cryptogr, published on

Correction to: “Exponential bounds on th

Correction to: “Exponential bounds on the number of designs with affine parameters”

✍ David Clark; Dieter Jungnickel; Vladimir D. Tonchev 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB

This article replaces the incorrect version of the article first published in J Combin Designs 18 (2010), 450-461. The publisher apologizes for this error.

On the dimension of affine resolvable de

On the dimension of affine resolvable designs and hypercubes

✍ Charles F. Laywine 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 737 KB

On the asymptotic existence of complex H

On the asymptotic existence of complex Hadamard matrices

✍ R. Craigen; W. H. Holzmann; H. Kharaghani 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB 👁 2 views

Let N = N (q) be the number of nonzero digits in the binary expansion of the odd integer q. A construction method is presented which produces, among other results, a block circulant complex Hadamard matrix of order 2 α q, where α ≥ 2N -1. This improves a recent result of Craigen regarding the asympt

On the classification of Hadamard matric

On the classification of Hadamard matrices of order 32

✍ H. Kharaghani; B. Tayfeh-Rezaie 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB 👁 1 views

## Abstract All equivalence classes of Hadamard matrices of order at most 28 have been found by 1994. Order 32 is where a combinatorial explosion occurs on the number of Hadamard matrices. We find all equivalence classes of Hadamard matrices of order 32 which are of certain types. It turns out that