The existence of a (q, k, 1) difference family in GF(q) has been completely solved for k = 3. For k = 4, 5 partial results have been given by Bose, Wilson, and Buratti. In this article, we continue the investigation and show that the necessary condition for the existence of a (q, k, 1) difference fa
Existence of (q, 7, 1) difference families with q a prime power
โ Scribed by K. Chen; R. Wei; L. Zhu
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 134 KB
- Volume
- 10
- Category
- Article
- ISSN
- 1063-8539
- DOI
- 10.1002/jcd.998
No coin nor oath required. For personal study only.
โฆ Synopsis
Abstract
The existence of a (q,k, 1) difference family in GF(q) has been completely solved for kโ=โ3,4,5,6. For kโ=โ7 only partial results have been given. In this article, we continue the investigation and use Weil's theorem on character sums to show that the necessary condition for the existence of a (q,7,1) difference family in GF(q), i.e. qโโกโ1; (mod 42) is also sufficient except for qโ=โ43 and possibly except for qโ=โ127, qโ=โ211, qโ=โ31^6^ and primes qโ [261239791, 1.236597โรโ10^13^] such that $(-3)^{q-1\over 14} = 1$ in GF(q). ยฉ 2002 Wiley Periodicals, Inc. J Combin Designs 10: 126โ138, 2002; DOI 10.1002/jcd.998
๐ SIMILAR VOLUMES
Stinson introduced authentication perpendicular arrays APA ฮป (t, k, v), as a special kind of perpendicular arrays, to construct authentication and secrecy codes. Ge and Zhu introduced APAV(q, k) to study APA1(2, k, v) for k = 5, 7. In this article, we use a theorem on character sums to show that for