Corresponding to each odd integer q, we construct a complex orthogonal design. The number of variables and the form of the design depends on the integer q. Almost all of these designs are new and as a corollary we get a new asymptotic existence result for complex Hadamard matrices.
A recursive method for construction of designs
โ Scribed by D.K. Ray-Chaudhuri; Tianbao Zhu
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 497 KB
- Volume
- 106-107
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
Ray-Chaudhuri, D.K., T. Zhu, A recursive method for construction of designs, Discrete Mathematics 106/107 (1992) 399-406.
In this paper, we generalize Blanchard and Narayani's constructions of designs in the following ways.
(1) By applying an orthogonal array to the construction, we can reduce the parameter 1.
Moreover we get a family of designs with fixed t, k, u, and varying A.
(2) Instead of using a design as a base (so-called exterior design by Blanchard and Narayani),
we use an ordered design as a base, and compose several designs to produce a new design.
๐ SIMILAR VOLUMES
Trahan, R. E., Jr., Grosz, F. B., Jr., and Griffin, S., An Improved Method for Design of Recursive Digital Filters Using Optimization, Digital Signal Processing 5 (1995) \(167-175\). With the increased capability of today's personal computers ( \(\mathrm{PC}\) ) and software packages, it often is a
Cyclic packing designs of pairs have various applications in communications. In this paper, the concept of a (g 1 , g 2 , ..., g r ; u)-regular cyclic packing design is defined, and used to establish a quite general recursive construction concerning cyclic packing designs. As corollaries, we are abl