Abstract

A difference set (,D) is defined in (2) as a subset D of k elements in a group of order υ with the following properties : (1) if x ∊ , x ≠ 1, there are exactly λ distinct ordered pairs (d 1 d 2) of elements of D such that x = 1 d 2; (2) if x ∊ , x ≠ 1, there are exactly λ distinct ordered pairs (3 d 4) of elements of D such that x = 3 d 4−1.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call