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>

scholarly journals Switching of Edges in Strongly Regular Graphs I: A Family of Partial Difference Sets on 100 Vertices

10.37236/1710 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
L. K. Jørgensen ◽  
M. Klin
Keyword(s):  
Automorphism Groups ◽  
Difference Sets ◽  
Association Schemes ◽  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Partial Difference ◽  
Galois Correspondence ◽  
Partial Difference Sets ◽  
Strongly Regular ◽  
Open Question

We present 15 new partial difference sets over 4 non-abelian groups of order 100 and 2 new strongly regular graphs with intransitive automorphism groups. The strongly regular graphs and corresponding partial difference sets have the following parameters: (100,22,0,6), (100,36,14,12), (100,45,20,20), (100,44,18,20). The existence of strongly regular graphs with the latter set of parameters was an open question. Our method is based on combination of Galois correspondence between permutation groups and association schemes, classical Seidel's switching of edges and essential use of computer algebra packages. As a by-product, a few new amorphic association schemes with 3 classes on 100 points are discovered.

scholarly journals Pseudocyclic association schemes and strongly regular graphs

2010 ◽  
Vol 31 (6) ◽  
pp. 1513-1519 ◽  
Author(s):  
Takuya Ikuta ◽  
Akihiro Munemasa
Keyword(s):  
Association Schemes ◽  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Strongly Regular

scholarly journals Uniform Mixing and Association Schemes

10.37236/4745 ◽  
2017 ◽  
Vol 24 (3) ◽  
Author(s):  
Chris Godsil ◽  
Natalie Mullin ◽  
Aidan Roy
Keyword(s):  
Continuous Time ◽  
Hadamard Matrices ◽  
Quantum Walks ◽  
Association Schemes ◽  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Paley Graph ◽  
Time Quantum ◽  
Strongly Regular ◽  
Distance Regular Graphs

We consider continuous-time quantum walks on distance-regular graphs. Using results about the existence of complex Hadamard matrices in association schemes, we determine which of these graphs have quantum walks that admit uniform mixing.First we apply a result due to Chan to show that the only strongly regular graphs that admit instantaneous uniform mixing are the Paley graph of order nine and certain graphs corresponding to regular symmetric Hadamard matrices with constant diagonal. Next we prove that if uniform mixing occurs on a bipartite graph $X$ with $n$ vertices, then $n$ is divisible by four. We also prove that if $X$ is bipartite and regular, then $n$ is the sum of two integer squares. Our work on bipartite graphs implies that uniform mixing does not occur on $C_{2m}$ for $m \geq 3$. Using a result of Haagerup, we show that uniform mixing does not occur on $C_p$ for any prime $p$ such that $p \geq 5$. In contrast to this result, we see that $\epsilon$-uniform mixing occurs on $C_p$ for all primes $p$.

scholarly journals Normally Regular Digraphs

10.37236/4798 ◽  
2015 ◽  
Vol 22 (4) ◽  
Author(s):  
Leif K Jørgensen
Keyword(s):  
Directed Graph ◽  
Adjacency Matrix ◽  
Existence Results ◽  
Association Schemes ◽  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Combinatorial Objects ◽  
Strongly Regular ◽  
Regular Digraph ◽  
Structural Characterizations

A normally regular digraph with parameters $(v,k,\lambda,\mu)$ is a directed graph on $v$ vertices whose adjacency matrix $A$ satisfies the equation $AA^t=k I+\lambda (A+A^t)+\mu(J-I-A-A^t)$. This means that every vertex has out-degree $k$, a pair of non-adjacent vertices have $\mu$ common out-neighbours, a pair of vertices connected by an edge in one direction have $\lambda$ common out-neighbours and a pair of vertices connected by edges in both directions have $2\lambda-\mu$ common out-neighbours. We often assume that two vertices can not be connected in both directions. We prove that the adjacency matrix of a normally regular digraph is normal. A connected $k$-regular digraph with normal adjacency matrix is a normally regular digraph if and only if all eigenvalues other than $k$ are on one circle in the complex plane. We prove several non-existence results, structural characterizations, and constructions of normally regular digraphs. In many cases these graphs are Cayley graphs of abelian groups and the construction is then based on a generalization of difference sets.We also show connections to other combinatorial objects: strongly regular graphs, symmetric 2-designs and association schemes.

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
Sign in / Sign up

Export Citation Format

Share Document