Ternary codes from graphs on triples (Q1044933)

In a previous paper, the authors obtained the properties of the binary codes formed from the span of an adjacency matrix of each of the three graphs with vertex set B, where B is the set of subsets of a set A of size large than 6, and with adjacency defined by two vertices as 3-sets being adjacent if they have zero, one or two elements in common, respectively. In this paper, it is shown that the ternary codes of these graphs have similar properties to the binary codes. The paper gives the main parameters of these ternary codes, the proof of which follows from a series of lemmas and propositions.