New pseudo-planar binomials in characteristic two and related schemes

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.

[1]  Eiichi Bannai,et al.  Subschemes of some association schemes , 1991 .

[2]  William J. Martin,et al.  On the equivalence between real mutually unbiased bases and a certain class of association schemes , 2010, Eur. J. Comb..

[3]  Cunsheng Ding,et al.  A family of optimal constant-composition codes , 2005, IEEE Transactions on Information Theory.

[4]  Cunsheng Ding,et al.  Linear codes from perfect nonlinear mappings and their secret sharing schemes , 2005, IEEE Transactions on Information Theory.

[5]  A. Neumaier,et al.  Distance Regular Graphs , 1989 .

[6]  Cunsheng Ding,et al.  The weight distribution of a class of linear codes from perfect nonlinear functions , 2006, IEEE Transactions on Information Theory.

[7]  Lars R. Knudsen,et al.  Provable Security Against Differential Cryptanalysis , 1992, CRYPTO.

[8]  N. J. A. Sloane,et al.  The Z4-linearity of Kerdock, Preparata, Goethals, and related codes , 1994, IEEE Trans. Inf. Theory.

[9]  Yue Zhou.  (2n,2n,2n,1)‐Relative Difference Sets and Their Representations , 2013 .

[10]  Yue Zhou,et al.  Planar functions over fields of characteristic two , 2013, ArXiv.

[11]  Cunsheng Ding,et al.  Systematic authentication codes from highly nonlinear functions , 2004, IEEE Transactions on Information Theory.

[12]  Cunsheng Ding,et al.  Signal Sets From Functions With Optimum Nonlinearity , 2007, IEEE Transactions on Communications.

[13]  Sho Suda,et al.  Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets , 2008, J. Comb. Theory A.

[14]  E. Bannai,et al.  Algebraic Combinatorics I: Association Schemes , 1984 .

[15]  Kanat S. Abdukhalikov.  Symplectic spreads, planar functions, and mutually unbiased bases , 2013, ArXiv.

[16]  Z. Wan.  Lectures on Finite Fields and Galois Rings , 2003 .

[17]  Iwan M. Duursma,et al.  Translates of linear codes over Z4 , 1997, IEEE Trans. Inf. Theory.

[18]  Robert A. Liebler,et al.  Certain distance-regular digraphs and related rings of characteristic 4 , 1988, J. Comb. Theory, Ser. A.

[19]  Cunsheng Ding.  Cyclic Codes from APN and Planar Functions , 2012, ArXiv.

[20]  Qing Xiang,et al.  Pseudo-Paley graphs and skew Hadamard difference sets from presemifields , 2007, Des. Codes Cryptogr..

[21]  P. Dembowski,et al.  Planes of ordern with collineation groups of ordern2 , 1968 .