Binary codes from graphs on triples and permutation decoding

We show that permutation decoding can be used, and give explicit PD-sets in the symmetric group, for some of the binary codes obtained from the adjacency matrices of the graphs on ` n 3 vertices, for n ≥ 7, with adjacency defined by the vertices as 3-sets being adjacent if they have zero, one or two elements in common, respectively.