A perfect binary array is an r-dimensional array with elements k 1 such that all out-of-phase periodic autocorrelation coefficients are zero. Such an array is equivalent to a Menon difference set in an abelian group. We give recursive constructions for four infinite families of two-dimensional perfe
✦ LIBER ✦
Perfect binary arrays
✍ Scribed by H.D. Lüke; L. Bömer; M. Antweiler
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 527 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0165-1684
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Perfect binary arrays and difference set
✍
Jonathan Jedwab; Chris Mitchell; Fred Piper; Peter Wild
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 702 KB
Synthesis of binary arrays with perfect
✍
Kevin Byard
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 532 KB
A nonexistence result for abelian menon
✍
K. T. Arasu; James A. Davis; J. Jedwab
📂
Article
📅
1995
🏛
Springer-Verlag
🌐
English
⚖ 370 KB
Binary consecutive covering arrays
✍
A. P. Godbole; M. V. Koutras; F. S. Milienos
📂
Article
📅
2009
🏛
Springer Japan
🌐
English
⚖ 285 KB
Nonexistence of certain perfect arrays
✍
Wai-Kiu Chan; Man-Keung Siu; Siu-Lun Ma
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 447 KB
Perfect binary arrays are equivalent to Menon difference sets in certain groups. This note proves a theorem on the Menon difference set and interprets its consequences on the nonexistence of certain perfect arrays. examples of perfect arrays of sizes 6 x 6 and 3 x 12. In recent years quite a number
Perfect binary space partitions
✍
Mark de Berg; Marko M. de Groot; Mark H. Overmars
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 676 KB