Three-weight ternary linear codes from a family of cyclic difference sets

2018 ◽  
Vol 86 (11) ◽  
pp. 2513-2523 ◽  
Author(s):  
Zhengchun Zhou
1999 ◽  
Vol 87 (1) ◽  
pp. 74-119 ◽  
Author(s):  
Ronald Evans ◽  
Henk D.L. Hollmann ◽  
Christian Krattenthaler ◽  
Qing Xiang

2011 ◽  
Vol 68 (1-3) ◽  
pp. 407-425 ◽  
Author(s):  
Tatsuya Maruta ◽  
Yusuke Oya

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

2002 ◽  
Vol 1 (1) ◽  
pp. 35
Author(s):  
S. GURITMAN

<p>An [n,k, dh-code is a ternary linear code with length n, dimension k and minimum distance d. We prove that codes with parameters [110,6, 72h, [109,6,71h, [237,6,157b, [69,7,43h, and [120,9,75h do not exist.</p>


Sign in / Sign up

Export Citation Format

Share Document