AbstractA perfect (v,{ki∣1≤i≤s},ρ) difference system of sets (DSS) is a collection of s disjoint ki-subsets Di, 1≤i≤s, of any finite abelian group G of order v such that every non-identity element of G appears exactly ρ times in the multiset {a−b∣a∈Di,b∈Dj,1≤i≠j≤s}. In this paper, we give a necessary and sufficient condition in terms of Jacobi sums for a collection {Di∣1≤i≤s} defined in a finite field Fq of order q=ef+1 to be a perfect (q,{ki∣1≤i≤s},ρ)-DSS, where each Di is a union of cyclotomic cosets of index e (and the zero 0∈Fq). Also, we give numerical results for the cases e=2,3, and 4
A (v, k, λ) difference set is a k-element subset D of a group G of order v for which the multiset {d...
Difference Systems of Sets (DSS) are combinatorial structures that are used in code synchronization....
AbstractUsing the representation theory of groups and the theory of cyclotomic fields, in this paper...
AbstractA perfect (v,{ki∣1≤i≤s},ρ) difference system of sets (DSS) is a collection of s disjoint ki-...
AbstractDifference systems of sets (DSS) are combinatorial configurations that arise in connection w...
AbstractDifference systems of sets (DSS) are combinatorial structures that are a generalization of c...
AbstractLet L be the cyclotomic field of the e-th roots of unity where e is even, and p be a prime o...
AbstractDifference Systems of Sets (DSS) are combinatorial configurations that arise in connection w...
AbstractLet m,n1,n2,…,nm and c be positive integers. Let A = {A1, A2, … Am} be a system of sequences...
Let S1, S2,···, Sn be subsets of G, a finite abelian group of order v, containing k1, k2,...,kn ele...
AbstractLet G≃Z/k1Z⊕⋯⊕Z/kNZ be a finite abelian group with ki|ki−1(2≤i≤N). For a matrix Y=(ai,j)∈ZR×...
summary:We prove that if there exists a Cohen real over a model, then the family of perfect sets cod...
AbstractA subset S={s1,…,sk} of an abelian group G is called an St-set of size k if all sums of t di...
We construct a family of difference sets D with parameters v = 3s+1 (3s+1 − 1)/2, k = (3s+1 + 1)/2, ...
From two perfect 1-codes C′ and C′′ in cartesian products S′ respective S′′ we shall construct a per...
A (v, k, λ) difference set is a k-element subset D of a group G of order v for which the multiset {d...
Difference Systems of Sets (DSS) are combinatorial structures that are used in code synchronization....
AbstractUsing the representation theory of groups and the theory of cyclotomic fields, in this paper...
AbstractA perfect (v,{ki∣1≤i≤s},ρ) difference system of sets (DSS) is a collection of s disjoint ki-...
AbstractDifference systems of sets (DSS) are combinatorial configurations that arise in connection w...
AbstractDifference systems of sets (DSS) are combinatorial structures that are a generalization of c...
AbstractLet L be the cyclotomic field of the e-th roots of unity where e is even, and p be a prime o...
AbstractDifference Systems of Sets (DSS) are combinatorial configurations that arise in connection w...
AbstractLet m,n1,n2,…,nm and c be positive integers. Let A = {A1, A2, … Am} be a system of sequences...
Let S1, S2,···, Sn be subsets of G, a finite abelian group of order v, containing k1, k2,...,kn ele...
AbstractLet G≃Z/k1Z⊕⋯⊕Z/kNZ be a finite abelian group with ki|ki−1(2≤i≤N). For a matrix Y=(ai,j)∈ZR×...
summary:We prove that if there exists a Cohen real over a model, then the family of perfect sets cod...
AbstractA subset S={s1,…,sk} of an abelian group G is called an St-set of size k if all sums of t di...
We construct a family of difference sets D with parameters v = 3s+1 (3s+1 − 1)/2, k = (3s+1 + 1)/2, ...
From two perfect 1-codes C′ and C′′ in cartesian products S′ respective S′′ we shall construct a per...
A (v, k, λ) difference set is a k-element subset D of a group G of order v for which the multiset {d...
Difference Systems of Sets (DSS) are combinatorial structures that are used in code synchronization....
AbstractUsing the representation theory of groups and the theory of cyclotomic fields, in this paper...