New pseudo-planar binomials in characteristic two and related schemes
arXiv:1304.7044 · doi:10.1007/s10623-014-9958-0
Abstract
Planar functions in odd characteristic were introduced by Dembowski and Ostrom in order to construct finite projective planes in 1968. They were also used in the constructions of DES-like iterated ciphers, error-correcting codes, and signal sets. Recently, a new notion of pseudo-planar functions in even characteristic was proposed by Zhou. These new pseudo-planar functions, as an analogue of planar functions in odd characteristic, also bring about finite projective planes. There are three known infinite families of pseudo-planar monomial functions constructed by Schmidt and Zhou, and Scherr and Zieve. In this paper, three new classes of pseudo-planar binomials are provided. Moreover, we find that each pseudo-planar function gives an association scheme which is defined on a Galois ring.
arXiv commentReplaced the term "planar" with "pseudo-planar"; revised argument in section 3
References in corpus (5)
- The Z_4-Linearity of Kerdock, Preparata, Goethals and Related Codes
- Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
- Cyclic Codes from APN and Planar Functions
- Planar functions over fields of characteristic two
- (2^n,2^n,2^n,1)-relative difference sets and their representations