The graph of 4-ary simplex codes of dimension 2

摘要

We give a complete description of the distance relation on the graph of 4-ary simplex codes of dimension 2. This is a connected graph of diameter 3. For every vertex we determine the sets of all vertices at distance i is an element of {1, 2, 3} and describe their symmetries. (c) 2020 Elsevier Inc. All rights reserved.