Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Wilson (1972)
Cyclotomy and difference families in elementary abelian groupsJournal of Number Theory, 4
K. Chen, L. Zhu (1999)
Improving Wilson’s bound on difference familiesUtil. Math., 55
R. Fuji-Hara, Y. Miao (2000)
Optical orthogonal codes: Their bounds and new optimal constructionsIEEE Trans. Inf. Theory, 46
J. H. Dinitz, P. Rodency (1997)
Disjoint difference families with block size 3Util. Math., 52
R. Fuji-Hara, Y. Miao (2000)
Optical orthogonal codes: their bounds and new optimal constructionsIEEE Trans. Commun., 46
Yanxun Chang, C. Ding (2006)
Constructions of External Difference Families and Disjoint Difference FamiliesDesigns, Codes and Cryptography, 40
R. Lidl, H. Niederreiter (1997)
Finite Fields: Encyclopedia of Mathematics and Its Applications.Computers & Mathematics With Applications, 7
M. Buratti (1995)
Improving two theorems of bose on difference familiesJournal of Combinatorial Designs, 3
K. Chen, R. Wei, L. Zhu (2002)
Existence of (q, 7, 1) difference families with q a prime powerJournal of Combinatorial Designs, 10
R. Fuji-Hara, Y. Miao, S. Shinohara (2002)
Complete sets of disjoint difference families and their applicationsJournal of Statistical Planning and Inference, 106
K. Chen, L. Zhu (1999)
Existence of (q, k, 1) difference families with q a prime power and k = 4, 5Journal of Combinatorial Designs, 7
M. Buratti (1995)
Constructions of (q, k, 1) difference families with q a prime power and k = 4, 5Discret. Math., 138
K. Chen, L. Zhu (1998)
Existence of (q, 6, 1) difference families with q a prime powerDes. Codes Crypt., 15
A (v, k, λ) difference family ((v, k, λ)-DF in short) over an abelian group G of order v, is a collection F = {B i |i ∈ I} of k-subsets of G, called base blocks, such that any nonzero element of G can be represented in precisely λ ways as a difference of two elements lying in some base blocks in F. A (v, k, λ)-DDF is a difference family with disjoint blocks. In this paper, by using Weil’s theorem on character sum estimates, it is proved that there exists a (p n, 4, 1)-DDF, where p = 1 (mod 12) is a prime number and n ≥ 1.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Oct 12, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.