A link between combinatorial designs and three-weight linear codes
Links between different discrete structures (linear codes, combinatorial designs, connected graphs, some cryptographic primitives, etc.) have been a subject of research of many authors. By these links some obtained results about a given structure can be applied into the others. In this paper, the author describes that partial geometric designs can be constructed from 3-weight codes, almost bent functions and ternary weakly regular bent functions. They show that existence of certain partial geometric designs is equivalent to existence of some families of 3-weight codes. Also, the author introduces a family of graphs related to a family of 3-weight codes. Finally, he provide a classification of Cayley graphs obtained from partial geometric difference sets and weakly regular bent functions.
scientific article; zbMATH DE number 6858025
scientific article