AbstractDifference systems of sets (DSS) are combinatorial configurations that arise in connection with code synchronization. A method for the construction of DSS from partitions of cyclic difference sets was introduced in [V.D. Tonchev, Difference systems of sets and code synchronization, Rend. Sem. Mat. Messina, Ser. II, t. XXV 9 (2003) 217–226] and applied to cyclic difference sets (n,(n-1)/2,(n-3)/4) of Paley type, where n≡3(mod4) is a prime number. This paper develops similar constructions for prime numbers n≡1(mod4) that use partitions of the set of quadratic residues, as well as more general cyclotomic classes
Qualified difference sets are a class of combinatorial configuration. The sets are related to the r...
AbstractA direct construction is given for a cyclic difference family of (4pn,4,1)-design for all p≡...
AbstractMann (Canad. J. Math. (1952), 222–226) has proved that 2 is a multiplier for a cyclic differ...
Difference systems of sets (DSS) are combinatorial configurations that arise in connection with code...
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...
AbstractDifference Systems of Sets (DSS) are combinatorial configurations that arise in connection w...
Qualified difference sets (QDS) composed of unions of cyclotomic classes are discussed. An exhaustiv...
www.math.mtu.edu/∼tonchev Abstract — Difference systems of sets can be used to transform an arbitrar...
AbstractA perfect (v,{ki∣1≤i≤s},ρ) difference system of sets (DSS) is a collection of s disjoint ki-...
AbstractHere, (255, 127, 63)-cyclic difference sets are exhaustively constructed. There are, in tota...
AbstractLet m ≥ 2 be an integer. We define four families of m-adic residue codes of prime length and...
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code...
Difference Systems of Sets (DSS) are combinatorial structures that are used in code synchronization....
AbstractWith the exception of two (21, 5, 1) difference sets quoted in L. D. Baumert's 1971 survey, ...
Qualified difference sets are a class of combinatorial configuration. The sets are related to the r...
AbstractA direct construction is given for a cyclic difference family of (4pn,4,1)-design for all p≡...
AbstractMann (Canad. J. Math. (1952), 222–226) has proved that 2 is a multiplier for a cyclic differ...
Difference systems of sets (DSS) are combinatorial configurations that arise in connection with code...
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...
AbstractDifference Systems of Sets (DSS) are combinatorial configurations that arise in connection w...
Qualified difference sets (QDS) composed of unions of cyclotomic classes are discussed. An exhaustiv...
www.math.mtu.edu/∼tonchev Abstract — Difference systems of sets can be used to transform an arbitrar...
AbstractA perfect (v,{ki∣1≤i≤s},ρ) difference system of sets (DSS) is a collection of s disjoint ki-...
AbstractHere, (255, 127, 63)-cyclic difference sets are exhaustively constructed. There are, in tota...
AbstractLet m ≥ 2 be an integer. We define four families of m-adic residue codes of prime length and...
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code...
Difference Systems of Sets (DSS) are combinatorial structures that are used in code synchronization....
AbstractWith the exception of two (21, 5, 1) difference sets quoted in L. D. Baumert's 1971 survey, ...
Qualified difference sets are a class of combinatorial configuration. The sets are related to the r...
AbstractA direct construction is given for a cyclic difference family of (4pn,4,1)-design for all p≡...
AbstractMann (Canad. J. Math. (1952), 222–226) has proved that 2 is a multiplier for a cyclic differ...