English
Related papers

Related papers: Linear codes and incidence structures of bent func…

200 papers

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…

Combinatorics · Mathematics 2019-04-26 Cunsheng Ding , Akihiro Munemasa , Vladimir Tonchev

Special functions, coding theory and $t$-designs have close connections and interesting interplay. A standard approach to constructing $t$-designs is the use of linear codes with certain regularity. The Assmus-Mattson Theorem and the…

Information Theory · Computer Science 2019-07-31 Chunming Tang , Cunsheng Ding , Maosheng Xiong

There are two construction methods of designs from $(n,m)$-bent functions, known as translation and addition designs. In this paper we analyze, which equivalence relation for Boolean bent functions, i.e. $(n,1)$-bent functions, and…

Information Theory · Computer Science 2021-05-04 Alexandr Polujan , Alexander Pott

In this paper, we mainly investigate profound interconnections between combinatorial designs, linear codes, and Boolean functions.

Information Theory · Computer Science 2026-05-26 Jong Yoon Hyun , Jieun Kwon , Jiaxin Wang , Yansheng Wu

Linear codes over finite fields parameterized by functions have proven to be a powerful tool in coding theory, yielding optimal and few-weight codes with significant applications in secret sharing, authentication codes, and association…

Information Theory · Computer Science 2026-02-17 Virginio Fratianni , Sihem Mesnager

Due to their important applications to coding theory, cryptography, communications and statistics, combinatorial $t$-designs have been attracted lots of research interest for decades. The interplay between coding theory and $t$-designs has…

Combinatorics · Mathematics 2019-12-17 Rong Wang , Xiaoni Du , Cuiling Fan , Zhihua Niu

A classical method of constructing a linear code over $\gf(q)$ with a $t$-design is to use the incidence matrix of the $t$-design as a generator matrix over $\gf(q)$ of the code. This approach has been extensively investigated in the…

Information Theory · Computer Science 2015-03-24 Cunsheng Ding

In this paper we study those bent functions which are linear on elements of spreads, their connections with ovals and line ovals, and we give descriptions of their dual bent functions. In particular, we give a geometric characterization of…

Combinatorics · Mathematics 2026-01-27 Kanat Abdukhalikov

Whereas the design and properties of bent and plateaued functions have been frequently addressed during the past few decades, there are only a few design methods of so-called 5-valued spectra Boolean functions whose Walsh spectra takes the…

Information Theory · Computer Science 2018-11-29 S. Hodžić , E. Pasalic , W. G. Zhang

Let $n$ be an even positive integer, and $m<n$ be one of its positive divisors. In this paper, inspired by a nice work of Tang et al. on constructing large classes of bent functions from known bent functions [27, IEEE TIT, 63(10):…

Information Theory · Computer Science 2019-05-28 Lijing Zheng , Jie Peng , Haibin Kan , Yanjun Li

Vectorial dual-bent functions have recently attracted some researchers' interest as they play a significant role in constructing partial difference sets, association schemes, bent partitions and linear codes. In this paper, we further study…

Information Theory · Computer Science 2023-09-26 Jiaxin Wang , Fang-Wei Fu , Yadi Wei , Jing Yang

For any positive integers $n=2k$ and $m$ such that $m\geq k$, in this paper we show the maximal number of bent components of any $(n,m)$-functions is equal to $2^{m}-2^{m-k}$, and for those attaining the equality, their algebraic degree is…

Information Theory · Computer Science 2019-05-28 Lijing Zheng , Jie Peng , Haibin Kan , Yanjun Li , Juan Luo

This paper is concerned with the affine-invariant ternary codes which are defined by Hermitian functions. We compute the incidence matrices of 2-designs that are supported by the minimum weight codewords of these ternary codes. The linear…

Information Theory · Computer Science 2020-07-29 Zhiwen He , Jiejing Wen

Coding theory and $t$-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight…

Information Theory · Computer Science 2019-02-07 Chunming Tang , Cunsheng Ding , Maosheng Xiong

Bent functions are balanced by restricting their domains to vectors with either even or odd Hamming weights, which ensures an equal number of pre-images for both, 0 and 1. Using the previous fact, we can construct bent functions on two…

General Mathematics · Mathematics 2025-08-27 Juan Carlos Ku-Cauich , Javier Arturo Díaz-Vargas , Sara Mandujano-Velazquez

Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight…

Information Theory · Computer Science 2025-11-25 Dongmei Huang , Qunying Liao , Sihem Mesnager , Gaohua Tang , Haode Yan

Two-to-one ($2$-to-$1$) mappings over finite fields play an important role in symmetric cryptography. In particular they allow to design APN functions, bent functions and semi-bent functions. In this paper we provide a systematic study of…

Information Theory · Computer Science 2019-07-03 Sihem Mesnager , Longjiang Qu

The design of plateaued functions over $GF(2)^n$, also known as 3-valued Walsh spectra functions (taking the values from the set $\{0, \pm 2^{\lceil \frac{n+s}{2} \rceil}\}$), has been commonly approached by specifying a suitable algebraic…

Information Theory · Computer Science 2018-11-13 S. Hodžić , E. Pasalic , Y. Wei , F. Zhang

Inspired by a recent work of Mesnager, we present several new infinite families of quadratic ternary bent, near-bent and 2-plateaued functions from some known quadratic ternary bent functions. Meanwhile, the distribution of the Walsh…

Information Theory · Computer Science 2015-08-17 Guangkui Xu , Xiwang Cao

We previously proposed the first nontrivial examples of a code having support $t$-designs for all weights obtained from the Assmus-Mattson theorem and having support $t'$-designs for some weights with some $t'>t$. This suggests the…

Combinatorics · Mathematics 2022-04-21 Tsuyoshi Miezaki , Hiroyuki Nakasora
‹ Prev 1 2 3 10 Next ›