scholarly journals Almost difference sets in nonabelian groups

2018 ◽  
Vol 87 (6) ◽  
pp. 1243-1251
Author(s):  
Jerod Michel ◽  
Qi Wang
2009 ◽  
Vol 57 (12) ◽  
pp. 3800-3812 ◽  
Author(s):  
G. Oliveri ◽  
M. Donelli ◽  
A. Massa

2019 ◽  
Vol 2019 ◽  
pp. 1-8
Author(s):  
Wanfeng Qi ◽  
Yueying Song ◽  
Rui Ma ◽  
Lingli Tang ◽  
Qian Wang

Asymptotically optimal codebooks are a family of codebooks that can approach an optimal codebook meeting the Welch bound when the lengths of codewords are large enough. They can be constructed easily and are a good alternative for optimal codebooks in many applications. In this paper, we construct a new class of asymptotically optimal codebooks by using the product of some special finite fields and almost difference sets, which are composed of cyclotomic classes of order eight.


2016 ◽  
Vol 20 (1) ◽  
pp. 61-64
Author(s):  
Minglong Qi ◽  
Shengwu Xiong ◽  
Jingling Yuan ◽  
Wenbi Rao ◽  
Luo Zhong

10.37236/927 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
Omar A. AbuGhneim ◽  
Ken W. Smith

We resolve the existence problem of $(96,20,4)$ difference sets in 211 of 231 groups of order $96$. If $G$ is a group of order $96$ with normal subgroups of orders $3$ and $4$ then by first computing $32$- and $24$-factor images of a hypothetical $(96,20,4)$ difference set in $G$ we are able to either construct a difference set or show a difference set does not exist. Of the 231 groups of order 96, 90 groups admit $(96,20,4)$ difference sets and $121$ do not. The ninety groups with difference sets provide many genuinely nonabelian difference sets. Seven of these groups have exponent 24. These difference sets provide at least $37$ nonisomorphic symmetric $(96,20,4)$ designs.


2006 ◽  
Vol 52 (5) ◽  
pp. 2052-2061 ◽  
Author(s):  
Yuan Zhang ◽  
Jian Guo Lei ◽  
Shao Pu Zhang

2001 ◽  
Vol 47 (7) ◽  
pp. 2934-2943 ◽  
Author(s):  
K.T. Arasu ◽  
C. Ding ◽  
T. Helleseth ◽  
P.V. Kumar ◽  
H.M. Martinsen

Sign in / Sign up

Export Citation Format

Share Document