Description
Boolean bent functions are a fascinating topic in Discrete Mathematics because there are many connections with other fields of mathematics. For example, bent functions are related to the covering radius problem of the first order Reed Muller code, they give symmetric designs and Hadamard matrices as well as strongly regular graphs. Some of theses connections will be described in my talk. A little less known are p-ary bent functions where p is an odd prime. I will show that such p-ary bent functions are related to many different fields in Discrete Mathematics, too, in particular to strongly regular graphs.
Primary author
Prof.
Alexander Pott
(Universität Magdeburg)
