Hadamard Equiangular Tight Frames

An equiangular tight frame (ETF) is a type of optimal packing of lines in Euclidean space. They are often represented as the columns of a short, fat matrix. In certain applications we want this matrix to be flat, that is, have the property that all of its entries have modulus one. In particular, real flat ETFs are equivalent to self-complementary binary codes that achieve the Grey-Rankin bound. Some flat ETFs are (complex) Hadamard ETFs, meaning they arise by extracting rows from a (complex) Hadamard matrix. These include harmonic ETFs, which are obtained by extracting the rows of a character table that correspond to a difference set in the underlying finite abelian group. In this paper, we give some new results about flat ETFs. One of these results gives an explicit Naimark complement for all Steiner ETFs, which in turn implies that all Kirkman ETFs are possibly-complex Hadamard ETFs. This in particular produces a new infinite family of real flat ETFs. Another result establishes an equivalence between real flat ETFs and certain types of quasi-symmetric designs, resulting in a new infinite family of such designs

Bent Vectorial Functions, Codes and Designs

Bent functions, or equivalently, Hadamard difference sets in the elementary Abelian group (\gf(2^{2m}), +), have been employed to construct symmetric and quasi-symmetric designs having the symmetric difference property. The main objective of this paper is to use bent vectorial functions for a construction of a two-parameter family of binary linear codes that do not satisfy the conditions of the Assmus-Mattson theorem, but nevertheless hold $2$-designs. A new coding-theoretic characterization of bent vectorial functions is presented

On some codes from rank 3 primitive actions of the simple Chevalley group G2(q)

Please read abstract in the article.The National Research Foundation of South Africahttp://aimsciences.org/journals/amc/index.htmhj2022Mathematics and Applied Mathematic