Codes from Adjacency Matrices of Uniform Subset Graphs

Abstract

Studies of the p-ary codes from the adjacency matrices of uniform subset graphs Γ (n, k, r) and their reflexive associates have shown that a particular family of codes defined on the subsets are intimately related to the codes from these graphs. We describe these codes here and examine their relation to some particular classes of uniform subset graphs. In particular we include a complete analysis of the p-ary codes from Γ (n, 3, r) for p ≥ 5, thus extending earlier results for p = 2, 3.