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
Perfect difference sets constructed from Sidon sets
โ Scribed by Javier Cilleruelo; Melvyn B. Nathanson
- Publisher
- Springer-Verlag
- Year
- 2008
- Tongue
- English
- Weight
- 499 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A perfect system of difference sets with threshold c is a partition of a consecutive run of integers beginning with c into full difference sets of valency at least 2. The BKT inequality, due to Bermond, Kotzig and Turgeon gives a necessary condition for the existence of such systems; systems for whi
In this article we give the definition of the class N = NI U N z U 3 f 3 where and prove: (1) 3 f l ( v ) # 4 for v E 3fl = { p 2 r : p = S(mod 8) a prime, T f O(mod 4)}, NZ = {3"( p ; --. P : ) ~: pi = 3(mod 4) a prime, pi > 3 , r,ri 2 0, i = l , ---, n ; n = 1,2,-\*.}, N 3 = {vv': v E N 1 and v '