scholarly journals A construction of linear codes and strongly regular graphs fromq-polynomials

2017 ◽  
Vol 340 (9) ◽  
pp. 2262-2274
Author(s):  
Gaojun Luo ◽  
Xiwang Cao
Keyword(s):  
Linear Codes ◽  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Strongly Regular

scholarly journals Two-weight and three-weight linear codes constructed from Weil sums

2022 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Tonghui Zhang ◽  
Hong Lu ◽  
Shudi Yang
Keyword(s):  
Secret Sharing ◽  
Linear Codes ◽  
Association Schemes ◽  
Strongly Regular Graphs ◽  
Secret Sharing Schemes ◽  
Regular Graphs ◽  
Authentication Codes ◽  
Strongly Regular ◽  
Weil Sums ◽  
Defining Sets

<p style='text-indent:20px;'>Linear codes with few weights are widely used in strongly regular graphs, secret sharing schemes, association schemes and authentication codes. In this paper, we construct several two-weight and three-weight linear codes over finite fields by choosing suitable different defining sets. We also give some examples and some of the codes are optimal or almost optimal. Their applications to secret sharing schemes are also investigated.</p>

On extensions of small strongly regular graphs with eigenvalue 3

2015 ◽  
Vol 92 (1) ◽  
pp. 482-486
Author(s):  
A. A. Makhnev ◽  
D. V. Paduchikh
Keyword(s):  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Strongly Regular

On triple systems and strongly regular graphs

2012 ◽  
Vol 119 (7) ◽  
pp. 1414-1426 ◽  
Author(s):  
Majid Behbahani ◽  
Clement Lam ◽  
Patric R.J. Östergård
Keyword(s):  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Triple Systems ◽  
Strongly Regular

On the Extendability of Quasi-Strongly Regular Graphs with Diameter 2

2018 ◽  
Vol 34 (4) ◽  
pp. 711-726 ◽  
Author(s):  
Hermina Alajbegović ◽  
Almir Huskanović ◽  
Štefko Miklavič ◽  
Primož Šparl
Keyword(s):  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Strongly Regular
Sign in / Sign up

Export Citation Format

Share Document