Related papers: Linear codes and incidence structures of bent func…
In the present paper, we give Assmus--Mattson type theorems for codes and lattices. We show that a binary doubly even self-dual code of length 24m with minimum weight 4m provides a combinatorial 1-design and an even unimodular lattice of…
Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. The objective of this paper is to study how to obtain $3$-designs with $2$-transitive permutation groups. The incidence…
In this paper, we first present a new secondary construction of bent functions (building new bent functions from two already defined ones). Furthermore, we apply the construction using as initial functions some specific bent functions and…
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
Combinatorial designs are closely related to linear codes. In recent year, there are a lot of $t$-designs constructed from certain linear codes. In this paper, we aim to construct $2$-designs from binary three-weight codes. For any binary…
A function $F:\mathbb{F}_2^n\rightarrow \mathbb{F}_2^n$, $n=2m$, can have at most $2^n-2^m$ bent component functions. Trivial examples are obtained as $F(x) = (f_1(x),\ldots,f_m(x),a_1(x),\ldots, a_m(x))$, where…
Plateaued functions as an extension of bent functions play a significant role in cryptography, coding theory, sequences and combinatorics. In \cite{Mesnager9}, Mesnager \emph{et al.} introduced generalized plateaued functions in order to…
Bent functions are maximally nonlinear Boolean functions with an even number of variables, which include a subclass of functions, the so-called hyper-bent functions whose properties are stronger than bent functions and a complete…
We prove an Assmus-Mattson-type theorem for block codes where the alphabet is the vertex set of a commutative association scheme (say, with $s$ classes). This in particular generalizes the Assmus-Mattson-type theorems for…
APN functions play a central role as building blocks in the design of many block ciphers, serving as optimal functions to resist differential attacks. One of the most important properties of APN functions is their linearity, which is…
We introduce and investigate binary $(k,k)$-designs -- combinatorial structures which are related to binary orthogonal arrays. We derive general linear programming bound and propose as a consequence a universal bound on the minimum possible…
Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of…
We give a new structural development of harmonic polynomials on Hamming space, and harmonic weight enumerators of binary linear codes, that parallels one approach to harmonic polynomials on Euclidean space and weighted theta functions of…
Zhou 2013 introduced modified planar functions to describe $(2^n,2^n,2^n,1)$ relative difference sets $R$ as a graph of a function on the finite field $\F_{2^n}$, and pointed out that projections of $R$ are difference sets that can be…
Artificial and biological neural networks (ANNs and BNNs) can encode inputs in the form of combinations of individual neurons' activities. These combinatorial neural codes present a computational challenge for direct and efficient analysis…
The main aim of the present paper is to introduce new methods for the study of combinatorial designs related to bent functions. They are based on interpretations of convolution on finite abelian groups as multiplication by a…
This paper examines a pair of bent functions on $\mathbb{Z}_2^{2m}$ and their relationship to a necessary condition for the existence of an automorphism of an edge-coloured graph whose colours are defined by the properties of a canonical…
We investigate linear and additive codes in partially ordered Hamming-like spaces that satisfy the extension property, meaning that automorphisms of ideals extend to automorphisms of the poset. The codes are naturally described in terms of…
Graphical designs are an extension of spherical designs to functions on graphs. We connect linear codes to graphical designs on cube graphs, and show that the Hamming code in particular is a highly effective graphical design. We show that…
In this article, we study algebraic decompositions and secondary constructions of almost perfect nonlinear (APN) functions. In many cases, we establish precise criteria which characterize when certain modifications of a given APN function…