BINARY CODES FROM UNIFORM SUBSET GRAPH G(v, ۴, t)

Let be a set of size n, where n ≥ ۸ and V ۰۲۴ be the set of all subsets of size ۴. Let G(v, ۴, t) (t = ۰, ۱, ۲, ۳) be the graph with vertex set V, such that two vertices are adjacent if they have intersection of size t. This graph is called uniform subset graph. We denote the adjacency matrix of G(v, ۴, t) with At(n). In this paper, we study the codes obtained from A+ (n) and denote them by Ct(n). Also we give some of their relations.

کلیدواژه ها:

Binary Code ، Design ، Uniform Subset Graph ، Adjacency Matrix