On Constant-Weight Multi-Valued Sequences from Cyclic Difference Sets

Author(s):  
Takayasu KAIDA ◽  
Junru ZHENG
1999 ◽  
Vol 87 (1) ◽  
pp. 74-119 ◽  
Author(s):  
Ronald Evans ◽  
Henk D.L. Hollmann ◽  
Christian Krattenthaler ◽  
Qing Xiang

1977 ◽  
Vol 16 (3) ◽  
pp. 361-369
Author(s):  
M. Deza ◽  
Peter Eades

Necessary and sufficient conditions are given for a square matrix to te the matrix of distances of a circulant code. These conditions are used to obtain some inequalities for cyclic difference sets, and a necessary condition for the existence of circulant weighing matrices.


2000 ◽  
Vol 70 (233) ◽  
pp. 357-367 ◽  
Author(s):  
Peter Gaal ◽  
Solomon W. Golomb

2016 ◽  
Vol 5 (3) ◽  
pp. 73 ◽  
Author(s):  
E. Sandi ◽  
F. Y. Zulkifli ◽  
E. T. Rahardjo

Reducing system complexity and cost in synthesizing a sparse array antenna design is a challenging task for practical communication systems, such as radar systems and space communication. In this paper, a hybrid technique to synthesize a linear sparse array antenna design is described. This technique is developed using two methods. The first method is a combinatorial approach that applies cyclic difference sets (CDS) integers to significantly reduce the number of antenna elements. The approach and procedure used to apply the new CDS method to configure a linear sparse array, with significant reduction of the spatial antenna dimension, is described. The second method, applied to the array result of the first method, is amplitude tapering using a binomial array approach to reduce the sidelobes level (SLL). The simulation and measurement results of the sample sparse array design showed that the SLL was reduced in comparison to the sparse array design using only the combinatorial CDS method.


Sign in / Sign up

Export Citation Format

Share Document